216852026-01-13 18:05:44algoproÁruszállítás üres szakaszaicpp17Wrong answer 2/5093ms4332 KiB
// UUID: 89d21f45-c01f-42b2-a29e-a59c4b122992
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m;
	cin >> n >> m;

	vector<int> diff(n + 2, 0);

	for(int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		diff[a]++;
		diff[b]--;
	}

	long long akt = 0;
	long long ures = 0;

	for (int i = 1; i < n; i++) {
		long long elozo = akt;
		akt += diff[i];
		if (akt == 0 && elozo > 0) ures++;
	}

	cout << ures;
}
SubtaskSumTestVerdictTimeMemory
base2/50
1Accepted0/01ms508 KiB
2Wrong answer0/093ms4148 KiB
3Wrong answer0/21ms316 KiB
4Accepted2/21ms500 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms348 KiB
7Wrong answer0/21ms508 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/21ms628 KiB
12Wrong answer0/21ms564 KiB
13Wrong answer0/34ms804 KiB
14Wrong answer0/37ms1076 KiB
15Wrong answer0/34ms1136 KiB
16Wrong answer0/363ms4320 KiB
17Wrong answer0/364ms4324 KiB
18Wrong answer0/372ms4148 KiB
19Wrong answer0/39ms1844 KiB
20Wrong answer0/310ms2292 KiB
21Wrong answer0/375ms4148 KiB
22Wrong answer0/376ms4332 KiB