제출 #1236139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236139		kaiboy	Carnival (CEOI14_carnival)	C++20	100 / 100	6 ms	412 KiB

carnival

#include <algorithm>
#include <iostream>

using namespace std;

const int N = 150;

int aa[N], qu[N];

int main() {
	int n; cin >> n;
	for (int cnt = 0, i = 0; i < n; i++) {
		int lower = -1, upper = cnt;
		while (upper - lower > 1) {
			int h = lower + upper >> 1;
			cout << h + 2 << ' ';
			for (int g = 0; g <= h; g++)
				cout << qu[g] + 1 << ' ';
			cout << i + 1 << endl;
			int k; cin >> k;
			if (k < h + 2)
				upper = h;
			else
				lower = h;
		}
		int h = upper;
		if (h < cnt)
			aa[i] = h;
		else
			qu[aa[i] = cnt++] = i;
	}
	cout << 0;
	for (int i = 0; i < n; i++)
		cout << ' ' << aa[i] + 1;
	cout << endl;
	return 0;
}

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