Submission #1229515

#TimeUsernameProblemLanguageResultExecution timeMemory
1229515LaMatematica14Inside information (BOI21_servers)C++20
0 / 100
1 ms320 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int N, K; cin >> N >> K; vector<set<int>> num(N); for (int i = 0; i < N; i++) num[i].insert(i); for (int i = 0; i < K+N-1; i++) { char t; cin >> t; if (t == 'S') { int a, b; cin >> a >> b; a--; b--; if (num[a].size() > num[b].size()) swap(a, b); for (int x : num[a]) num[b].insert(x); num[a] = num[b]; } else if (t == 'Q') { int a, d; a--; d--; cin >> a >> d; cout << (num[a].count(d) ? "yes" : "no") << "\n"; } else { int d; cin >> d; cout << "1\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...