# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172683 | nafis_shifat | Carnival (CEOI14_carnival) | C++14 | 59 ms | 400 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>
#define pii pair<int,int>
#define ll long long
using namespace std;
const int mxn=160;
int main()
{
int n;
cin>>n;
cout<<n<<" ";
for(int i=1;i<=n;i++)cout<<i<<" ";
cout<<endl;
int lst;
cin>>lst;
vector<int> baps;
baps.push_back(1);
int dn[mxn]={};
dn[1]=1;
for(int i=n-1;i>0;i--)
{
cout<<i<<" ";
for(int j=1;j<=i;j++)cout<<j<<" ";
cout<<endl;
int t;
cin>>t;
if(t!=lst)
{
baps.push_back(i+1);
dn[i+1]=1;
}
lst=t;
}
vector<int> p[mxn];
for(int i=0;i<baps.size();i++)
{
for(int j=1;j<=n;j++)
{
if(dn[j]==0)
{
cout<<"2 "<<baps[i]<<" "<<j<<endl;
int k;
cin>>k;
if(k==1)
{
p[baps[i]].push_back(j);
dn[j]=1;
}
}
}
}
int res[mxn];
for(int i=0;i<baps.size();i++)
{
res[baps[i]]=i+1;
for(int j=0;j<p[baps[i]].size();j++)
{
res[p[baps[i]][j]]=i+1;
}
}
cout<<"0 ";
for(int i=1;i<=n;i++)cout<<res[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... |