213622026-01-12 20:38:14algoproÁruszállítás üres szakaszaicpp17Wrong answer 34/5085ms4328 KiB
// UUID: 632a17c1-6fd0-4e96-b40a-82b3ef036823
#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;
    for (long long i=0; i<n; i++) {
        long long temp=cnt;
        cnt+=tav[i];
        if (temp!=cnt && cnt==0) ans++;
    }
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base34/50
1Accepted0/01ms500 KiB
2Accepted0/085ms4148 KiB
3Wrong answer0/21ms508 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms324 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Wrong answer0/21ms612 KiB
12Wrong answer0/22ms564 KiB
13Accepted3/34ms568 KiB
14Accepted3/38ms1128 KiB
15Accepted3/34ms1124 KiB
16Accepted3/361ms4320 KiB
17Accepted3/364ms4324 KiB
18Accepted3/371ms4148 KiB
19Accepted3/38ms1844 KiB
20Accepted3/39ms2356 KiB
21Accepted3/374ms4148 KiB
22Accepted3/375ms4328 KiB