139812025-01-09 13:49:48madvirÁruszállítás üres szakaszaicpp17Accepted 50/5085ms4308 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, m, kezd=0, veg=0;
    cin >> n >> m;
    int a[n+1]={0};
    for(int i=0; i<m; i++) {
        cin >> kezd >> veg;
        a[kezd]++;
        a[veg]--;
    }
    for(int i=2; i<=n; i++) {
        a[i]=a[i]+a[i-1];
    }
    /*for(int i=1; i<=n; i++) {
        cout <<a[i] << " ";
    }*/
    int x=1, card=0;
    while(x<=n) {
        while(a[x]!=0 && x<=n) x++;
        if(x==n+1) break;
        else {
            if(x!=n) card++;
            while(a[x]==0 && x<=n) x++;
        }
    }
    cout << card;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/085ms4308 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/21ms564 KiB
12Accepted2/22ms564 KiB
13Accepted3/34ms564 KiB
14Accepted3/38ms1104 KiB
15Accepted3/34ms1076 KiB
16Accepted3/361ms4304 KiB
17Accepted3/364ms4308 KiB
18Accepted3/371ms4096 KiB
19Accepted3/38ms1844 KiB
20Accepted3/39ms2356 KiB
21Accepted3/376ms4220 KiB
22Accepted3/378ms4308 KiB