Submission #818931

#TimeUsernameProblemLanguageResultExecution timeMemory
818931Faisal_SaqibCarnival (CEOI14_carnival)C++17
0 / 100
8 ms208 KiB
#include <iostream>
#include <set>
#include <map>
#include <vector>
using namespace std;
int main()
{
	int n;
	cin>>n;
	map<int,int> val;
	set<int> head;
	for(int i=1;i<=n;i++)
	{
		val[i]=i;
	}
	head.insert(1);
	int cppq;
	for(int i=2;i<=n;i++)
	{
		cout<<((int)head.size())+1;
		for(auto j:head)
		{
			cout<<' '<<j;
		}
		cout<<' '<<i<<endl;
		cin>>cppq;
		if(cppq==(int)head.size())
		{
			for(auto j:head)
			{
				cout<<2<<' '<<j<<' '<<i<<endl;
				cin>>cppq;
				if(cppq==1)
				{
					val[i]=val[j];
					break;
				}
			}
		}
		else
		{
			head.insert(i);
		}
	}
	cout<<0;
	for(int i=1;i<=n;i++)
	{
		cout<<' '<<val[i];
	}
	cout<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...