이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
set<int>sp[8001];
int n,k,sum[8001];
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)sum[i]=1,sp[i].insert(i);
k=k+n-1;
while(k--){
char s;cin>>s;
if(s=='S'){
int x,y;cin>>x>>y;
for(auto j:sp[x])
{
sp[y].insert(j);
}
for(auto j:sp[y])
{
sp[x].insert(j);
}
for(auto j:sp[y])
{
sum[j]++;
}
}else if(s=='Q'){
int a,d;cin>>a>>d;
if(sp[a].find(d)!=sp[a].end()){
cout<<"yes"<<endl;
}else cout<<"no"<<endl;
}else{
int x;cin>>x;
cout<<sum[x]<<endl;
}
}
return 0;
}
| # | 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... |