127482024-12-29 17:45:40KissCsongor777Áruszállítás üres szakaszaicpp17Wrong answer 39/50400ms4224 KiB
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
    int n,m,x,y,db=0;
    cin>>n>>m;
    vector<int>v(n-1,1);
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        fill(v.begin()+x,v.begin()+y,0);
    }
    if(v[0]==1)db++;
    for(int i=0; i<n-1; i++)
        if(v[i+1]==1 && v[i]==0)db++;
    cout<<db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base39/50
1Accepted0/01ms508 KiB
2Accepted0/082ms4152 KiB
3Accepted2/21ms320 KiB
4Wrong answer0/21ms320 KiB
5Accepted2/21ms320 KiB
6Accepted2/21ms320 KiB
7Accepted2/21ms320 KiB
8Accepted2/21ms320 KiB
9Accepted2/21ms320 KiB
10Accepted2/21ms320 KiB
11Accepted2/21ms568 KiB
12Accepted2/22ms568 KiB
13Accepted3/34ms772 KiB
14Accepted3/38ms1080 KiB
15Accepted3/34ms1080 KiB
16Time limit exceeded0/3400ms4148 KiB
17Time limit exceeded0/3400ms4224 KiB
18Time limit exceeded0/3400ms4152 KiB
19Accepted3/38ms1988 KiB
20Accepted3/39ms2372 KiB
21Accepted3/371ms4152 KiB
22Accepted3/374ms4152 KiB