# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201486 | wilwxk | Xylophone (JOI18_xylophone) | C++14 | 101 ms | 516 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 5e3+5;
int ans[MAXN];
int mem[MAXN];
int mn;
void solve(int n) {
ans[0] = 0;
int op = 1;
for(int i = 2; i <= n; i++) {
mem[i] = query(i-1, i);
if(i == 2) {
ans[i] = mem[i];
continue;
}
int x = query(i-2, i);
if(mem[i-1] >= max(mem[i], x) || mem[i] >= max(mem[i-1], x)) op *= -1;
ans[i] = ans[i-1]+op*mem[i];
mn = min(ans[i], mn);
}
for(int i = 1; i <= n; i++) ans[i] -= (mn-1);
bool ok = 1; int mni, mxi;
for(int i = 1; i <= n; i++) {
if(ans[i] == 1) mni = i;
if(ans[i] == n) mxi = i;
}
if(mni > mxi) ok = 0;
if(!ok) {
for(int i = 1; i <= n; i++) ans[i] = n-ans[i]+1;
}
for(int i = 1; i <= n; i++) answer(i, ans[i]);
}
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... |