# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43394 | Hassoony | Carnival (CEOI14_carnival) | C++14 | 19 ms | 4368 KiB |
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;
typedef long long ll;
const int MX=3e5+9;
int n,p[MX],vis[MX];
int find(int x){
if(x==p[x])return x;
return p[x]=find(p[x]);
}
map<int,int>hashy;
void merge_(int x,int y){
x=find(x);
y=find(y);
p[y]=x;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)p[i]=i;
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(vis[i]||vis[j])continue;
cout<<2<<" "<<i<<" "<<j<<endl;
int x; scanf("%d",&x);
if(x==1)merge_(i,j),vis[j]=1;
}
}
for(int i=1;i<=n;i++){
hashy[p[i]]=1;
}
int tt=1;
for(auto pp:hashy){
hashy[pp.first]=tt++;
}
cout<<0<<" ";
for(int i=1;i<n;i++)cout<<hashy[p[i]]<<" ";
cout<<hashy[p[n]]<<endl;
}
Compilation message (stderr)
# | 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... |