| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 111407 | igzi | Xylophone (JOI18_xylophone) | C++17 | 122 ms | 512 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"
#define maxN 5005
using namespace std;
int a[maxN];
void solve(int n) {
int i,x,y,p,q;
a[0]=0;
a[1]=query(1,2);
for(i=2;i<n;i++){
x=query(i,i+1);
y=query(i-1,i+1);
if(max(a[i-2],a[i-1]+x)-min(a[i-2],a[i-1])==y) a[i]=a[i-1]+x;
else a[i]=a[i-1]-x;
}
p=-maxN;
q=maxN;
for(i=0;i<n;i++){
if(a[i]<q){
q=a[i];
x=i;
}
if(a[i]>p){
p=a[i];
y=i;
}
}
if(y<x){
for(i=0;i<n;i++){
a[i]*=-1;
}
q=-p;
}
for(i=0;i<n;i++) {a[i]+=1-q; answer(i+1,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... | ||||
