247272026-02-14 19:44:39999Áruszállítás üres szakaszaicpp17Accepted 50/5082ms4340 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n,m;cin>>n>>m;
    vector<int> allom(n+2);
    for(int i = 0;i<m;i++){
        int a,b;cin>>a>>b;
        allom[a]++;
        if(b<n)allom[b]--;
    }
    int state=0;
    int cnt=0;
    for(int i = 1;i<=n;i++){
        allom[i]+=allom[i-1];
        if(allom[i]==0&&state==0)state=1;
        else if(allom[i]!=0)state=0;
        if(state==1){
            cnt++;
            state=2;
        }
    }cout<<cnt<<endl;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/082ms4148 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Accepted2/21ms316 KiB
10Accepted2/21ms316 KiB
11Accepted2/22ms564 KiB
12Accepted2/23ms564 KiB
13Accepted3/36ms772 KiB
14Accepted3/37ms1076 KiB
15Accepted3/34ms1268 KiB
16Accepted3/361ms4324 KiB
17Accepted3/361ms4324 KiB
18Accepted3/370ms4148 KiB
19Accepted3/38ms1980 KiB
20Accepted3/39ms2356 KiB
21Accepted3/371ms4336 KiB
22Accepted3/375ms4340 KiB