139832025-01-09 13:52:03madvirA lehető legkevesebb átszállás (50 pont)cpp17Wrong answer 1/502ms564 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
base1/50
1Wrong answer0/01ms316 KiB
2Runtime error0/02ms316 KiB
3Wrong answer0/11ms316 KiB
4Runtime error0/11ms316 KiB
5Partially correct1/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Runtime error0/21ms316 KiB
8Runtime error0/21ms564 KiB
9Runtime error0/21ms508 KiB
10Runtime error0/21ms512 KiB
11Runtime error0/21ms316 KiB
12Runtime error0/22ms316 KiB
13Runtime error0/21ms316 KiB
14Runtime error0/21ms316 KiB
15Runtime error0/21ms316 KiB
16Runtime error0/21ms316 KiB
17Runtime error0/21ms316 KiB
18Runtime error0/21ms316 KiB
19Runtime error0/21ms316 KiB
20Runtime error0/21ms316 KiB
21Runtime error0/22ms316 KiB
22Runtime error0/22ms564 KiB
23Runtime error0/21ms316 KiB
24Runtime error0/21ms316 KiB
25Runtime error0/21ms316 KiB
26Runtime error0/21ms448 KiB
27Runtime error0/21ms316 KiB
28Runtime error0/21ms564 KiB