168342025-05-13 18:42:13vargaviviÁruszállítás üres szakaszaicpp17Accepted 50/5085ms4320 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 || i == 1)) ans ++;
	}
	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/085ms4148 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms756 KiB
12Accepted2/22ms772 KiB
13Accepted3/34ms564 KiB
14Accepted3/38ms1016 KiB
15Accepted3/34ms1080 KiB
16Accepted3/363ms4192 KiB
17Accepted3/364ms4320 KiB
18Accepted3/371ms4320 KiB
19Accepted3/38ms1844 KiB
20Accepted3/39ms2356 KiB
21Accepted3/376ms4148 KiB
22Accepted3/375ms4320 KiB