139782025-01-09 13:44:29madvirÁruszállítás üres szakaszaicpp17Wrong answer 14/5087ms4308 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];
    }
    int x=1, card=0;
    while(x<=n) {
        while(a[x]!=0 && x<=n) x++;
        if(x==n+1) break;
        else {
            card++;
            while(a[x]==0 && x<=n) x++;
        }
    }
    cout << card;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/087ms4148 KiB
3Accepted2/21ms500 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms552 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms400 KiB
11Accepted2/21ms564 KiB
12Accepted2/22ms612 KiB
13Wrong answer0/34ms772 KiB
14Wrong answer0/37ms1112 KiB
15Wrong answer0/34ms1076 KiB
16Wrong answer0/361ms4308 KiB
17Wrong answer0/363ms4308 KiB
18Wrong answer0/370ms4304 KiB
19Wrong answer0/38ms1844 KiB
20Wrong answer0/310ms2356 KiB
21Wrong answer0/374ms4308 KiB
22Wrong answer0/375ms4308 KiB