178362025-09-19 10:50:40DávidZsonglőrködéscpp17Wrong answer 20/100347ms11316 KiB
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, cnt = 0;
    cin >> n;
    vector<pair<int, int>> v(n);
    map<int, int> napok;
    for(int i = 0; i < n; i++) cin >> v[i].second >> v[i].first;
    sort(v.begin(), v.end());
    cnt = n;
    for(int i = 0; i < n; i++) {
        if(napok.count(v[i].second)) {
            napok[v[i].second]--;
            cnt--;
        }
        napok[v[i].first]++;
    }
    cout << cnt << endl;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms508 KiB
2Accepted1ms316 KiB
subtask220/20
3Accepted4ms420 KiB
4Accepted93ms3700 KiB
5Accepted252ms8488 KiB
6Accepted314ms10272 KiB
7Accepted345ms11316 KiB
8Accepted345ms11316 KiB
9Accepted342ms11316 KiB
10Accepted347ms11316 KiB
11Accepted342ms11316 KiB
subtask30/35
12Accepted1ms500 KiB
13Wrong answer1ms316 KiB
14Wrong answer1ms316 KiB
15Wrong answer1ms316 KiB
16Wrong answer2ms316 KiB
17Wrong answer2ms316 KiB
18Wrong answer1ms316 KiB
19Wrong answer2ms316 KiB
20Wrong answer2ms316 KiB
subtask40/45
21Accepted3ms316 KiB
22Wrong answer63ms1012 KiB
23Accepted248ms8384 KiB
24Wrong answer187ms1824 KiB
25Accepted342ms11188 KiB
26Wrong answer207ms1844 KiB
27Accepted344ms11192 KiB
28Wrong answer206ms1844 KiB
29Accepted342ms11316 KiB