129922025-01-04 16:22:09KissCsongor777Áruszállítás üres szakaszaicpp17Runtime error 14/5090ms1084 KiB
#include <iostream>
#include <algorithm>

using namespace std;

struct szallitas
{
    int k,v;
};

int f(szallitas x, szallitas y)
{
    if(x.k<y.k)return 1;
    else if(x.k==y.k)
           if(x.v>y.v)return 1;
           else return 0;
    else return 0;
}

szallitas S[100001];

int main()
{
    int n,m,k=0,a;
    cin>>n>>m;
    for(int i=1; i<=m; i++)cin>>S[i].k>>S[i].v;
    sort(S+1, S+m+1, f);
    if(S[1].k!=1)k++;
    a=S[1].v;
    for(int i=2; i<=m; i++)
    {
        if(S[i].k>a)k++;
        if(S[i].v>a)a=S[i].v;
    }
    if(S[n].v!=n)k++;
    cout<<k;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms320 KiB
2Runtime error0/090ms1024 KiB
3Accepted2/21ms320 KiB
4Wrong answer0/21ms508 KiB
5Accepted2/21ms320 KiB
6Accepted2/21ms320 KiB
7Accepted2/21ms320 KiB
8Accepted2/21ms320 KiB
9Wrong answer0/21ms320 KiB
10Wrong answer0/21ms320 KiB
11Accepted2/21ms508 KiB
12Accepted2/21ms320 KiB
13Wrong answer0/34ms460 KiB
14Runtime error0/37ms448 KiB
15Runtime error0/34ms500 KiB
16Runtime error0/370ms988 KiB
17Runtime error0/371ms1084 KiB
18Runtime error0/382ms1044 KiB
19Runtime error0/38ms320 KiB
20Runtime error0/38ms440 KiB
21Runtime error0/382ms1080 KiB
22Runtime error0/383ms1080 KiB