213662026-01-12 21:13:02algoproÁruszállítás üres szakaszaicpp17Accepted 50/5085ms4324 KiB
// UUID: c7f9a9bd-0ed3-4a78-a6da-45b3501a2702
#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;
        
    }*/

    int cnt = 0;
int ans = 0;
bool prev_zero = false;

for (int i = 0; i < n-1; i++) {
    cnt += tav[i];

    bool curr_zero = (cnt == 0);

    if (curr_zero && !prev_zero) {
        ans++;
    }

    prev_zero = curr_zero;
}
    /*
    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
base50/50
1Accepted0/01ms316 KiB
2Accepted0/085ms4148 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms376 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms508 KiB
11Accepted2/22ms564 KiB
12Accepted2/22ms660 KiB
13Accepted3/34ms568 KiB
14Accepted3/38ms1260 KiB
15Accepted3/36ms1076 KiB
16Accepted3/364ms4324 KiB
17Accepted3/364ms4148 KiB
18Accepted3/374ms4148 KiB
19Accepted3/38ms1728 KiB
20Accepted3/310ms2368 KiB
21Accepted3/375ms4316 KiB
22Accepted3/376ms4148 KiB