#include<bits/stdc++.h>
#include "xylophone.h"
#define ll int
using namespace std;
ll a[100005];
ll calc(ll a, ll b, ll dis1, ll dis2)
{
if (a<b)
{
if (dis1==dis2 || dis2==b-a)
return a+dis1;
return a-dis1;
}
if (dis1==dis2 || dis2==a-b)
return a-dis1;
return a+dis1;
}
void solve(ll n)
{
// freopen("output.txt", "w", stdout);
ll L=1, R=n;
ll lo=L, hi=R, val=query(lo, hi);
while (hi-lo>1)
{
ll mid=(hi+lo)/2;
if (query(L, mid)!=val)
lo=mid;
else hi=mid;
}
if (query(L, lo)!=val)
R=hi;
else R=lo;
lo=L, hi=R;
while (hi-lo>1)
{
ll mid=(hi+lo)/2;
if (query(mid, R)!=val)
hi=mid;
else lo=mid;
}
if (query(hi, R)!=val)
L=lo;
else R=hi;
a[L]=1; a[R]=n;
// cout << L << " " << R << "\n";
if (L>1) a[L-1]=a[L]+query(L-1, L);
a[L+1]=a[L]+query(L, L+1);
if (R<n) a[R+1]=a[R]-query(R, R+1);
for (ll i=L-2; i>=1; i--)
a[i]=calc(a[i+1], a[i+2], query(i, i+1), query(i, i+2));
for (ll i=L+2; i<R; i++)
a[i]=calc(a[i-1], a[i-2], query(i-1, i), query(i-2, i));
for (ll i=R+2; i<=n; i++)
a[i]=calc(a[i-1], a[i-2], query(i-1, i), query(i-2, i));
// for (ll i=1; i<=n; i++)
// cout << a[i] << " ";
// cout << "\n";
for (ll i=1; i<=n; i++)
answer(i, a[i]);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
2 ms |
208 KB |
Output is correct |
| 5 |
Correct |
2 ms |
208 KB |
Output is correct |
| 6 |
Correct |
2 ms |
208 KB |
Output is correct |
| 7 |
Correct |
2 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
2 ms |
208 KB |
Output is correct |
| 10 |
Correct |
2 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
208 KB |
Output is correct |
| 12 |
Correct |
2 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
208 KB |
Output is correct |
| 15 |
Correct |
2 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
2 ms |
208 KB |
Output is correct |
| 5 |
Correct |
2 ms |
208 KB |
Output is correct |
| 6 |
Correct |
2 ms |
208 KB |
Output is correct |
| 7 |
Correct |
2 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
2 ms |
208 KB |
Output is correct |
| 10 |
Correct |
2 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
208 KB |
Output is correct |
| 12 |
Correct |
2 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
208 KB |
Output is correct |
| 15 |
Correct |
2 ms |
208 KB |
Output is correct |
| 16 |
Correct |
4 ms |
292 KB |
Output is correct |
| 17 |
Correct |
8 ms |
208 KB |
Output is correct |
| 18 |
Correct |
13 ms |
288 KB |
Output is correct |
| 19 |
Correct |
16 ms |
292 KB |
Output is correct |
| 20 |
Correct |
11 ms |
208 KB |
Output is correct |
| 21 |
Correct |
15 ms |
312 KB |
Output is correct |
| 22 |
Correct |
19 ms |
292 KB |
Output is correct |
| 23 |
Correct |
18 ms |
288 KB |
Output is correct |
| 24 |
Correct |
12 ms |
312 KB |
Output is correct |
| 25 |
Correct |
14 ms |
308 KB |
Output is correct |
| 26 |
Correct |
16 ms |
208 KB |
Output is correct |
| 27 |
Correct |
16 ms |
208 KB |
Output is correct |
| 28 |
Correct |
15 ms |
288 KB |
Output is correct |
| 29 |
Correct |
14 ms |
208 KB |
Output is correct |
| 30 |
Correct |
16 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
208 KB |
Output is correct |
| 2 |
Correct |
1 ms |
208 KB |
Output is correct |
| 3 |
Correct |
1 ms |
208 KB |
Output is correct |
| 4 |
Correct |
2 ms |
208 KB |
Output is correct |
| 5 |
Correct |
2 ms |
208 KB |
Output is correct |
| 6 |
Correct |
2 ms |
208 KB |
Output is correct |
| 7 |
Correct |
2 ms |
208 KB |
Output is correct |
| 8 |
Correct |
1 ms |
208 KB |
Output is correct |
| 9 |
Correct |
2 ms |
208 KB |
Output is correct |
| 10 |
Correct |
2 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
208 KB |
Output is correct |
| 12 |
Correct |
2 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
1 ms |
208 KB |
Output is correct |
| 15 |
Correct |
2 ms |
208 KB |
Output is correct |
| 16 |
Correct |
4 ms |
292 KB |
Output is correct |
| 17 |
Correct |
8 ms |
208 KB |
Output is correct |
| 18 |
Correct |
13 ms |
288 KB |
Output is correct |
| 19 |
Correct |
16 ms |
292 KB |
Output is correct |
| 20 |
Correct |
11 ms |
208 KB |
Output is correct |
| 21 |
Correct |
15 ms |
312 KB |
Output is correct |
| 22 |
Correct |
19 ms |
292 KB |
Output is correct |
| 23 |
Correct |
18 ms |
288 KB |
Output is correct |
| 24 |
Correct |
12 ms |
312 KB |
Output is correct |
| 25 |
Correct |
14 ms |
308 KB |
Output is correct |
| 26 |
Correct |
16 ms |
208 KB |
Output is correct |
| 27 |
Correct |
16 ms |
208 KB |
Output is correct |
| 28 |
Correct |
15 ms |
288 KB |
Output is correct |
| 29 |
Correct |
14 ms |
208 KB |
Output is correct |
| 30 |
Correct |
16 ms |
208 KB |
Output is correct |
| 31 |
Correct |
42 ms |
300 KB |
Output is correct |
| 32 |
Correct |
39 ms |
300 KB |
Output is correct |
| 33 |
Correct |
77 ms |
308 KB |
Output is correct |
| 34 |
Incorrect |
92 ms |
292 KB |
Wrong Answer [2] |
| 35 |
Halted |
0 ms |
0 KB |
- |
