This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n,k; cin>>n>>k;
vector<set<int>>v(n);
for(int i = 0 ; i < n ; i++)
v[i].insert(i);
for(int i = 0 ; i < n+k-1 ; i++) {
char c; cin>>c;
if(c == 'S') {
int a,b; cin>>a>>b;
a--,b--;
if(v[a].size() < v[b].size()) swap(v[a],v[b]);
for(auto it = v[b].begin() ; it != v[b].end() ; it++) {
v[a].insert(*it);
}
v[b] = v[a];
} else if(c == 'Q') {
int a,d; cin>>a>>d;
a--,d--;
if(v[a].count(d)) {
cout << "yes\n";
} else cout << "no\n";
} else {
int d; cin>>d;
d--;
int cnt=0;
for(auto z : v)
if(z.count(d)) cnt++;
cout << cnt << "\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |