# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
565661 | birthdaycake | Xylophone (JOI18_xylophone) | C++17 | 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;
int A[5001][5001];
int ans[5001];
void solve(int N) {
for(int i = 1; i <= N; i++) ans[i] = 0;
int l = 1, r = 2;
int value = query(l,r);
while(value != N - 1){
r++;
value = query(l,r);
}
ans[r] = N;
for(int i = r + 1; i <= min(r + 1, N); i++){
value = query(r, i);
ans[i] = ans[r] - value;
}
for(int i = r + 2; i <= N; i++){
int a = query(i - 2, i), b = query(i - 1, i);
if(a > b){
if(ans[i - 2] > ans[i - 1]){
ans[i] = ans[i - 2] - a;
}else{
ans[i] = ans[i - 2] + a;
}
}else{
if(ans[i - 2] > ans[i - 1]){
ans[i] = ans[i - 1] + a;
}else{
ans[i] = ans[i - 1] - a;
}
}
}
for(int i = r - 1; i <= min(r - 1, r) ;i++){
value = query(i, r);
ans[i] = ans[r] - value;
}
for(int i = r - 2; i >= 1; i--){
int a = query(i, i + 2), b = query(i, i + 1);
if(a > b){
if(ans[i + 2] > ans[i + 1]){
ans[i] = ans[i + 2] - a;
}else{
ans[i] = ans[i + 2] + a;
}
}else{
if(ans[i + 2] > ans[i + 1]){
ans[i] = ans[i + 1] + a;
}else{
ans[i] = ans[i + 1] - a;
}
}
}
for(int i = 1; i <= N; i++){
answer(i,a[i]);
}
}