#include "xylophone.h"
using namespace std;
const int MN=5e3+5;
int arr[MN];
bool check[MN];
int limit;
void solve(int N){
int n=N;
for(int i=1;i<=n;++i){
check[i]=false;
}
limit=10000;
int l=1,r=n-1;
while(l<r){
int mid=l+r>>1;
int res=query(mid,n); --limit;
// cout<<"Case "<<mid<<' '<<n<<": "<<res<<'\n';
if(res==n-1) l=mid+1;
else r=mid;
}
int idx=l-1;
answer(idx,1);
check[1]=true;
l=idx-2; r=idx+2;
if(idx>1){
int res=query(idx-1,idx); --limit;
answer(idx-1,res+1);
check[res+1]=true;
}
int res=query(idx,idx+1); --limit;
answer(idx+1,res+1);
check[res+1]=true;
for(int i=l;i>=1;--i){
int res=query(i,i+1); --limit;
if(arr[i+1]+res>=n||arr[i+1]+res<=1||check[arr[i+1]+res]){
answer(i,arr[i+1]-res);
check[arr[i+1]-res]=true; continue;
}
if(arr[i+1]-res>=n||arr[i+1]-res<=1||check[arr[i+1]-res]){
answer(i,arr[i+1]+res);
check[arr[i+1]+res]=true; continue;
}
if(limit==i-1){
if(!check[arr[i+1]+res]&&arr[i+1]+res<n){
answer(i,arr[i+1]+res);
check[arr[i+1]+res]=true;
}
else{
answer(i,arr[i+1]-res);
check[arr[i+1]-res]=true;
}
}
else{
int res2=query(i,i+2); --limit;
if(res==res2){
if(arr[i+2]<arr[i+1]) arr[i]=arr[i+1]-res;
else arr[i]=arr[i+1]+res;
}
else{
if(arr[i+1]>arr[i+2]){
if(res2==arr[i+1]-arr[i+2]) arr[i]=arr[i+1]-res;
else arr[i]=arr[i+1]+res;
}
else{
if(res2==arr[i+2]-arr[i+1]) arr[i]=arr[i+1]+res;
else arr[i]=arr[i+1]-res;
}
}
answer(i,arr[i]); check[arr[i]]=true;
}
}
for(int i=r;i<=n;++i){
int res=query(i-1,i); --limit;
if(arr[i-1]+res>n||arr[i-1]+res<=1||check[arr[i-1]+res]){
answer(i,arr[i-1]-res);
check[arr[i-1]-res]=true; continue;
}
if(arr[i-1]-res>n||arr[i-1]-res<=1||check[arr[i-1]-res]){
answer(i,arr[i-1]+res);
check[arr[i-1]+res]=true; continue;
}
if(limit==n-i){
if(!check[arr[i-1]+res]&&arr[i-1]+res<=n){
answer(i,arr[i-1]+res);
check[arr[i-1]+res]=true;
}
else{
answer(i,arr[i-1]-res);
check[arr[i-1]-res]=true;
}
}
else{
int res2=query(i-2,i); --limit;
// cout<<"Case "<<i<<": "<<res<<' '<<res2<<'\n';
if(res==res2){
if(arr[i-2]<arr[i-1]) arr[i]=arr[i-1]-res;
else arr[i]=arr[i-1]+res;
}
else{
if(arr[i-2]<arr[i-1]){
if(res2==arr[i-1]-arr[i-2]) arr[i]=arr[i-1]-res;
else arr[i]=arr[i-1]+res;
}
else{
if(res2==arr[i-2]-arr[i-1]) arr[i]=arr[i-1]+res;
else arr[i]=arr[i-1]-res;
}
}
answer(i,arr[i]); check[arr[i]]=true;
}
}
}
Compilation message
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:18:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
18 | int mid=l+r>>1;
| ~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [3] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [3] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer [3] |
| 2 |
Halted |
0 ms |
0 KB |
- |
