Submission #83551

#	Time	Username	Problem	Language	Result	Execution time	Memory
83551		faceless	Carnival (CEOI14_carnival)	C++14	100 / 100	17 ms	656 KiB

carnival

#include <bits/stdc++.h>
#define MP make_pair
#define F first
#define PB push_back
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int maxn = 1e5 + 4;
const ll inf = 1e18;
int col = 1, c[maxn];
vector <int> v;

int print (int lo, int hi, bool wh) {
	cout << hi - lo + wh << " ";
	if (wh)
		cout << v[0] << " ";	
	for (int i = lo; i < hi; i++)
		cout << v[i] << " ";
	cout << endl;
	int k;
	cin >> k;
	return k;
}

void find_same (int lo, int hi) {
	if (print (lo, hi, 1) > print (lo, hi, 0))
		return;
	if (lo + 1 == hi) {
		c[v[lo]] = col;
		return;
	}
	int mid = (hi + lo) >> 1;
	find_same (lo, mid);
	find_same (mid, hi);
}

int main (){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		v.PB (i);
	while (!v.empty()) {
		if (v.size() == 1) {
			c[v.back()] = col;
			break;
		}
		find_same (1, v.size());
		c[v[0]] = col;
		for (int i = v.size() - 1; i >= 0; i--)
			if (c[v[i]] == col)
				v.erase (v.begin() + i);
		col ++;
	}
	cout << 0 << " ";
	for (int i = 1; i <= n; i++)
		cout << c[i] << " ";
	cout << endl;
}

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