# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112827 | Firastic | Carnival (CEOI14_carnival) | C++14 | 37 ms | 512 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;
int n,visited[200][200];
int done[200],p[200],ans[200];
int cari(int x){
if(p[x] == x)return x;
p[x] = cari(p[x]);
return p[x];
}
void gabung(int x, int y){
if(cari(x) != cari(y)){
p[cari(y)] = cari(x);
}
}
void ask(){
int x,y;
int ans;
do{
x = rand()%n;
do{
y = rand()%n;
} while(y==x);
if(x>y)swap(x,y);
} while(visited[x][y]);
printf("2 %d %d\n", x+1, y+1);
fflush(stdout);
visited[x][y] = true;
scanf("%d", &ans);
ans--;
ans = !ans;
if(ans){
gabung(x,y);
}
}
int main(){
scanf("%d", &n);
for(int i = 0; i < n; i++){
p[i] = i;
}
for(int i = 0; i < min(n*(n-1)/2,3500); i++){
ask();
}
int cur = 0;
for(int i = 0; i < n; i++){
if(!done[i]){
done[i] = true;
cur++;
for(int j = i; j < n; j++){
if(cari(i) == cari(j)){
done[j] = true;
ans[j] = cur;
}
}
}
}
printf("0 ");
for(int i = 0; i < n; i++){
printf("%d", ans[i]);
if(i==n-1)printf("\n");
else printf(" ");
}
fflush(stdout);
}
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... |