Submission #779803

#	Time	Username	Problem	Language	Result	Execution time	Memory
779803		NK_	Carnival (CEOI14_carnival)	C++17	0 / 100	13 ms	448 KiB

carnival

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'

template<class T> using V = vector<T>;
int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	V<int> P(N, -1);

	map<pair<int, int>, int> ASK;

	auto ask = [&](int x, int l, int r) {
		pair<int, int> q = make_pair(l, r);

		int res1;
		if (ASK.find(q) != ASK.end()) {
			cout << r - l + 1 << " ";
			for(int i = l; i <= r; i++) cout << " " << i + 1;
			cout << endl;

			cin >> res1; // WITHOUT
			ASK[q] = res1;
		} else res1 = ASK[q];

		cout << r - l + 1 + 1 << " " << x + 1;
		for(int i = l; i <= r; i++) cout << " " << i + 1;
		cout << endl;
	
		int res2; cin >> res2; // WITH

		return res1 == res2;
	};

	for(int i = 0; i < N; i++) {
		int lo = i, hi = N - 1;
		while(lo < hi) {
			int mid = (lo + hi + 1) / 2;
			if (ask(i, mid, hi)) lo = mid;
			else hi = mid - 1;
		}
		P[i] = lo;
	}	

	V<int> C(N, -1); int cur = 1;
	for(int i = N-1; i >= 0; i--) {
		if (C[P[i]] == -1) C[i] = cur++;
		else C[i] = C[P[i]];
	}

	cout << 0;
	for(auto x : C) cout << " " << x;
	cout << endl;

    return 0;
}

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