126992024-12-28 17:14:30ruffbrigiÁruszállítás üres szakaszaicpp17Wrong answer 25/50400ms8228 KiB
#include <iostream>

using namespace std;

int main()
{
    long long n,m,db=0,x,y;
    cin>>n>>m;
    long long szabad[n+1];
    for(long long i=1;i<=n;i++)
    {
        szabad[i]=1;
    }
    for(long long j=1;j<=m;j++)
    {
        cin>>x>>y;
        for(long long k=x;k<=y-1;k++)
        {
            szabad[k]=0;
        }
    }

    for(long long i=2;i<=n;i++)
    {
        if(szabad[i]==1)
        {
            if(szabad[i-1]==0)
                db++;
        }
    }
    cout<<db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base25/50
1Accepted0/01ms500 KiB
2Accepted0/097ms8228 KiB
3Wrong answer0/21ms320 KiB
4Wrong answer0/21ms320 KiB
5Wrong answer0/21ms320 KiB
6Wrong answer0/21ms320 KiB
7Wrong answer0/21ms320 KiB
8Wrong answer0/21ms320 KiB
9Accepted2/21ms320 KiB
10Accepted2/21ms320 KiB
11Wrong answer0/21ms824 KiB
12Wrong answer0/22ms1080 KiB
13Accepted3/36ms1080 KiB
14Accepted3/38ms1592 KiB
15Accepted3/36ms1596 KiB
16Time limit exceeded0/3400ms8196 KiB
17Time limit exceeded0/3400ms8048 KiB
18Time limit exceeded0/3400ms7988 KiB
19Accepted3/39ms3384 KiB
20Accepted3/313ms4152 KiB
21Accepted3/390ms7992 KiB
22Accepted3/385ms7992 KiB