201172026-01-02 09:25:24BikficcÁruszállítás üres szakaszaicpp17Wrong answer 24/5081ms4340 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+1]--;
    }
    int sum=0, db=0;
    bool elozo=true;
    for (int i=1; i<n; i++)
    {
        sum+=v[i];
        if (sum==0)
        {
            if (elozo)
            {
               db++;
               elozo=false;
            }
        }
        else
        {
            elozo=true;
        }
    }
    cout << db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base24/50
1Wrong answer0/01ms316 KiB
2Accepted0/081ms4148 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/21ms316 KiB
8Wrong answer0/22ms316 KiB
9Accepted2/21ms500 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms564 KiB
12Wrong answer0/22ms564 KiB
13Wrong answer0/34ms564 KiB
14Wrong answer0/38ms1076 KiB
15Wrong answer0/34ms1136 KiB
16Accepted3/361ms4148 KiB
17Accepted3/361ms4324 KiB
18Accepted3/371ms4328 KiB
19Wrong answer0/38ms2040 KiB
20Wrong answer0/39ms2356 KiB
21Wrong answer0/375ms4340 KiB
22Accepted3/378ms4320 KiB