# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36885 | cheater2k | Carnival (CEOI14_carnival) | C++14 | 13 ms | 2180 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;
const int N = 155;
vector<int> vec[N];
int n, color[N];
int cnt = 1;
int get(vector<int> &a) {
cout << a.size() << ' ';
for (int u : a) cout << u << ' ';
cout << endl;
int ret; cin >> ret; return ret;
}
bool inside(int l, int r, int cur) {
vector<int> a;
for (int c = l; c <= r; ++c) a.push_back(vec[c][0]);
a.push_back(cur);
int x = r - l + 1;
int y = get(a);
if (x == y) return true; // inside
else return false;
}
bool ask(int l, int r, int cur) {
if (l == r) {
# | 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... |