139992025-01-09 16:18:19batorfibalazsÁruszállítás üres szakaszaicpp17Wrong answer 14/5087ms4328 KiB
#include <iostream>
#include <vector>


using namespace std;



int main(){
    int n, m;
    cin >> n >> m;
    vector<int> diff(n+1,0);
    for (int i=0;i<m;i++){
        int temp[2];
        cin >> temp[0] >> temp[1];
        diff[temp[0]]++;
        diff[temp[1]]--;
    }
    int curr=0 ,ures=0;
    for (int i=1;i<n+1;i++){
        curr+=diff[i];
        if (curr==0) ures++;
        while (i<n && diff[i+1]==0) i++;
    }
    cout << ures;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/087ms4148 KiB
3Accepted2/21ms508 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms508 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Accepted2/21ms564 KiB
12Accepted2/22ms624 KiB
13Wrong answer0/36ms564 KiB
14Wrong answer0/38ms1076 KiB
15Wrong answer0/34ms1076 KiB
16Wrong answer0/364ms4320 KiB
17Wrong answer0/364ms4148 KiB
18Wrong answer0/372ms4220 KiB
19Wrong answer0/38ms2036 KiB
20Wrong answer0/39ms2356 KiB
21Wrong answer0/378ms4328 KiB
22Wrong answer0/379ms4320 KiB