Submission #143013

#TimeUsernameProblemLanguageResultExecution timeMemory
143013MladenPWorst Reporter 2 (JOI16_worst_reporter2)C++17
0 / 100
2 ms504 KiB
#include<bits/stdc++.h> #define STIZE(x) fprintf(stderr, "STIZE%d\n", x); #define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x); #define NL(x) printf("%c", " \n"[(x)]); #define lld long long #define pii pair<int,int> #define pb push_back #define fi first #define se second #define mid (l+r)/2 #define endl '\n' #define all(a) begin(a),end(a) #define sz(a) int((a).size()) #define LINF 1000000000000000LL #define INF 1000000000 #define EPS 1e-9 using namespace std; #define MAXN 200010 int N, A[MAXN], B[MAXN], C[MAXN], D[MAXN], rez, cnt[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0); cin >> N; for(int i = 1; i <= N; i++) { cin >> A[i] >> B[i]; } for(int i = 1; i <= N; i++) { cin >> C[i] >> D[i]; } int idx = 1; for(int i = 1; i <= N; i++) { while(idx <= N && D[idx] >= B[i]) { cnt[C[idx]]++; idx++; } if(cnt[A[i]] == 0) rez++; else cnt[A[i]]--; } cout << rez; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...