# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525584 | huangqr | Xylophone (JOI18_xylophone) | C++14 | 108 ms | 328 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];
#include<bits/stdc++.h>
using namespace std;
void solve(int N) {
int v[10005];
v[1]=1;
v[2]=1+query(1,2);
int mn=1;
for(int i=3;i<=N;i++){
int x=query(i-2,i),y=query(i-1,i);
if(v[i-1]>v[i-2]){
if(x==y)v[i]=v[i-1]-y;
else if(x>y&&x==v[i-1]-v[i-2])v[i]=v[i-1]-y;
else if(x-y==v[i-1]-v[i-2])v[i]=v[i-1]+y;
else assert(0);
}
else{
if(x==y)v[i]=v[i-1]+y;
else if(x>y&&x==v[i-2]-v[i-1])v[i]=v[i-1]+y;
else if(x-y==v[i-2]-v[i-1])v[i]=v[i-1]-y;
else assert(0);
}
mn=min(mn,v[i]);
}
for(int i=1;i<=N;i++)v[i]-=(mn-1);
int pos_1,pos_N;
for(int i=1;i<=N;i++){
if(v[i]==1)pos_1=i;
if(v[i]==N)pos_N=i;
}
if(pos_1>pos_N){
for(int i=1;i<=N;i++)v[i]=N+1-v[i];
}
/*for(int i = 1; i <= N; i++) {
cout<<v[i]<<" ";
//answer(i, i);
}*/
for(int i=1;i<=N;i++)answer(i,v[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... |