#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
static int A[5005];
int dif[5005];
void solve(int N) {
for(int i=2; i<=N; i++) dif[i]=query(i-1,i);
int sgn = -1;
int mn = 0;
for(int i=2; i<=N; i++) {
int tes = 0;
if(i>2) tes = query(i-2, i);
if (tes != dif[i] + dif[i-1]) sgn *= -1;
A[i] = A[i-1] + sgn*dif[i];
mn = min(mn, A[i]);
}
int p1 = 0, pn = 0;
for(int i=1; i<=N; i++) {
A[i] -= (mn-1);
if(A[i]==1) p1=i;
if(A[i]==N) pn=i;
}
if (pn < p1)
for (int i=1; i<=N; i++) A[i] = N+1-A[i];
for(int i = 1; i <= N; i++) {
answer(i, A[i]);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
308 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 |
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 |
2 ms |
208 KB |
Output is correct |
9 |
Correct |
2 ms |
208 KB |
Output is correct |
10 |
Correct |
2 ms |
308 KB |
Output is correct |
11 |
Correct |
2 ms |
208 KB |
Output is correct |
12 |
Correct |
2 ms |
208 KB |
Output is correct |
13 |
Correct |
1 ms |
208 KB |
Output is correct |
14 |
Correct |
2 ms |
208 KB |
Output is correct |
15 |
Correct |
2 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
308 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 |
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 |
2 ms |
208 KB |
Output is correct |
9 |
Correct |
2 ms |
208 KB |
Output is correct |
10 |
Correct |
2 ms |
308 KB |
Output is correct |
11 |
Correct |
2 ms |
208 KB |
Output is correct |
12 |
Correct |
2 ms |
208 KB |
Output is correct |
13 |
Correct |
1 ms |
208 KB |
Output is correct |
14 |
Correct |
2 ms |
208 KB |
Output is correct |
15 |
Correct |
2 ms |
208 KB |
Output is correct |
16 |
Correct |
4 ms |
208 KB |
Output is correct |
17 |
Correct |
10 ms |
208 KB |
Output is correct |
18 |
Correct |
11 ms |
308 KB |
Output is correct |
19 |
Correct |
15 ms |
208 KB |
Output is correct |
20 |
Correct |
17 ms |
300 KB |
Output is correct |
21 |
Correct |
19 ms |
304 KB |
Output is correct |
22 |
Correct |
13 ms |
312 KB |
Output is correct |
23 |
Correct |
13 ms |
296 KB |
Output is correct |
24 |
Correct |
15 ms |
304 KB |
Output is correct |
25 |
Correct |
13 ms |
308 KB |
Output is correct |
26 |
Correct |
14 ms |
312 KB |
Output is correct |
27 |
Correct |
13 ms |
288 KB |
Output is correct |
28 |
Correct |
14 ms |
304 KB |
Output is correct |
29 |
Correct |
15 ms |
336 KB |
Output is correct |
30 |
Correct |
18 ms |
308 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
308 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 |
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 |
2 ms |
208 KB |
Output is correct |
9 |
Correct |
2 ms |
208 KB |
Output is correct |
10 |
Correct |
2 ms |
308 KB |
Output is correct |
11 |
Correct |
2 ms |
208 KB |
Output is correct |
12 |
Correct |
2 ms |
208 KB |
Output is correct |
13 |
Correct |
1 ms |
208 KB |
Output is correct |
14 |
Correct |
2 ms |
208 KB |
Output is correct |
15 |
Correct |
2 ms |
208 KB |
Output is correct |
16 |
Correct |
4 ms |
208 KB |
Output is correct |
17 |
Correct |
10 ms |
208 KB |
Output is correct |
18 |
Correct |
11 ms |
308 KB |
Output is correct |
19 |
Correct |
15 ms |
208 KB |
Output is correct |
20 |
Correct |
17 ms |
300 KB |
Output is correct |
21 |
Correct |
19 ms |
304 KB |
Output is correct |
22 |
Correct |
13 ms |
312 KB |
Output is correct |
23 |
Correct |
13 ms |
296 KB |
Output is correct |
24 |
Correct |
15 ms |
304 KB |
Output is correct |
25 |
Correct |
13 ms |
308 KB |
Output is correct |
26 |
Correct |
14 ms |
312 KB |
Output is correct |
27 |
Correct |
13 ms |
288 KB |
Output is correct |
28 |
Correct |
14 ms |
304 KB |
Output is correct |
29 |
Correct |
15 ms |
336 KB |
Output is correct |
30 |
Correct |
18 ms |
308 KB |
Output is correct |
31 |
Correct |
30 ms |
292 KB |
Output is correct |
32 |
Correct |
47 ms |
304 KB |
Output is correct |
33 |
Correct |
107 ms |
320 KB |
Output is correct |
34 |
Correct |
56 ms |
464 KB |
Output is correct |
35 |
Correct |
77 ms |
328 KB |
Output is correct |
36 |
Correct |
86 ms |
328 KB |
Output is correct |
37 |
Correct |
84 ms |
404 KB |
Output is correct |
38 |
Correct |
83 ms |
412 KB |
Output is correct |
39 |
Correct |
103 ms |
328 KB |
Output is correct |
40 |
Correct |
74 ms |
304 KB |
Output is correct |
41 |
Correct |
81 ms |
320 KB |
Output is correct |
42 |
Correct |
75 ms |
304 KB |
Output is correct |
43 |
Correct |
82 ms |
320 KB |
Output is correct |
44 |
Correct |
73 ms |
416 KB |
Output is correct |
45 |
Correct |
91 ms |
364 KB |
Output is correct |
46 |
Correct |
92 ms |
304 KB |
Output is correct |
47 |
Correct |
78 ms |
292 KB |
Output is correct |
48 |
Correct |
78 ms |
544 KB |
Output is correct |
49 |
Correct |
89 ms |
312 KB |
Output is correct |
50 |
Correct |
80 ms |
320 KB |
Output is correct |
51 |
Correct |
98 ms |
436 KB |
Output is correct |
52 |
Correct |
70 ms |
296 KB |
Output is correct |
53 |
Correct |
94 ms |
328 KB |
Output is correct |
54 |
Correct |
76 ms |
304 KB |
Output is correct |
55 |
Correct |
69 ms |
328 KB |
Output is correct |
56 |
Correct |
94 ms |
304 KB |
Output is correct |
57 |
Correct |
64 ms |
300 KB |
Output is correct |
58 |
Correct |
76 ms |
540 KB |
Output is correct |
59 |
Correct |
88 ms |
320 KB |
Output is correct |
60 |
Correct |
85 ms |
304 KB |
Output is correct |