# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197432 | Juney | Carnival (CEOI14_carnival) | C++14 | 24 ms | 424 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;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5 + 5;
int N, col[155];
vector<int> V;
void out(vector<int> &v) {
cout << v.size() << ' ';
for(auto i : v) cout << i << ' ';
cout << endl;
}
int search(int x) {
int l = 0, r = V.size() - 1, ret;
while(l <= r) {
if(l == r) {
ret = l;
break;
}
int mid = l + r >> 1;
vector<int> t; t.push_back(x);
for(int i=l; i<=mid; i++) t.push_back(V[i]);
out(t);
int a; cin >> a;
if(a == mid - l + 1) r = mid;
else l = mid + 1;
}
return ret + 1;
}
int main() {
//ios::sync_with_stdio(0); cin.tie(0);
cin >> N;
V.push_back(1); col[1] = 1;
for(int i=2; i<=N; i++) {
V.push_back(i);
out(V);
int x; cin >> x;
if(x < V.size()) {
V.pop_back();
int c = search(i);
col[i] = c;
}
else col[i] = V.size();
}
cout << 0 << ' ';
for(int i=1; i<=N; i++) cout << col[i] << ' ';
cout << endl;
}
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... |