This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//https://oj.uz/problem/view/CEOI14_carnival
#include<bits/stdc++.h>
const int N = 155;
using namespace std;
int n, pset[N], ans[N], a[N], cnt;
int ask(int l, int r, int x){
cout << r - l + 2 << " ";
for (int i = l; i <= r; i++) cout << a[i] << " ";
cout << x << endl;
int ans; cin >> ans;
return ans;
}
int main(){
cin >> n;
for (int i = 1; i <= n; i++){
if (ask(1, cnt, i) == cnt+1){
pset[i] = i;
ans[i] = cnt+1;
a[++cnt] = i;
}
else{
int l = 1, r = cnt;
while (l != r){
int mid = (l + r) >> 1;
if (ask(l, mid, i) == mid - l + 1) r = mid;
else l = mid+1;
}
pset[i] = a[l];
ans[i] = ans[a[l]];
}
}
cout << 0 << " ";
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
return 0;
}
# | 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... |