# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225950 | bensonlzl | Carnival (CEOI14_carnival) | C++14 | 12 ms | 512 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 <bits/stdc++.h>
using namespace std;
int colour[205], c;
vector<int> distinct;
int N;
int query(vector<int> q){
int x;
cout << q.size() << ' ';
for (auto it : q){
cout << it << ' ';
}
cout << '\n' << flush;
cin >> x;
return x;
}
int find_colour(int x, vector<int> v){
if (v.size() == 1){
return colour[v[0]];
}
vector<int> v1, v2;
for (int i = 0; i < v.size(); ++i){
if (i%2==0) v1.push_back(v[i]);
else v2.push_back(v[i]);
}
v1.push_back(x);
int a2 = query(v1);
v1.pop_back();
if (a2 == v1.size()) return find_colour(x,v1);
else return find_colour(x,v2);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 1; i <= N; ++i){
distinct.push_back(i);
int d = query(distinct);
if (d != distinct.size()){
distinct.pop_back();
}
else{
colour[i] = ++c;
}
}
for (int i = 1; i <= N; ++i){
if (!colour[i]){
colour[i] = find_colour(i,distinct);
}
}
cout << "0 ";
for (int i = 1; i <= N; ++i){
cout << colour[i] << ' ';
}
cout << '\n';
}
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... |