168292025-05-13 18:31:15vargaviviÁruszállítás üres szakaszaicpp17Wrong answer 34/5089ms4328 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	vector<int> diff(n + 1);
	for (int i = 0; i < m; i ++) {
		int x, y;
		cin >> x >> y;
		diff[x] ++;
		diff[y] --;
	}
	int sum = 0, ans = 0;
	for (int i = 1; i <= n; i ++) {
		sum += diff[i];
		if (sum == 0 && diff[i] != 0) ans ++;
	}
	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base34/50
1Accepted0/01ms316 KiB
2Accepted0/089ms4148 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms348 KiB
10Accepted2/21ms316 KiB
11Wrong answer0/21ms564 KiB
12Wrong answer0/21ms564 KiB
13Accepted3/34ms668 KiB
14Accepted3/37ms1128 KiB
15Accepted3/34ms1132 KiB
16Accepted3/361ms4328 KiB
17Accepted3/361ms4148 KiB
18Accepted3/371ms4148 KiB
19Accepted3/38ms1844 KiB
20Accepted3/39ms2356 KiB
21Accepted3/374ms4148 KiB
22Accepted3/372ms4324 KiB