# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624331 | as111 | Carnival (CEOI14_carnival) | C++14 | 5 ms | 464 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <string>
#define MAXN 150
using namespace std;
vector<int> pos;
int cost[MAXN + 2]; //# costumes for each and the next
int ID[MAXN + 2]; // id of costume
int main() {
int N;
cin >> N;
for (int i = 1; i < N; i++) {
cout << N - i + 1;
for (int j = i; j <= N; j++) {
cout << " " << j;
}
cout << endl;
cin >> (cost[i]);
}
int total = 0;
for (int i = 1; i <= N; i++) {
if (cost[i] != cost[i + 1]) { // diff costume added
total++;
ID[i] = total;
pos.push_back(i);
}
}
for (int i = 1; i <= N; i++) if (!ID[i]) {
while (pos[0] < i) pos.erase(pos.begin());
int l = 0, r = pos.size(), a = pos.size();
while (l + 1 < r) {
int m = (l + r) / 2;
int s = pos.size() - m + 1;
printf("%d", s);
for (int i = m; i < pos.size(); i++) printf(" %d", pos[i]);
printf(" %d\n", i); fflush(stdout);
int c; scanf("%d", &c);
if (c == s) r = m;
else l = m;
}
ID[i] = ID[pos[l]];
}
cout << 0;
for (int i = 1; i <= N; i++) {
cout << " " << ID[i];
}
cout << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |