Submission #637687

#TimeUsernameProblemLanguageResultExecution timeMemory
637687VitaliyFSExam (eJOI20_exam)C++17
0 / 100
3 ms748 KiB
#include<bits/stdc++.h> using namespace std; #define fr first #define sc second typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; typedef long double ld; const ll INF = 1000000000000000007, DIM = 200007, DIM2 = 27, MAXN = 100007, MOD = 1000000007; ll tt, mid, res,f, y, type, ptr, root, cnt, sum, pos, h, p, sx,sy, id, testcase, curans, nn, split, n, m, x, k1, k2, changecnt,k,l,r,v,u, l1,r1,l2,r2; bool flag, flag2; char c; pll a[DIM]; map<ll,ll> used; void solve() { cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].fr; used[a[i].fr]++; } res=n; for(int i=1;i<=n;i++){ cin>>a[i].sc; if(!used[a[i].sc])res--; } cout<<res<<'\n'; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); tt=1; // freopen("input.txt","r",stdin); // freopen("output.txt","w",stdout); //cin>>tt; while(tt--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...