# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98037 | 2019-02-20T02:12:01 Z | dndhk | None (JOI16_worst_reporter2) | C++14 | 2 ms | 256 KB |
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; const int MAX_N = 200000; int N; deque<pii> dq1, dq2; int cnt1[MAX_N+1], cnt2[MAX_N+1]; int ans; int main(){ scanf("%d", &N); ans = N; for(int i=0; i<N; i++){ int a, b; scanf("%d%d", &a, &b); dq1.push_back({a, b}); cnt1[a]++; }for(int i=0; i<N; i++){ int a, b; scanf("%d%d", &a, &b); dq2.push_back({a, b}); } for(int i=0; i<N; i++){ if(!dq1.empty() && dq1.front().second > dq2[i].second){ if(cnt2[dq1.front().first]>0) cnt2[dq1.front().first]--; else cnt1[dq1.front().first]--; dq1.pop_front(); } if(cnt1[dq2[i].first]>0){ cnt1[dq2[i].first]--; cnt2[dq2[i].first]++; ans--; } } printf("%d", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |