144232025-01-10 18:22:57VarszegiLeventeÁruszállítás üres szakaszaicpp17Accepted 50/5086ms8168 KiB
#include <iostream>
#include <bits/stdc++.h>

using namespace std;
/*
10 4
8 10
2 6
2 3
3 4
*/
int main()
{
    int n, q; cin >> n >> q;
    vector<int> delta(n + 1, 0);
    for(int i = 0; i < q; i++){
        int a, b; cin >> a >> b;
        delta[a]++;
        delta[b]--;
    }
    int counter = 0;
    vector<int> packs(n + 1, 0);
    for(int i = 1; i <= n; i++){
        packs[i] = packs[i - 1] + delta[i];
    }
    packs[0] = 1;
    for(int i = 1; i <= n - 1; i++){
        if(packs[i] == 0 and packs[i - 1] != 0){
            counter++;
        }
    }
    cout << counter;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/086ms7988 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms868 KiB
12Accepted2/22ms1076 KiB
13Accepted3/36ms1136 KiB
14Accepted3/38ms1644 KiB
15Accepted3/36ms1848 KiB
16Accepted3/364ms7988 KiB
17Accepted3/368ms8164 KiB
18Accepted3/375ms7988 KiB
19Accepted3/39ms3380 KiB
20Accepted3/312ms4160 KiB
21Accepted3/382ms8164 KiB
22Accepted3/381ms8168 KiB