Submission #1256182

#TimeUsernameProblemLanguageResultExecution timeMemory
1256182gelastropodCarnival (CEOI14_carnival)C++20
100 / 100
4 ms416 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
	int N, prev = 0;
	cin >> N;
	vector<int> firsts, ans(N, 0), did(N, 0);
	for (int i = 0; i < N; i++) {
		cout << i + 1 << ' ';
		for (int j = 0; j < i + 1; j++) cout << j + 1 << ' ';
		cout << endl;
		int res; cin >> res;
		if (prev != res) {
			prev = res;
			ans[i] = firsts.size();
			firsts.push_back(i);
			did[i] = 1;
		}
	}
	for (int i = 0; i < 8; i++) {
		vector<int> test;
		for (int j = 0; j < firsts.size(); j++) {
			if (j & (1LL << i)) test.push_back(firsts[j]);
		}
		for (int j = 0; j < N; j++) {
			if (did[j]) continue;
			cout << test.size() + 1 << ' ';
			for (int k : test) cout << k + 1 << ' ';
			cout << j + 1 << endl;
			int res; cin >> res;
			if (res == test.size()) ans[j] += (1LL << i);
		}
	}
	cout << "0 ";
	for (int i : ans) cout << i + 1 << ' ';
	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...