# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551801 | QwertyPi | Xylophone (JOI18_xylophone) | C++14 | 3 ms | 312 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;
static int A[5000];
int d[5000], dd[5001], sg[5001];
void solve(int N) {
for(int i = 1; i <= N - 1; i++){
d[i] = query(i, i + 1);
}
sg[1] = 1;
int cur_val = d[1];
for(int i = 2; i <= N - 1; i++){
int val = query(i - 1, i + 1);
sg[i] = (abs(d[i - 1] + d[i]) == val ? 1 : -1) * sg[i - 1];
}
A[1] = 1;
for(int i = 2; i <= N; i++){
A[i] = A[i - 1] + d[i - 1] * sg[i - 1];
}
int mn = N + 1;
for(int i = 1; i <= N; i++){
mn = min(A[i], mn);
}
for(int i = 1; i <= N; i++){
A[i] += 1 - mn;
}
if(A[1] > A[N]){
for(int i = 1; i <= N; i++){
A[i] = N + 1 - A[i];
}
}
for(int i = 1; i <= N; i++) {
answer(i, A[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... |