| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 220144 | MKopchev | Carnival (CEOI14_carnival) | C++14 | 12 ms | 512 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;
const int nmax=1e3+42;
int ask(vector<int> v)
{
cout<<v.size();
for(auto k:v)cout<<" "<<k;
cout<<endl;
int ret;
cin>>ret;
return ret;
}
int output[nmax];
vector<int> my_merge(vector<int> v,int val)
{
v.push_back(val);
return v;
}
int main()
{
int n;
cin>>n;
vector<int> diff={};
for(int i=1;i<=n;i++)
{
if(ask(my_merge(diff,i))==diff.size()+1){diff.push_back(i);output[i]=diff.size();}
else
{
//output[i] is within output[diff[j]]
vector<int> active=diff;
while(active.size()>1)
{
vector<int> help[2];
help[0]={};
help[1]={};
for(int j=0;j<active.size();j++)
help[j%2].push_back(active[j]);
if(ask(my_merge(help[0],i))==help[0].size())active=help[0];
else active=help[1];
}
output[i]=output[active[0]];
}
}
cout<<0;for(int i=1;i<=n;i++)cout<<" "<<output[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... | ||||
