18012022-12-03 19:21:31kdbÁruszállítás üres szakaszaicpp11Wrong answer 34/5029ms11492 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

ostream& operator<<(ostream& os, vector<int>& input)
{
    for (auto i : input)
    {
        os << i << " ";
    }
    os << endl;
    return os;
}

int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    vector<int>vec(n+1);
    for (size_t i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        vec[a]++;
        vec[b]--;
    }
    int c = 0, s = 0, p = 0;
    for (size_t i = 1; i < n + 1; i++)
    {
        s += vec[i];
        if (s == 0 && vec[i] < 0)c++;
    }
    cout << c << endl;
    return 0;
}
/*
10 4
8 9
1 6
1 3
3 4
-2
*/
SubtaskSumTestVerdictTimeMemory
base34/50
1Accepted0/03ms1696 KiB
2Accepted0/029ms9716 KiB
3Wrong answer0/22ms1948 KiB
4Wrong answer0/22ms2140 KiB
5Wrong answer0/22ms2348 KiB
6Wrong answer0/22ms2548 KiB
7Wrong answer0/22ms2744 KiB
8Wrong answer0/22ms2828 KiB
9Accepted2/22ms2832 KiB
10Accepted2/22ms2832 KiB
11Wrong answer0/22ms3124 KiB
12Wrong answer0/22ms3764 KiB
13Accepted3/34ms3720 KiB
14Accepted3/34ms4240 KiB
15Accepted3/34ms4244 KiB
16Accepted3/323ms10612 KiB
17Accepted3/323ms10868 KiB
18Accepted3/326ms11224 KiB
19Accepted3/36ms6584 KiB
20Accepted3/36ms7444 KiB
21Accepted3/327ms11236 KiB
22Accepted3/328ms11492 KiB