#include "xylophone.h"
#include <cstdio>
using namespace std;
static int a[5005];
void solve(int n) {
int l = 1,r = n;
while(r - l > 1){
int mid = (l + r) / 2;
if(query(1,mid) == n - 1){
r = mid;
}
else{
l = mid;
}
}
int pos_n = r;
a[pos_n] = n;
for(int i = pos_n + 1;i <= n;i++){
int delta = query(i - 1,i);
if(a[i - 1] + delta > n){
a[i] = a[i - 1] - delta;
}
else if(a[i - 1] - delta < 1){
a[i] = a[i - 1] + delta;
}
else{
int delta2 = query(i - 2,i);
if(delta2 == delta){
a[i] = (a[i - 1] <= a[i - 2] ? delta:-delta) + a[i - 1];
}
else{
if(a[i - 1] + delta == a[i - 2] + delta2 || a[i - 1] + delta == a[i - 2] - delta2){
a[i] = a[i - 1] + delta;
}
else if(a[i - 1] - delta == a[i - 2] + delta2 || a[i - 1] - delta == a[i - 2] -delta2){
a[i] = a[i - 1] - delta;
}
else{
a[i] = a[i - 1] + (a[i - 1] < a[i - 2] ? delta:-delta);
}
}
}
}
for(int i = pos_n - 1;i;i--){
int delta = query(i,i + 1);
if(a[i + 1] + delta > n){
a[i] = a[i + 1] - delta;
}
else if(a[i + 1] - delta < 1){
a[i] = a[i + 1] + delta;
}
else{
int delta2 = query(i,i + 2);
if(delta2 == delta){
a[i] = (a[i + 1] <= a[i + 2] ? delta:-delta) + a[i + 1];
}
else{
if(a[i + 1] + delta == a[i + 2] + delta2 || a[i + 1] + delta == a[i + 2] - delta2){
a[i] = a[i + 1] + delta;
}
else if(a[i + 1] - delta == a[i + 2] + delta2 || a[i + 1] - delta == a[i + 2] -delta2){
a[i] = a[i + 1] - delta;
}
else{
a[i] = a[i + 1] + (a[i + 1] < a[i + 2] ? delta:-delta);
}
}
}
}
for(int i = 1;i <= n;i++){
answer(i,a[i]);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
7 |
Correct |
3 ms |
248 KB |
Output is correct |
8 |
Correct |
3 ms |
376 KB |
Output is correct |
9 |
Correct |
3 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
248 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
3 ms |
248 KB |
Output is correct |
13 |
Correct |
4 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
248 KB |
Output is correct |
15 |
Correct |
3 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
7 |
Correct |
3 ms |
248 KB |
Output is correct |
8 |
Correct |
3 ms |
376 KB |
Output is correct |
9 |
Correct |
3 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
248 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
3 ms |
248 KB |
Output is correct |
13 |
Correct |
4 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
248 KB |
Output is correct |
15 |
Correct |
3 ms |
376 KB |
Output is correct |
16 |
Correct |
6 ms |
376 KB |
Output is correct |
17 |
Correct |
10 ms |
376 KB |
Output is correct |
18 |
Correct |
18 ms |
248 KB |
Output is correct |
19 |
Correct |
20 ms |
376 KB |
Output is correct |
20 |
Correct |
23 ms |
376 KB |
Output is correct |
21 |
Correct |
11 ms |
304 KB |
Output is correct |
22 |
Correct |
20 ms |
252 KB |
Output is correct |
23 |
Correct |
22 ms |
376 KB |
Output is correct |
24 |
Correct |
21 ms |
376 KB |
Output is correct |
25 |
Correct |
15 ms |
376 KB |
Output is correct |
26 |
Correct |
24 ms |
248 KB |
Output is correct |
27 |
Correct |
23 ms |
248 KB |
Output is correct |
28 |
Correct |
21 ms |
376 KB |
Output is correct |
29 |
Correct |
22 ms |
376 KB |
Output is correct |
30 |
Correct |
10 ms |
304 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
376 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
3 ms |
376 KB |
Output is correct |
7 |
Correct |
3 ms |
248 KB |
Output is correct |
8 |
Correct |
3 ms |
376 KB |
Output is correct |
9 |
Correct |
3 ms |
376 KB |
Output is correct |
10 |
Correct |
3 ms |
248 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
3 ms |
248 KB |
Output is correct |
13 |
Correct |
4 ms |
504 KB |
Output is correct |
14 |
Correct |
3 ms |
248 KB |
Output is correct |
15 |
Correct |
3 ms |
376 KB |
Output is correct |
16 |
Correct |
6 ms |
376 KB |
Output is correct |
17 |
Correct |
10 ms |
376 KB |
Output is correct |
18 |
Correct |
18 ms |
248 KB |
Output is correct |
19 |
Correct |
20 ms |
376 KB |
Output is correct |
20 |
Correct |
23 ms |
376 KB |
Output is correct |
21 |
Correct |
11 ms |
304 KB |
Output is correct |
22 |
Correct |
20 ms |
252 KB |
Output is correct |
23 |
Correct |
22 ms |
376 KB |
Output is correct |
24 |
Correct |
21 ms |
376 KB |
Output is correct |
25 |
Correct |
15 ms |
376 KB |
Output is correct |
26 |
Correct |
24 ms |
248 KB |
Output is correct |
27 |
Correct |
23 ms |
248 KB |
Output is correct |
28 |
Correct |
21 ms |
376 KB |
Output is correct |
29 |
Correct |
22 ms |
376 KB |
Output is correct |
30 |
Correct |
10 ms |
304 KB |
Output is correct |
31 |
Correct |
32 ms |
376 KB |
Output is correct |
32 |
Correct |
52 ms |
392 KB |
Output is correct |
33 |
Correct |
79 ms |
308 KB |
Output is correct |
34 |
Correct |
99 ms |
380 KB |
Output is correct |
35 |
Correct |
44 ms |
304 KB |
Output is correct |
36 |
Incorrect |
80 ms |
404 KB |
Wrong Answer [2] |
37 |
Halted |
0 ms |
0 KB |
- |