# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94327 | fedoseevtimofey | Xylophone (JOI18_xylophone) | C++14 | 0 ms | 0 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 "xylophone.h"
void solve(int n) {
int r = n;
while (query(1, r) == n - 1) --r;
++r;
vector <int> a(n + 1, -1);
a[r] = n;
if (r != n) {
a[r + 1] = n - query(r, r + 1);
}
if (r != 1) {
a[r - 1] = n - query(r - 1, r);
}
for (int i = r - 2; i >= 1; --i) {
int x = query(i, i + 1);
int y = query(i, i + 2);
for (int z = 1; z <= n; ++z) {
a[i] = z;
if (my_query(i, i + 1, a) == x && my_query(i, i + 2, a) == y) {
break;
}
}
assert(a[i] != -1);
}
for (int i = r + 2; i <= n; ++i) {
int x = query(i - 1, i);
int y = query(i - 2, i);
for (int z = 1; z <= n; ++z) {
a[i] = z;
if (my_query(i - 1, i, a) == x && my_query(i - 2, i, a) == y) {
break;
}
}
assert(a[i] != -1);
}
for (int i = 1; i <= n; ++i) {
answer(i, a[i]);
}
}