140752025-01-09 18:18:24khunÁruszállítás üres szakaszaicpp17Wrong answer 34/5089ms4412 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m, a ,b, res=0, curr = 0;
    cin >> n >> m;
    vector<int> v(n+1);
    for(int i=0; i < m; i++) {
        cin >> a >> b;
        v[a]++;
        v[b]--;
    }
    v[0] = 1;
    for(int i = 1; i <= n; i++) {
        curr+=v[i];
        if(curr == 0 && v[i] != 0) res++;
    }
    cout << res;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base34/50
1Accepted0/01ms316 KiB
2Accepted0/089ms4148 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms320 KiB
5Wrong answer0/21ms356 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms364 KiB
10Accepted2/21ms500 KiB
11Wrong answer0/21ms564 KiB
12Wrong answer0/21ms612 KiB
13Accepted3/34ms564 KiB
14Accepted3/37ms1076 KiB
15Accepted3/34ms1076 KiB
16Accepted3/361ms4148 KiB
17Accepted3/363ms4148 KiB
18Accepted3/371ms4320 KiB
19Accepted3/38ms1844 KiB
20Accepted3/310ms2356 KiB
21Accepted3/375ms4340 KiB
22Accepted3/372ms4412 KiB