127332024-12-29 15:15:43ruffbrigiÁruszállítás üres szakaszaicpp17Wrong answer 14/5090ms4316 KiB
#include <iostream>

using namespace std;

int main()
{
    int n,m,x,y,atsz=0;
    cin>>n>>m;
    int allomasok[n+1];
    for(int i=1;i<=n;i++){
        allomasok[i]=0;
    }
     for(int i=1;i<=m;i++){
        cin>>x>>y;
        allomasok[x]++;
        allomasok[y]--;
    }
    for(int i=2;i<=n;i++){
        allomasok[i]+=allomasok[i-1];
    }
    //for(int i=1;i<=n;i++){
    //    cout<<allomasok[i]<<" ";
    //}
    //cout<<endl;
    bool uresjarat=false;
    for(int i=1;i<=n;i++){
        if(!uresjarat &&allomasok[i]==0){
            atsz++;
            uresjarat=true;
        }
        if(uresjarat && allomasok[i]!=0){
            uresjarat=false;
        }
    }
    cout<<atsz;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms320 KiB
2Wrong answer0/090ms4312 KiB
3Accepted2/21ms320 KiB
4Wrong answer0/21ms320 KiB
5Accepted2/21ms320 KiB
6Accepted2/21ms388 KiB
7Accepted2/21ms500 KiB
8Accepted2/21ms320 KiB
9Wrong answer0/21ms552 KiB
10Wrong answer0/21ms320 KiB
11Accepted2/21ms568 KiB
12Accepted2/22ms572 KiB
13Wrong answer0/34ms568 KiB
14Wrong answer0/38ms1080 KiB
15Wrong answer0/34ms1080 KiB
16Wrong answer0/364ms4308 KiB
17Wrong answer0/364ms4304 KiB
18Wrong answer0/375ms4312 KiB
19Wrong answer0/38ms2072 KiB
20Wrong answer0/39ms2360 KiB
21Wrong answer0/376ms4316 KiB
22Wrong answer0/379ms4312 KiB