#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
void solve(int N) {
int a[N+1];
memset(a, 0, sizeof(a));
// binary search pos of 1
int lower = 1, upper = N;
while(upper-lower>1){
int mid = (upper+lower)/2;
int x = query(mid, N);
if(x==N-1) lower = mid;
else upper = mid;
}
int pos1 = lower;
a[pos1] = 1;
if(pos1<N){
// go to right
int prev = query(pos1, pos1+1);
a[pos1+1] = 1 + prev;
for (int i=pos1+1; i<N; i++){
int next = query(i, i+1);
if(a[i]+next>N) a[i+1] = a[i]-next;
else if(a[i]-next<1) a[i+1] = a[i]+next;
else{
int cur = query(i-1, i+1);
if(cur==prev+next){
if(a[i]>a[i-1]) a[i+1] = a[i]+next;
else a[i+1] = a[i]-next;
}
else{
if(a[i]>a[i-1]) a[i+1] = a[i]-next;
else a[i+1] = a[i]+next;
}
}
prev = next;
}
}
if(pos1>1){
// go to left
int prev = query(pos1-1, pos1);
a[pos1-1] = 1 + prev;
for (int i=pos1-1; i>1; i--){
int next = query(i-1, i);
if(a[i]+next>N) a[i-1] = a[i]-next;
else if(a[i]-next<1) a[i-1] = a[i]+next;
else{
int cur = query(i-1, i+1);
if(cur==prev+next){
if(a[i]>a[i+1]) a[i-1] = a[i]+next;
else a[i-1] = a[i]-next;
}
else{
if(a[i]>a[i+1]) a[i-1] = a[i]-next;
else a[i-1] = a[i]+next;
}
}
prev = next;
}
}
for (int i=1; i<=N; i++) answer(i, a[i]);
return;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
3 ms |
344 KB |
Output is correct |
| 17 |
Correct |
4 ms |
344 KB |
Output is correct |
| 18 |
Correct |
6 ms |
344 KB |
Output is correct |
| 19 |
Correct |
7 ms |
436 KB |
Output is correct |
| 20 |
Correct |
10 ms |
440 KB |
Output is correct |
| 21 |
Correct |
9 ms |
600 KB |
Output is correct |
| 22 |
Correct |
8 ms |
344 KB |
Output is correct |
| 23 |
Correct |
7 ms |
344 KB |
Output is correct |
| 24 |
Correct |
6 ms |
344 KB |
Output is correct |
| 25 |
Correct |
9 ms |
344 KB |
Output is correct |
| 26 |
Correct |
9 ms |
436 KB |
Output is correct |
| 27 |
Correct |
8 ms |
344 KB |
Output is correct |
| 28 |
Correct |
8 ms |
436 KB |
Output is correct |
| 29 |
Correct |
8 ms |
436 KB |
Output is correct |
| 30 |
Correct |
7 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
1 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
1 ms |
344 KB |
Output is correct |
| 9 |
Correct |
1 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
3 ms |
344 KB |
Output is correct |
| 17 |
Correct |
4 ms |
344 KB |
Output is correct |
| 18 |
Correct |
6 ms |
344 KB |
Output is correct |
| 19 |
Correct |
7 ms |
436 KB |
Output is correct |
| 20 |
Correct |
10 ms |
440 KB |
Output is correct |
| 21 |
Correct |
9 ms |
600 KB |
Output is correct |
| 22 |
Correct |
8 ms |
344 KB |
Output is correct |
| 23 |
Correct |
7 ms |
344 KB |
Output is correct |
| 24 |
Correct |
6 ms |
344 KB |
Output is correct |
| 25 |
Correct |
9 ms |
344 KB |
Output is correct |
| 26 |
Correct |
9 ms |
436 KB |
Output is correct |
| 27 |
Correct |
8 ms |
344 KB |
Output is correct |
| 28 |
Correct |
8 ms |
436 KB |
Output is correct |
| 29 |
Correct |
8 ms |
436 KB |
Output is correct |
| 30 |
Correct |
7 ms |
344 KB |
Output is correct |
| 31 |
Correct |
22 ms |
416 KB |
Output is correct |
| 32 |
Correct |
24 ms |
424 KB |
Output is correct |
| 33 |
Correct |
28 ms |
344 KB |
Output is correct |
| 34 |
Correct |
31 ms |
344 KB |
Output is correct |
| 35 |
Correct |
36 ms |
340 KB |
Output is correct |
| 36 |
Incorrect |
51 ms |
344 KB |
Wrong Answer [2] |
| 37 |
Halted |
0 ms |
0 KB |
- |
