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>
int a[5000];
void solve(int n) {
int diff=n-1;
int ind;
for(int i=1;i<n;i++){
int val=query(i+1,n);
if(val==diff-1){
ind=i;
break;
}
}
a[ind]=1;
a[ind+1]=1+query(ind,ind+1);
for(int i=ind+2;i<=n;i++){
int p=query(i-2,i);
int d=abs(a[i-1]-a[i-2]);
if(p==d){
int q=query(i-1,i-2);
a[i]=a[i-1]-q;
}else{
a[i]=a[i-2]+p;
}
}
if(ind>1){
a[ind-1]=1+query(ind-1,ind);
for(int i=ind-2;i>=1;i--){
int p=query(i,i+2);
int d=abs(a[i+1]-a[i+2]);
if(p==d){
int q=query(i+1,i+2);
a[i]=a[i+1]-q;
}else{
a[i]=a[i+2]+p;
}
}
}
for(int i=1;i<=n;i++)answer(i,a[i]);
}
Compilation message (stderr)
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:8:9: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
int ind;
^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |