197622025-12-22 11:35:18GergoszaboÁruszállítás (75 pont)cpp17Wrong answer 0/7590ms11060 KiB
// Source: https://usaco.guide/general/io

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

int main() {
	ll n, m; cin >> n >> m;
    vector<ll> first(m+1, 0);
    vector<ll> second(m+1, 0);
    vector<ll> freq(n+1, 0);
    for (ll i = 1; i <= m; i++){
        cin >> first[i] >> second[i];
        freq[first[i]]++; freq[second[i]]--;
    }
    ll sum = 0, ans = 0;
    for (ll i = 1; i <= n; i++){
        sum += freq[i];
        if (sum == 0) ans++;
    }
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base0/75
1Wrong answer0/01ms316 KiB
2Wrong answer0/089ms11060 KiB
3Wrong answer0/31ms316 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Wrong answer0/31ms508 KiB
8Wrong answer0/41ms316 KiB
9Wrong answer0/41ms316 KiB
10Wrong answer0/41ms316 KiB
11Wrong answer0/41ms820 KiB
12Wrong answer0/42ms1076 KiB
13Wrong answer0/46ms1296 KiB
14Wrong answer0/48ms2064 KiB
15Wrong answer0/46ms1844 KiB
16Wrong answer0/48ms2980 KiB
17Wrong answer0/49ms3640 KiB
18Wrong answer0/412ms4408 KiB
19Wrong answer0/410ms3776 KiB
20Wrong answer0/412ms4404 KiB
21Wrong answer0/487ms10804 KiB
22Wrong answer0/490ms10860 KiB