# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210291 | casperwang | 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 <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
const int MAXN = 5000;
int m;
int a[MAXN+1];
int d[MAXN+1];
bool p[MAXN+1];
void solve(int n) {
for (int i = 2; i <= n; i++)
d[i] = query(i-1, i);
for (int i = 3; i <= n; i++) {
if (d[i-1] + d[i] == query(i-2, i)) {
p[i] = p[i-1];
} else p[i] = !p[i-1];
}
for (int i = 2; i <= n; i++) {
if (p[i]) a[i] = a[i-1] + d[i];
else a[i] = a[i-1] - d[i];
m = min(m, a[i]);
}
for (int i = 1; i <= n; i++)
a[i] = a[i] - m + 1;
bool tf = 0, t = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == 1) t = 1;
if (a[i] == n && !t) tf = 1;
}
if (tf)
for (int i = 1; i <= n; i++)
a[i] = n - a[i] + 1;
for (int i = 1; i <= n; i++)
answer(i, a[i]);
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
return 0;
}