# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445676 | keta_tsimakuridze | Carnival (CEOI14_carnival) | C++14 | 22 ms | 312 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>
#define f first
#define s second
using namespace std;
const int N=155,mod=1e9+7;
int t,n,col[N],ans[N];
main(){
cin>>n;
int cur = 0;
for(int i=n;i>=1;i--) {
for(int j=i; j<=n; j++) {
ans[j]++;
}
int l = i + 1, r = n,x = n + 1;
while(l<=r) {
int mid = (l+r)/2;
cout<<mid-i+1<<" ";
for(int j = i; j<=mid; j++) {
cout<<j<<" ";
}
cout<<endl;
int c = 0;
cin >> c;
if(c == ans[mid]) {
l = mid + 1;
}
else x = mid, r = mid - 1;
}
if(x <= n) {
col[i] = col[x];
for(int j=x;j<=n;j++) ans[j]--;
}
else col[i] = ++cur;
}
cout<<0<<" ";
for(int i=1;i<=n;i++) cout<<col[i]<<" ";
cout<<endl;
}
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... |