131442025-01-06 18:27:53szellandÁruszállítás üres szakaszaicpp17Wrong answer 14/5089ms8232 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, a;
    cin >> n >> a;
    vector<int> sor (n);
    vector<int> valt (n);
    for (int i = 0; i < a; i++) {
        int fel, le;
        cin >> fel >> le;
        valt[fel - 1] += 1;
        valt[le - 1] -= 1;
    }
    int jl = 0;
    for (int i = 0; i < n; i++) {
        jl += valt[i];
        sor[i] = jl;
        //cout << sor[i] << " ";
    }
    int ures = 0;
    bool nincs = false;
    for (int i = 0; i < n; i++) {
        if (sor[i] == 0 && nincs == false) {
            ures += 1;
            nincs = true;
        } else if (sor[i] != 0 && nincs == true) {
        nincs = false;
        }
    }
    cout << ures;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/089ms8040 KiB
3Accepted2/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Wrong answer0/21ms364 KiB
10Wrong answer0/21ms316 KiB
11Accepted2/22ms844 KiB
12Accepted2/22ms1076 KiB
13Wrong answer0/36ms1076 KiB
14Wrong answer0/38ms1844 KiB
15Wrong answer0/36ms2040 KiB
16Wrong answer0/368ms7988 KiB
17Wrong answer0/368ms8232 KiB
18Wrong answer0/378ms8020 KiB
19Wrong answer0/39ms3540 KiB
20Wrong answer0/313ms4324 KiB
21Wrong answer0/382ms7988 KiB
22Wrong answer0/379ms7988 KiB