#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
int A[N+1];
//bs for 1
int s=1, e=N-1;
while(s!=e){
int mid = (s+e+1)/2;
if(query(mid, N) != N-1){
e = mid-1;
}
else{
s = mid;
}
}
A[s] = 1;
unordered_set<int> aset;
aset.insert(1);
if(s-1 != 0){
A[s-1] = query(s-1, s)+1;
aset.insert(A[s-1]);
}
for(int i=s-2; i>0; i--){ // go to the left
int temp1 = query(i, i+1);
if(A[i+1] - temp1 < 2 || aset.count(A[i+1] - temp1)){ // not possible to be less
A[i] = A[i+1] + temp1;
}
else if(A[i+1] + temp1 > N || aset.count(A[i+1] + temp1)){ // not possible to be more
A[i] = A[i+1] - temp1;
}
else{ // can be both
int temp2 = query(i, i+2);
if(temp1 == temp2){ // A[i+2] is inbetween A[i+1] and A[i]
if(A[i+2] > A[i+1]){
A[i] = A[i+1] + temp1;
}
else{
A[i] = A[i+1] - temp1;
}
}
else{ // A[i+2] is outside of the range of A[i+1] and A[i]
if(A[i+2] > A[i+1]){
if(temp2 == A[i+2] - A[i+1]){ // A[i] is inbetween A[i+2] and A[i+1]
A[i] = A[i+1] + temp1;
}
else{
A[i] = A[i+1] - temp1;
}
}
else{
if(temp2 == A[i+1] - A[i+2]){ // A[i] is inbetween A[i+2] and A[i+1]
A[i] = A[i+1] - temp1;
}
else{
A[i] = A[i+1] + temp1;
}
}
}
}
aset.insert(A[i]);
}
A[s+1] = query(s, s+1)+1;
aset.insert(A[s+1]);
for(int i=s+2; i<=N; i++){ // go to the right
int temp1 = query(i-1, i);
if(A[i-1] - temp1 < 2 || aset.count(A[i-1] - temp1)){ // not possible to be less
A[i] = A[i-1] + temp1;
}
else if(A[i-1] + temp1 > N || aset.count(A[i-1] + temp1)){ // not possible to be more
A[i] = A[i-1] - temp1;
}
else{ // can be both
int temp2 = query(i-2, i);
if(temp1 == temp2){ // A[i-2] is inbetween A[i-1] and A[i]
if(A[i-2] > A[i-1]){
A[i] = A[i-1] + temp1;
}
else{
A[i] = A[i-1] - temp1;
}
}
else{ // A[i-2] is outside of the range of A[i-1] and A[i]
if(A[i-2] > A[i-1]){
if(temp2 == A[i-2] - A[i-1]){ // A[i] is inbetween A[i-2] and A[i-1]
A[i] = A[i-1] + temp1;
}
else{
A[i] = A[i-1] - temp1;
}
}
else{
if(temp2 == A[i-1] - A[i-2]){ // A[i] is inbetween A[i-2] and A[i-1]
A[i] = A[i-1] - temp1;
}
else{
A[i] = A[i-1] + temp1;
}
}
}
}
aset.insert(A[i]);
}
for(int i = 1; i <= N; i++) {
answer(i, A[i]);
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 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 |
1 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 |
432 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
2 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
296 KB |
Output is correct |
| 12 |
Correct |
2 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
2 ms |
292 KB |
Output is correct |
| 15 |
Correct |
2 ms |
208 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 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 |
1 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 |
432 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
2 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
296 KB |
Output is correct |
| 12 |
Correct |
2 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
2 ms |
292 KB |
Output is correct |
| 15 |
Correct |
2 ms |
208 KB |
Output is correct |
| 16 |
Correct |
4 ms |
312 KB |
Output is correct |
| 17 |
Correct |
7 ms |
208 KB |
Output is correct |
| 18 |
Correct |
11 ms |
324 KB |
Output is correct |
| 19 |
Correct |
10 ms |
316 KB |
Output is correct |
| 20 |
Correct |
13 ms |
312 KB |
Output is correct |
| 21 |
Correct |
15 ms |
208 KB |
Output is correct |
| 22 |
Correct |
17 ms |
308 KB |
Output is correct |
| 23 |
Correct |
15 ms |
320 KB |
Output is correct |
| 24 |
Correct |
9 ms |
336 KB |
Output is correct |
| 25 |
Correct |
9 ms |
328 KB |
Output is correct |
| 26 |
Correct |
10 ms |
304 KB |
Output is correct |
| 27 |
Correct |
13 ms |
328 KB |
Output is correct |
| 28 |
Correct |
13 ms |
208 KB |
Output is correct |
| 29 |
Correct |
13 ms |
312 KB |
Output is correct |
| 30 |
Correct |
13 ms |
336 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Output is correct |
| 2 |
Correct |
0 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 |
1 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 |
432 KB |
Output is correct |
| 9 |
Correct |
1 ms |
208 KB |
Output is correct |
| 10 |
Correct |
2 ms |
208 KB |
Output is correct |
| 11 |
Correct |
2 ms |
296 KB |
Output is correct |
| 12 |
Correct |
2 ms |
208 KB |
Output is correct |
| 13 |
Correct |
2 ms |
208 KB |
Output is correct |
| 14 |
Correct |
2 ms |
292 KB |
Output is correct |
| 15 |
Correct |
2 ms |
208 KB |
Output is correct |
| 16 |
Correct |
4 ms |
312 KB |
Output is correct |
| 17 |
Correct |
7 ms |
208 KB |
Output is correct |
| 18 |
Correct |
11 ms |
324 KB |
Output is correct |
| 19 |
Correct |
10 ms |
316 KB |
Output is correct |
| 20 |
Correct |
13 ms |
312 KB |
Output is correct |
| 21 |
Correct |
15 ms |
208 KB |
Output is correct |
| 22 |
Correct |
17 ms |
308 KB |
Output is correct |
| 23 |
Correct |
15 ms |
320 KB |
Output is correct |
| 24 |
Correct |
9 ms |
336 KB |
Output is correct |
| 25 |
Correct |
9 ms |
328 KB |
Output is correct |
| 26 |
Correct |
10 ms |
304 KB |
Output is correct |
| 27 |
Correct |
13 ms |
328 KB |
Output is correct |
| 28 |
Correct |
13 ms |
208 KB |
Output is correct |
| 29 |
Correct |
13 ms |
312 KB |
Output is correct |
| 30 |
Correct |
13 ms |
336 KB |
Output is correct |
| 31 |
Correct |
20 ms |
320 KB |
Output is correct |
| 32 |
Correct |
58 ms |
340 KB |
Output is correct |
| 33 |
Correct |
52 ms |
468 KB |
Output is correct |
| 34 |
Correct |
45 ms |
440 KB |
Output is correct |
| 35 |
Correct |
54 ms |
488 KB |
Output is correct |
| 36 |
Correct |
48 ms |
476 KB |
Output is correct |
| 37 |
Correct |
24 ms |
448 KB |
Output is correct |
| 38 |
Correct |
51 ms |
488 KB |
Output is correct |
| 39 |
Correct |
42 ms |
488 KB |
Output is correct |
| 40 |
Correct |
55 ms |
464 KB |
Output is correct |
| 41 |
Correct |
61 ms |
428 KB |
Output is correct |
| 42 |
Correct |
43 ms |
476 KB |
Output is correct |
| 43 |
Correct |
30 ms |
520 KB |
Output is correct |
| 44 |
Correct |
47 ms |
448 KB |
Output is correct |
| 45 |
Correct |
64 ms |
492 KB |
Output is correct |
| 46 |
Correct |
70 ms |
456 KB |
Output is correct |
| 47 |
Correct |
62 ms |
440 KB |
Output is correct |
| 48 |
Correct |
40 ms |
500 KB |
Output is correct |
| 49 |
Correct |
67 ms |
488 KB |
Output is correct |
| 50 |
Correct |
66 ms |
484 KB |
Output is correct |
| 51 |
Correct |
63 ms |
492 KB |
Output is correct |
| 52 |
Correct |
66 ms |
472 KB |
Output is correct |
| 53 |
Correct |
59 ms |
452 KB |
Output is correct |
| 54 |
Correct |
55 ms |
472 KB |
Output is correct |
| 55 |
Correct |
58 ms |
668 KB |
Output is correct |
| 56 |
Correct |
66 ms |
460 KB |
Output is correct |
| 57 |
Correct |
54 ms |
456 KB |
Output is correct |
| 58 |
Correct |
56 ms |
460 KB |
Output is correct |
| 59 |
Correct |
70 ms |
492 KB |
Output is correct |
| 60 |
Correct |
52 ms |
444 KB |
Output is correct |
