#include<bits/stdc++.h>
#include <xylophone.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, a[5001];
void solve(int n){
int t[5001], q[5003];
for(int i=1; i<=n; i++) q[i]=query(i, i+1);
int l=1, r=n;
while(r-l>1){
int mid=(l+r)/2;
if(query(1, mid)!=n-1) l=mid;
else r=mid;
}
int mx=r;
l=1, r=mx;
while(r-l>1){
int mid=(l+r)/2;
if(query(mid, mx)!=n-1) r=mid;
else l=mid;
}
int mn=l;
t[mn]=1, t[mx]=n;
if(mn>1) t[mn-1]=query(mn-1, mn)+1;
t[mn+1]=query(mn, mn+1)+1;
if(mx<n) t[mx+1]=n-query(mx, mx+1);
t[mx-1]=n-query(mx-1, mx);
for(int i=mn-1; i>=2; i--){
int q1=query(i-1, i+1), q2=q[i-1], q3=q[i];
if(q1==q2+q3){
if(t[i+1]>t[i]) t[i-1]=t[i]-q2;
else t[i-1]=t[i]+q2;
}
else{
if(t[i+1]>t[i]) t[i-1]=t[i]+q2;
else t[i-1]=t[i]-q2;
}
}
for(int i=mn+1; i<=mx-2; i++){
int q1=query(i-1, i+1), q2=q[i-1], q3=q[i];
if(q1==q2+q3){//cout<<i<<"mamamia"<<endl;
if(t[i-1]>t[i]) t[i+1]=t[i]-q3;
else t[i+1]=t[i]+q3;
}
else{
if(t[i-1]>t[i]) t[i+1]=t[i]+q3;
else t[i+1]=t[i]-q3;
}
}
for(int i=mx+1; i<=n-1; i++){
int q1=query(i-1, i+1), q2=q[i-1], q3=q[i];
if(q1==q2+q3){
if(t[i-1]>t[i]) t[i+1]=t[i]-q3;
else t[i+1]=t[i]+q3;
}
else{
if(t[i-1]>t[i]) t[i+1]=t[i]+q3;
else t[i+1]=t[i]-q3;
}
}
//for(int i=1; i<=n; i++) cout<<t[i]<<"x ";
for(int i=1; i<=n; i++) answer(i, t[i]);
//cout<<mn<<" "<<mx<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
328 KB |
Wrong Answer [1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
328 KB |
Wrong Answer [1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
328 KB |
Wrong Answer [1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
