74912024-01-09 10:34:58szabelrÁruszállítás üres szakaszaicpp17Wrong answer 15/50400ms19944 KiB
#include <iostream>

using namespace std;
long long aru[1000001]{0};
long long kezd[100001]{0};
long long veg[100001]{0};

int main()
{
    long long n,m,db=0;
    cin>>n>>m;
    int x,y;
    for(int i=1; i<=m; i++){
        cin>>x>>y;
        for(int z=x; z<=y; z++){
            aru[z]=1;
        }
    }
    for(int i=1; i<=n; i++){
        if(aru[i]==0 and aru[i+1]!=0){
            db++;
        }
        if(aru[i]==0 and i==n)
            db++;

    }
    cout<<db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/50
1Accepted0/03ms1884 KiB
2Accepted0/090ms17732 KiB
3Accepted2/23ms2288 KiB
4Accepted2/23ms2504 KiB
5Wrong answer0/23ms2584 KiB
6Wrong answer0/23ms2720 KiB
7Accepted2/23ms2796 KiB
8Wrong answer0/23ms3028 KiB
9Accepted2/23ms3236 KiB
10Accepted2/23ms3224 KiB
11Accepted2/23ms3788 KiB
12Wrong answer0/24ms4916 KiB
13Wrong answer0/37ms5304 KiB
14Wrong answer0/39ms6664 KiB
15Wrong answer0/38ms6780 KiB
16Time limit exceeded0/3400ms3872 KiB
17Time limit exceeded0/3370ms4484 KiB
18Time limit exceeded0/3352ms4056 KiB
19Wrong answer0/310ms10364 KiB
20Wrong answer0/313ms12140 KiB
21Wrong answer0/382ms19940 KiB
22Accepted3/390ms19944 KiB