# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36398 | mohammad_kilani | Carnival (CEOI14_carnival) | C++14 | 63 ms | 3188 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;
#define mod 1000000007
#define oo 2000000000
const int N = 300010;
int num[N];
int main() {
//freopen("in.txt","r",stdin);
int n , cnt = 1;
scanf("%d",&n);
for(int i=1;i<=n;i++){
if(num[i]) continue;
num[i] = cnt;
for(int j=i+1;j<=n;j++){
if(num[j]) continue;
printf("2 %d %d\n",i,j);
fflush(stdout);
int a;
scanf("%d",&a);
if(a == 1) num[j] = cnt;
}
cnt++;
}
putchar('0');
for(int i=1;i<=n;i++) printf(" %d",num[i]);
puts("");
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... |