209842026-01-11 23:05:14hunzombiÁruszállítás üres szakaszaicpp17Wrong answer 24/5035ms4264 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<int> vec(n + 2, 0);
    for (int i=0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        vec[u]++; vec[v + 1]--;
    }
    int prev = -1;
    int cnt = 0;
    int ans = 0;
    for (int i=1; i <= n; i++) {
        cnt += vec[i];
        if (cnt == 0 && prev != 0) ans++;
        prev = cnt;
    }
    cout << ans << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base24/50
1Accepted0/01ms316 KiB
2Accepted0/035ms4148 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms352 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms564 KiB
12Wrong answer0/21ms564 KiB
13Wrong answer0/32ms564 KiB
14Wrong answer0/33ms1124 KiB
15Wrong answer0/33ms1080 KiB
16Accepted3/323ms4148 KiB
17Accepted3/323ms4264 KiB
18Accepted3/325ms4148 KiB
19Wrong answer0/34ms1844 KiB
20Wrong answer0/36ms2284 KiB
21Wrong answer0/330ms4232 KiB
22Accepted3/328ms4252 KiB