140932025-01-09 18:33:36zhuyiÁruszállítás üres szakaszaicpp17Wrong answer 14/5092ms4356 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main()
{
    int n, m; cin >> n >> m;
    vector<int> A(n+1,0);
    for(int i = 0; i < m; i++)
    {
        int start, finish; cin >> start >> finish;
        A[start]++;
        A[finish]--;
    }
    for(int i = 2; i <= n; i++){
        A[i] += A[i-1];
    }
    bool start = false;
    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        if(!start && A[i] == 0) start = true;
        else if(start && A[i] != 0){
            ans++;
            start = false;
        }
    }
    if(start) ans++;
    cout << ans << "\n";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/092ms4148 KiB
3Accepted2/21ms500 KiB
4Wrong answer0/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Accepted2/21ms564 KiB
12Accepted2/22ms564 KiB
13Wrong answer0/34ms564 KiB
14Wrong answer0/37ms1076 KiB
15Wrong answer0/34ms948 KiB
16Wrong answer0/364ms4320 KiB
17Wrong answer0/364ms4160 KiB
18Wrong answer0/374ms4356 KiB
19Wrong answer0/38ms1844 KiB
20Wrong answer0/310ms2372 KiB
21Wrong answer0/375ms4192 KiB
22Wrong answer0/378ms4316 KiB