214402026-01-13 08:54:20algoproÁruszállítás üres szakaszaicpp17Wrong answer 34/5090ms4324 KiB
// UUID: 034aa60a-7f4b-451c-895a-076788d9af69
#include <bits/stdc++.h>
using namespace std;

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

	vector<int> diffs(n+1, 0);
	for (int i=0;i<m;i++){
		int start, end;
		cin >> start >> end;
		diffs[start]++;
		diffs[end]--;
	}
	// for(int d:diffs){
	// 	cout << d << " ";
	// }
	// cout << "\n";

	int empty_section_count = 0;
	int total = 0;
	for(int i=0;i<=n;i++){
		total += diffs[i];
		if(total==0){ // found the beginning of an empty section
			empty_section_count++;
			while(i<n && total == 0){
				i++;
				total += diffs[i];
			}
		}
	}
	cout << empty_section_count - 1;
}
SubtaskSumTestVerdictTimeMemory
base34/50
1Accepted0/01ms316 KiB
2Accepted0/090ms4148 KiB
3Wrong answer0/21ms512 KiB
4Wrong answer0/21ms500 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms508 KiB
11Wrong answer0/21ms564 KiB
12Wrong answer0/22ms564 KiB
13Accepted3/34ms768 KiB
14Accepted3/37ms1076 KiB
15Accepted3/34ms1076 KiB
16Accepted3/361ms4148 KiB
17Accepted3/364ms4324 KiB
18Accepted3/371ms4148 KiB
19Accepted3/38ms1844 KiB
20Accepted3/39ms2356 KiB
21Accepted3/374ms4148 KiB
22Accepted3/375ms4324 KiB