#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define endl '\n'
#define pb push_back
const int N=2e5+5,MAXA=1e6+5,inf=1e9,MOD=1e9+7;
signed main(){
//ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin>>n;
int ans[n+1];
ans[1]=1;
vector<int> uniq={1};
for(int i=2;i<=n;i++){
cout<<uniq.size()+1<<" ";
for(auto j:uniq)cout<<j<<' ';
cout<<i<<endl;
int sol; cin>>sol;
if(sol==uniq.size()+1){
ans[i]=uniq.size()+1; uniq.pb(i);
continue;
}
int l=0,r=uniq.size()-1;
while(l<r){
int mid=(l+r)/2;
cout<<mid-l+2<<' ';
for(int j=l;j<=mid;j++)cout<<uniq[j]<<' ';
cout<<i<<endl;
cin>>sol;
if(sol==mid-l+2)l=mid+1;
else r=mid;
}
// cout<<uniq[l]<<' '<<l<<' '<<r<<endl;
ans[i]=ans[uniq[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... |