#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n;
    cin>>n;
    int g[n+1];
    g[1]=1;
    int l=1,r=1;
    int m;
    int num[n+1];
    num[1]=1;
    for(int i=2;i<=n;i++)
    {
        cout<<r-i+2<<' ';
        for(int j=l;j<=r;j++)
        cout<<g[j]<<' ';
        cout<<i;
        cin>>m;
        if(m==r-i+2)
        {
            r++;
            g[r]=i;
            num[i]=i;
            continue;
        }
        int ll=l,rr=r;
        while(ll<rr)
        {
            int mid=(ll+rr)/2;
            cout<<mid-ll+2<<' ';
            for(int j=ll;j<=mid;j++)
            cout<<g[j]<<' ';
            cout<<i;
            cin>>m;
            if(m==mid-ll+2)
            {
                rr=mid;
            }
            else
            {
                ll=mid+1;
            }
        }
        num[i]=g[ll];
    }
    map<int,int> mp;
    int now=1;
    for(int i=l;i<=r;i++)
    {
        mp[g[i]]=now;
        now++;
    }
    cout<<0<<' ';
    for(int i=1;i<=n;i++)
    {
        cout<<mp[num[i]]<<' ';
    }
}
| # | 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... |