# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160626 | dantoh000 | Xylophone (JOI18_xylophone) | C++14 | 130 ms | 564 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"
static int A[5000];
void solve(int N) {
int dir[N+1]; dir[1] = 1;
int diff[N+1];
int trip[N+1];
for (int i = 1; i < N; i++){
diff[i] = query(i,i+1);
}
for (int i = 1; i < N-1; i++){
trip[i] = query(i,i+2);
if (trip[i] == diff[i]+diff[i+1]){
dir[i+1] = dir[i];
}
else{
dir[i+1] = -1*dir[i];
}
}
int ans[N]; ans[1] = 1;
int ma = 1, mi = 1;
int maid, miid;
for (int i = 2; i <= N; i++){
ans[i] = ans[i-1] + dir[i-1]*diff[i-1];
if (ans[i] > ma){
ma = ans[i];
maid = i;
}
if (ans[i] < mi){
mi = ans[i];
miid = i;
}
}
int offset = N-ma;
for(int i = 1; i <= N; i++) {
ans[i] += offset;
if (maid < miid){
ans[i] = N+1-ans[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... |