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 = 151;
int n,lst,cur,ans[N];
int ask(int l,int r,int x)
{
assert(r-l+2<=n);
assert(r<=n);
assert(x<=n);
cout << r-l+2 << ' ';
for(int i = l;i <= r;i++) cout << i << ' ';
cout << x << endl;
int ret;
cin >> ret;
return ret;
}
void solve(int l,int r,int x)
{
if(l==r) return void(ans[x] = ans[l]);
int m = (l+r)/2;
if(ask(l,m-1,m)==ask(l,m,x)) solve(l,m,x);
else solve(m+1,r,x);
}
int main()
{
cin >> n;
for(int i = 1;i <= n;i++)
{
if(ask(1,i-1,i)!=lst) ans[i] = ++cur;
else solve(1,i-1,i);
lst = ans[i];
}
cout << "0 ";
for(int i = 1;i <= n;i++) assert(ans[i]<=n);
for(int i = 1;i <= n;i++) cout << ans[i] << ' ';
cout << endl;
}
# | 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... |