제출 #116767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116767		ioilolcom	Carnival (CEOI14_carnival)	C++14	0 / 100	6 ms	384 KiB

carnival

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
const int N=125;
int P[N],an[N];
int cnt;
int query(int e,int a){
	if(a==0) {
		cout<<e<<" ";
		for(int i=1; i<=e; i++) {
			cout<<i<<" ";
		}
		cout<<endl;
		fflush(stdout);
	}
	else{
		cout<<e+1<<" ";
		for(int i=1; i<=e; i++) {
			cout<<i<<" ";
		}
		cout<<a<<endl;
		fflush(stdout);
	}
	int cur;
	cin>>cur;
	return cur;
}
int main()
{
	int n; cin>>n;
	for(int i=1; i<=n; i++) {
		P[i]=query(i,0);
	}
	for(int i=1; i<=n; i++) {
		int l=1; int r=i;
		int ans=i;
		while(l<=r) {
			int mid=(l+r)/2;
			if(P[mid]==query(mid,i)) {
				r=mid-1;
				ans=mid;
			}
			else{
				l=mid+1;
			}
		}
		if(ans!=i) {
			an[i]=an[ans];
		}
		else{
			an[i]=++cnt;
		}
	}
	cout<<0<<" ";
	for(int i=1; i<=n; i++) {
		cout<<an[i]<<" ";
	}
	cout<<endl;
	return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20