제출 #116973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116973		IOrtroiii	사육제 (CEOI14_carnival)	C++14	100 / 100	27 ms	392 KiB

carnival

#include <bits/stdc++.h>

using namespace std;

const int N = 155;

int n;
int color[N];

int get(vector<int> val) {
   cout << val.size() << ' ';
   for (int v : val) {
      cout << v << ' ';
   }
   cout << endl;
   int ans;
   cin >> ans;
   return ans;
}

bool hasSame(int u, vector<int> val) {
   if (val.empty()) return false;
   int x = get(val);
   val.push_back(u);
   int y = get(val);
   return x == y;
}

int main() {
   cin >> n;
   int cnt = 0;
   for (int i = 1; i <= n; ++i) if (!color[i]) {
      color[i] = ++cnt;
      vector<int> val;
      for (int j = i + 1; j <= n; ++j) {
         if (!color[j]) {
            val.push_back(j);
         }
      }
      while (!val.empty() && hasSame(i, val)) {
         int l = 0, r = val.size() - 1;
         while (l < r) {
            int md = (l + r) >> 1;
            if (hasSame(i, vector<int>(val.begin(), val.begin() + md + 1))) {
               r = md;
            } else {
               l = md + 1;
            }
         }
         color[val[l]] = cnt;
         val = vector<int>(val.begin() + l + 1, val.end());
      }
   }
   cout << 0 << ' ';
   for (int i = 1; i <= n; ++i) {
      cout << color[i] << ' ';
   }
   cout << endl;
}

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