201322026-01-02 14:44:24BikficcÁruszállítás üres szakaszaicpp17Accepted 50/5082ms4328 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n, m, x, y;
    cin >> n >> m;
    vector <int> v(n+2,0);

    for (int i=1; i<=m; i++)
    {
        cin >> x >> y;
        v[x]++;
        v[y]--;
    }
    int sum=0, db=0;
    if (v[1]==0)
    {
        db++;
    }
    else
    {
        sum=v[1];
    }
    for (int i=2; i<n; i++)
    {
        sum+=v[i];
        if (sum==0 && v[i]!=0)
        {
         db++;
        }
    }
    cout << db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/082ms4152 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms508 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/22ms568 KiB
12Accepted2/22ms748 KiB
13Accepted3/34ms564 KiB
14Accepted3/38ms1080 KiB
15Accepted3/36ms1144 KiB
16Accepted3/361ms4324 KiB
17Accepted3/363ms4148 KiB
18Accepted3/371ms4148 KiB
19Accepted3/38ms1844 KiB
20Accepted3/39ms2356 KiB
21Accepted3/375ms4148 KiB
22Accepted3/372ms4328 KiB