Submission #657577

#TimeUsernameProblemLanguageResultExecution timeMemory
657577TimDeeInside information (BOI21_servers)C++17
5 / 100
3617 ms513420 KiB
#include <bits/stdc++.h> using namespace std; #define forn(i,n) for (int i=0; i<n; ++i) bitset<120000> a[120002]; void solve() { int n,q; cin>>n>>q; forn(i,n) a[i].set(i); forn(Q,n-1+q) { char c; cin>>c; if (c=='S') { int u,v; cin>>u>>v; --u,--v; forn(i,n) { if (a[i][u]) a[i].set(v); else if (a[i][v]) a[i].set(u); } } else if (c=='Q') { int u,x; cin>>u>>x; --u, --x; cout << (a[x][u]?"yes\n":"no\n"); } else { int x; cin>>x; --x; cout<<a[x].count()<<'\n'; } } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 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...
#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...