# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444158 | Supersonic | Xylophone (JOI18_xylophone) | C++14 | 139 ms | 320 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;
int a[5001];
void solve(int n) {
int d[5001];
d[1]=0;int y=-1;
d[2]=-query(1,2);int p=-d[2];
for(int i=3;i<=n;i++){
int q=query(i-1,i);
int r=query(i-2,i);
//cerr<<p<<' '<<q<<' '<<r<<endl;
if(p+q!=r)y*=-1;
p=q;d[i]=y*q;
}
for(int i=2;i<=n;i++)d[i]+=d[i-1];
int m=1e9;
for(int i=1;i<=n;i++)m=min(m,d[i]);
for(int i=1;i<=n;i++)d[i]+=1-m;
//for(int i=1;i<=n;i++)cerr<<d[i]<<' ';cerr<<endl;
int l1,ln;
for(int i=1;i<=n;i++){if(d[i]==1)l1=i;if(d[i]==n)ln=i;}
if(l1>ln)for(int i=1;i<=n;i++)answer(i,n-d[i]+1);
else for(int i=1;i<=n;i++)answer(i,d[i]);
//cerr<<a-1<<endl;
}
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... |