Submission #696296

#TimeUsernameProblemLanguageResultExecution timeMemory
696296Dan4LifeInside information (BOI21_servers)C++17
2.50 / 100
3578 ms524288 KiB
#include <bits/stdc++.h> using namespace std; const int mxN = (int)120010; int n, k, pos[mxN]; set<int> S[mxN]; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> k; int sz = 1; for(int i = 1; i <= n; i++) S[i].insert(i); for(int _ = 0; _ < n+k-1; _++){ char t; int x, y; cin >> t >> x; if(t=='S'){ cin >> y; if(x>y)swap(x,y); pos[y]=sz++; for(auto u :S[x]) S[y].insert(u); S[x]=S[y]; } else if(t=='Q'){ cin >> y; if(1) cout << (S[x].count(y)?"yes":"no"); else if(x==1) cout << (pos[y]?"yes":"no"); else if(y==1) cout << (pos[x]?"yes":"no"); else cout << (pos[x]>=pos[y] and pos[x] and pos[y]?"yes":"no"); } else{ int cnt = 0; for(int i = 1; i <= n; i++) cnt+=S[i].count(x); if(1) cout << cnt; else if(!pos[x] and x!=1) cout << 1; else cout << sz-pos[x]+1; } if(t!='S') cout << "\n"; } }
#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...
#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...