131462025-01-06 18:31:36lacitoÁruszállítás üres szakaszaicpp17Wrong answer 34/5089ms8236 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 = true;
    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
base34/50
1Accepted0/01ms316 KiB
2Accepted0/089ms7992 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms508 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms352 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Wrong answer0/21ms820 KiB
12Wrong answer0/22ms1076 KiB
13Accepted3/36ms1136 KiB
14Accepted3/38ms1844 KiB
15Accepted3/36ms1844 KiB
16Accepted3/367ms7988 KiB
17Accepted3/371ms8172 KiB
18Accepted3/379ms8236 KiB
19Accepted3/39ms3384 KiB
20Accepted3/312ms4332 KiB
21Accepted3/379ms7988 KiB
22Accepted3/383ms7988 KiB