# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116765 | Noam527 | Carnival (CEOI14_carnival) | C++17 | 21 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>
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 1;
const int OOO = 1;
using namespace std;
int ask(int P, int extra = -1) {
if (extra <= P) {
cout << P << " ";
for (int i = 1; i <= P; i++) cout << i << " ";
cout << endl;
fflush(stdout);
}
else {
cout << P + 1 << " ";
for (int i = 1; i <= P; i++) cout << i << " ";
cout << extra << endl;
fflush(stdout);
}
int rtn;
cin >> rtn;
return rtn;
}
int n;
int P[200];
int ans[200];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) P[i] = ask(i);
int nxt = 1;
for (int i = 1; i <= n; i++) {
int lo = 1, hi = i, mid;
while (lo < hi) {
mid = (lo + hi) / 2;
if (P[mid] == ask(mid, i)) hi = mid;
else lo = mid + 1;
}
if (i == lo) ans[i] = nxt++;
else ans[i] = ans[lo];
}
cout << "0 ";
for (int i = 1; i <= n; i++) cout << ans[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... |