Submission #1240626

#TimeUsernameProblemLanguageResultExecution timeMemory
1240626KindaGoodGamesInside information (BOI21_servers)C++20
2 / 100
264 ms589824 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN = 120000; #define bs bitset<MAXN> bs obtained[MAXN]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n, q; cin >> n >> q; // vector<bs> available(n); for(int i = 0; i < n; i++){ obtained[i][i] = true; // available[i][i] = true; } for(int t = 0; t < n+q-1; t++){ char m; cin >> m; if(m == 'S'){ int a,b; cin >> a >> b; a--;b--; obtained[a] |= obtained[b]; obtained[b] |= obtained[a]; } if(m == 'Q'){ int a,d; cin >> a >>d; a--;d--; if(obtained[a][d]){ cout << "yes\n"; }else{ cout << "no\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...