# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168814 | songc | 사육제 (CEOI14_carnival) | C++14 | 24 ms | 380 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 pair<int,int> pii;
typedef long long LL;
int N, num=1;
int P[220], A[220];
int main(){
scanf("%d", &N);
for (int i=1; i<N; i++){
int L=i+1, H=N;
while (L<=H){
int mid = (L+H)/2, ret1, ret2;
printf("%d", mid-i+1);
for (int j=i; j<=mid; j++) printf(" %d", j);
cout<<endl;
scanf("%d", &ret1);
printf("%d", mid-i);
for (int j=i+1; j<=mid; j++) printf(" %d", j);
cout<<endl;
scanf("%d", &ret2);
if (ret1 == ret2) P[i] = mid, H = mid-1;
else L = mid+1;
}
}
printf("0");
for (int i=1; i<=N; i++){
if (A[i] == 0) A[i] = num;
A[P[i]] = A[i];
printf(" %d", A[i]);
}
printf("\n");
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... |