Submission #557529

#TimeUsernameProblemLanguageResultExecution timeMemory
557529MounirInside information (BOI21_servers)C++14
2.50 / 100
3561 ms524288 KiB
#include <bits/stdc++.h> #define all(v) v.begin(), v.end() #define sz(x) (int)x.size() #define pb push_back #define pii pair<int, int> #define chmin(x, v) x = min(x, v) #define chmax(x, v) x = max(x, v) #define print(x) cout << #x << " est " << x << endl; #define x first #define y second #define int long long using namespace std; const int N = 2e5; set<int> datas[N]; signed main(){ int nServs, nReqs; cin >> nServs >> nReqs; for (int i = 1; i <= nServs; ++i) datas[i] = {i}; nReqs += nServs - 1; while (nReqs--){ char typeReq; cin >> typeReq; if (typeReq == 'S'){ int a, b; cin >> a >> b; for (int e : datas[b]) datas[a].insert(e); datas[b] = datas[a]; } else if (typeReq == 'Q'){ int a, d; cin >> a >> d; if (datas[a].count(d)) cout << "yes" << endl; else cout << "no" << endl; } else { int d; cin >> d; int nb = 0; for (int a = 1; a <= nServs; ++a) nb += datas[a].count(d); cout << nb << endl; } } 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...