Submission #863570

#TimeUsernameProblemLanguageResultExecution timeMemory
863570HossamHero7Inside information (BOI21_servers)C++14
2.50 / 100
81 ms524288 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define endl '\n' bitset<120001> vis[120001]; void solve(){ int n,q; cin>>n>>q; for(int i=0;i<n;i++) vis[i][i] = 1; vector<int> cnt(n+1,1); for(int qq=0;qq<n+q-1;qq++){ char c; int a,b; cin>>c>>a; a --; if(c != 'C') cin>>b, b--; if(c == 'S'){ vis[a] |= vis[b]; vis[b] = vis[a]; } else cout<<(vis[a][b] ? "yes" : "no")<<endl; } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; //cin>>t; while(t--){ 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...