| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 166541 | wilwxk | Carnival (CEOI14_carnival) | C++14 | 124 ms | 376 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;
const int MAXN=155;
int rep[MAXN], repp[MAXN];
int mp[MAXN];
int n, cnt;
int find(int x) {
return rep[x]= rep[x]==x ? x : find(rep[x]);
}
void une(int a, int b) {
a=find(a); b=find(b);
if(a==b) return;
if(repp[a]>repp[b]) swap(a, b);
rep[a]=b;
}
int main() {
scanf("%d", &n);
for(int i=1; i<=n; i++) rep[i]=repp[i]=i;
for(int i=1; i<=n; i++) {
for(int j=1; j<i; j++) {
printf("2 %d %d\n", i, j);
fflush(stdout);
int x; scanf("%d", &x);
if(x==1) une(i, j);
}
}
printf("0 ");
for(int i=1; i<=n; i++) {
if(!mp[find(i)]) mp[find(i)]=++cnt;
printf("%d ", mp[find(i)]);
}
fflush(stdout);
return 0;
}
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... | ||||
