# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
565609 | RealSnake | 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"
int a[5001];
bool sol(int n, int j, int val) {
a[j] = val;
int b[n + 1];
for(int i = j - 1; i >= 1; i--) {
int x = query(i, i + 1);
b[i] = x;
if(i == j - 1) {
a[i] = x + 1;
if(val != 1)
a[i] = val - x;
continue;
}
int y = query(i, i + 2);
if(a[i + 1] < a[i + 2]) {
if(a[i + 1] + x < a[i + 2]) {
if(y == b[i + 1])
a[i] = a[i + 1] + x;
else
a[i] = a[i + 1] - x;
}
else {
if(y == a[i + 2] - (a[i + 1] - x))
a[i] = a[i + 1] - x;
else
a[i] = a[i + 1] + x;
}
}
else {
if(a[i + 1] - x > a[i + 2]) {
if(y == b[i + 1])
a[i] = a[i + 1] - x;
else
a[i] = a[i + 1] + x;
}
else {
if(y == (a[i + 1] + x) - a[i + 2])
a[i] = a[i + 1] + x;
else
a[i] = a[i + 1] - x;
}
}
}
for(int i = j + 1; i <= n; i++) {
int x = query(i - 1, i);
b[i] = x;
if(i == j + 1) {
a[i] = x + 1;
if(val != 1)
a[i] = val - x;
continue;
}
int y = query(i - 2, i);
if(a[i - 1] < a[i - 2]) {
if(a[i - 1] + x < a[i - 2]) {
if(y == b[i - 1])
a[i] = a[i - 1] + x;
else
a[i] = a[i - 1] - x;
}
else {
if(y == a[i - 2] - (a[i - 1] - x))
a[i] = a[i - 1] - x;
else
a[i] = a[i - 1] + x;
}
}
else {
if(a[i - 1] - x > a[i - 2]) {
if(b[i - 1] == y)
a[i] = a[i - 1] - x;
else
a[i] = a[i - 1] + x;
}
else {
if(y == (a[i - 1] + x) - a[i - 2])
a[i] = a[i - 1] + x;
else
a[i] = a[i - 1] - x;
}
}
}
vector<int> ve;
for(int i = 1; i <= n; i++)
ve.push_back(a[i]);
sort(ve.begin(), ve.end());
for(int i = 1; i <= n; i++) {
if(ve[i - 1] != i)
return 0;
}
return 1;
}
void solve(int n) {
int j = 1;
for(int i = 1; i <= n; i++)
a[i] = 0;
for(int i = 1; i <= n; i++) {
int x = query(i, n);
if(x == n - 1)
j = i;
else
break;
}
if(!sol(n, j, 1))
sol(n, j, n);
for(int i = 1; i <= n; i++)
answer(i, a[i]);
}