# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374216 | MilosMilutinovic | Carnival (CEOI14_carnival) | C++14 | 11 ms | 492 KiB |
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;
#define pb push_back
const int N=200;
int ans[N];
vector<int> dif;
void Add(int i){
cout<<(int)dif.size()+1<<" ";
for(int j:dif)cout<<j<<" ";
cout<<i<<endl;
int sz;cin>>sz;
if(sz>(int)dif.size())ans[i]=sz,dif.pb(i);
}
bool Can(int pos,int j){
cout<<pos+2<<" ";
for(int i=0;i<=pos;i++)cout<<dif[i]<<" ";
cout<<j<<endl;
int sz;cin>>sz;
return sz<pos+2;
}
int main(){
int n;cin>>n;
for(int i=1;i<=n;i++)Add(i);
for(int i=1;i<=n;i++){
if(ans[i])continue;
int bot=0,top=(int)dif.size()-1,pos=0;
while(bot<=top){
int mid=bot+top>>1;
if(Can(mid,i))pos=mid,top=mid-1;
else bot=mid+1;
}
ans[i]=ans[dif[pos]];
}
cout<<0<<" ";
for(int i=1;i<=n;i++)cout<<ans[i]<<" ";
cout<<endl;
return 0;
}
Compilation message (stderr)
# | 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... |