209792026-01-11 22:56:29hunzombiÁruszállítás üres szakaszaicpp17Wrong answer 14/5034ms4420 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 + 1, 0);
    for (int i=0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        vec[u]++; vec[v]--;
    }
    int prev = -1;
    int ans = 0;
    for (int i=1; i <= n; i++) {
        vec[i] += vec[i - 1];
        if (vec[i] == 0 && prev != 0) ans++;
        prev = vec[i];
    }
    cout << ans << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/034ms4148 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms388 KiB
8Accepted2/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Accepted2/21ms564 KiB
12Accepted2/21ms564 KiB
13Wrong answer0/33ms564 KiB
14Wrong answer0/34ms1076 KiB
15Wrong answer0/33ms1076 KiB
16Wrong answer0/324ms4148 KiB
17Wrong answer0/325ms4148 KiB
18Wrong answer0/327ms4292 KiB
19Wrong answer0/34ms1844 KiB
20Wrong answer0/37ms2356 KiB
21Wrong answer0/330ms4420 KiB
22Wrong answer0/328ms4304 KiB