213642026-01-12 20:44:59algoproÁruszállítás üres szakaszaicpp17Wrong answer 14/5083ms4328 KiB
// UUID: c27e957a-baee-4b4e-a408-829e993f021f
#include <bits/stdc++.h>
using namespace std;

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

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

    long long cnt=0, ans=0;
    if (tav[0]==0) ans++;
    for (long long i=0; i<n; i++) {
        long long temp=cnt;
        cnt+=tav[i];
        if (temp!=cnt && cnt==0) ans++;
        
    }
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms500 KiB
2Wrong answer0/083ms4320 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Accepted2/21ms564 KiB
12Accepted2/22ms564 KiB
13Wrong answer0/34ms768 KiB
14Wrong answer0/37ms1076 KiB
15Wrong answer0/36ms1076 KiB
16Wrong answer0/363ms4164 KiB
17Wrong answer0/364ms4148 KiB
18Wrong answer0/371ms4148 KiB
19Wrong answer0/38ms1844 KiB
20Wrong answer0/39ms2356 KiB
21Wrong answer0/372ms4296 KiB
22Wrong answer0/379ms4328 KiB