제출 #73793

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73793		arman_ferdous	Carnival (CEOI14_carnival)	C++17	100 / 100	35 ms	824 KiB

carnival

#include <bits/stdc++.h>
using namespace std;

const int N = 155;
int n, ans[N], dp[N][N];

int ask(int l, int r) {
	if(dp[l][r]) return dp[l][r];
	if(l == r) return 1;

	cout << r - l + 1;
	for(int i = l; i <= r; i++)
		cout << " " << i;
	cout << endl;
	int ret; cin >> ret;
	return dp[l][r] = ret;
}

int main() {
	cin >> n;
	fill(ans+1,ans+n+1,-1);
	int cur = 1;
	for(int i = 1; i <= n; i++) {
		if(ans[i] == -1) ans[i] = cur++;
		int lo = i+1, hi = n, idx = i;
		while(lo <= hi) {
			int mid = (lo + hi) >> 1;
			if(ask(i,mid) != ask(i+1,mid)) 
				idx = mid, lo = mid+1;
			else hi = mid-1;
		} ans[idx+1] = ans[i];
	}
	cout << "0";
	for(int i = 1; i <= n; i++) 
		cout << " " << ans[i];
	return 0;
}

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