| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 374211 | MilosMilutinovic | Carnival (CEOI14_carnival) | C++14 | 1 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;
const int N=200;
int ans[N];
int main(){
int n;scanf("%i",&n);
int cnt=0;
for(int i=1;i<=n;i++){
if(ans[i]>0)continue;
ans[i]=++cnt;
for(int j=i+1;j<=n;j++){
if(ans[j]>0)continue;
fflush(stdout);
printf("2 %i %i\n",i,j);
int x;scanf("%i",&x);
if(x==1)ans[j]=ans[i];
}
}
printf("0 ");
for(int i=1;i<=n;i++)printf("%i ",ans[i]);
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... | ||||
