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;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
vector<int> v;
v.push_back(1);
int cur,prev=1;
for(int i=2;i<=n;i++){
cout<<i<<" ";
for(int j=1;j<=i;j++){
cout<<j<<" ";
}
cout<<endl;
cin>>cur;
if(cur>prev){
v.push_back(i);
prev=cur;
}
}
int ans[n];
memset(ans,0,sizeof(ans));
int x=1;
for(int i=0;i<cur;i++){
ans[v[i]-1]=x++;
}
x=0;
for(int i=1;i<=n;i++){
if(x<cur&&v[x]==i){
x++;
continue;
}
int l=0,r=cur-1;
while(l<r){
int m=(l+r)/2;
cout<<m-l+2<<" ";
for(int j=l;j<=m;j++){
cout<<v[j]<<" ";
}
cout<<i<<endl;
int k;
cin>>k;
if(k>m-l+1){
l=m+1;
}else{
r=m;
}
}
ans[i-1]=ans[v[l]-1];
}
cout<<"0 ";
for(int i=0;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... |