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 mxn=155;
int n,comp[mxn],sz,cnt;
bool a[mxn];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
a[i]=1;
sz++;
cout<<sz<<endl;
for(int j=1;j<=i;j++){
if(a[j])cout<<j<<endl;
}
int x;
cin>>x;
if(x==sz){
comp[i]=++cnt;
continue;
}
int L=1,R=sz;
while(R-L>1){
int mid=(L+R)/2,sum=0;
cout<<mid-L+1<<endl;
for(int j=1;j<=i;j++){
sum+=a[j];
if(a[j] && sum>=L && sum<mid)cout<<j<<endl;
}
cout<<i<<endl;
cin>>x;
if(x==mid-L+1)
L=mid;
else
R=mid;
}
comp[i]=comp[L];
a[i]=0;
sz--;
}
for(int i=1;i<=n;i++)
cout<<comp[i]<<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... |