213652026-01-12 21:05:39algoproÁruszállítás üres szakaszaicpp17Wrong answer 14/5092ms4320 KiB
// UUID: dd0a869f-6c67-4d47-8a42-dc14ddcd1eb4
#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;
    bool ures=false;
    for (long long i=0; i<n; i++) {
        cnt+=tav[i];
        if (cnt==0 && !ures) {
            ans++;
            ures=1;
        }
        else if (cnt>0) ures=0;
        
    }
    /*
    for (int i = 0; i < n-1; i++) {
        cnt+= tav[i];
        if (cnt == 0) ans++;
    }*/
    cout << ans;
}
//2 0 0 -1 0 -1 0 1 -1 0
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/092ms4148 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/36ms564 KiB
14Wrong answer0/38ms1076 KiB
15Wrong answer0/34ms1080 KiB
16Wrong answer0/364ms4320 KiB
17Wrong answer0/364ms4148 KiB
18Wrong answer0/371ms4152 KiB
19Wrong answer0/38ms1844 KiB
20Wrong answer0/310ms2372 KiB
21Wrong answer0/374ms4148 KiB
22Wrong answer0/376ms4148 KiB