# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
505147 | tengiz05 | Xylophone (JOI18_xylophone) | C++17 | 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"
#include "grader.cpp"
#include <bits/stdc++.h>
static int a[5005];
void solve(int n) {
a[2] = query(1, 2);
for (int i = 3; i <= n; i++) {
int x = query(i - 1, i);
int y = query(i - 2, i);
if (x + abs(a[i - 2] - a[i - 1]) == y) {
if (a[i - 2] > a[i - 1]) {
a[i] = a[i - 1] - x;
} else {
a[i] = a[i - 1] + x;
}
} else {
if (a[i - 2] > a[i - 1]) {
a[i] = a[i - 1] + x;
} else {
a[i] = a[i - 1] - x;
}
}
}
if (std::min_element(a + 1, a + n + 1) > std::max_element(a + 1, a + n + 1)) {
for (int i = 1; i <= n; i++) {
a[i] = -a[i];
}
}
int x = *std::min_element(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
answer(i, a[i] - x + 1);
}
}