Submission #476011

#	Time	Username	Problem	Language	Result	Execution time	Memory
476011		elgamalsalman	Carnival (CEOI14_carnival)	C++14	100 / 100	9 ms	292 KiB

carnival

#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

int n, costumes[200];
vi distincts;

int main() {
  //ios_base::sync_with_stdio(0);
  //cin.tie(0);

  memset(costumes, -1, sizeof costumes);

  cin >> n;
  costumes[1] = 0;
  distincts = {1};
  for (int i = 2; i <= n; i++) {
    cout << (int)distincts.size() + 1;
    for (int ele : distincts) cout << ' ' << ele;
    cout << ' ' << i << endl;

    int c;
    cin >> c;
    if (c == (int)distincts.size() + 1) {
      costumes[i] = (int)distincts.size();
      distincts.push_back(i);
    } else {
      // binary search
      int l = 0, r = (int)distincts.size() - 1;
      while (l < r) {
	int mid = (l + r) / 2;
	cout << mid - l + 2;
	for (int j = l; j <= mid; j++) cout << ' ' << distincts[j];
	cout << ' ' << i << endl;
	cin >> c;
	if (c == mid - l + 2) l = mid + 1;
	else r = mid;
      }
      assert(l == r);
      costumes[i] = l;
    }
  }

  cout << 0;
  for (int i = 1; i <= n; i++) cout << ' ' << costumes[i] + 1;
  cout << endl;
}

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