#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
void solve(int n) {
vector<int> a(n), d(n);
for (int i = 0; i < n - 1; ++i) {
d[i] = query(i + 1, i + 2);
}
int sgn = 1;
a[0] = 0;
a[1] = d[0];
for (int i = 1; i < n - 1; ++i) {
if (query(i, i + 2) != d[i - 1] + d[i]) {
sgn = -sgn;
}
a[i + 1] = a[i] + sgn * d[i];
}
int posMin = 0, posMax = 0;
for (int i = 1; i < n; ++i) {
if (a[i] < a[posMin]) {
posMin = i;
}
if (a[posMax] < a[i]) {
posMax = i;
}
}
if (posMax < posMin) {
for (int i = 1; i < n; ++i) {
a[i] = -a[i];
}
swap(posMin, posMax);
}
for (int i = 0; i < n; ++i) {
answer(i + 1, a[i] - a[posMin] + 1);
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
288 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
292 KB |
Output is correct |
4 |
Correct |
3 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 |
4 ms |
208 KB |
Output is correct |
8 |
Correct |
3 ms |
208 KB |
Output is correct |
9 |
Correct |
3 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 |
2 ms |
208 KB |
Output is correct |
15 |
Correct |
2 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
288 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
292 KB |
Output is correct |
4 |
Correct |
3 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 |
4 ms |
208 KB |
Output is correct |
8 |
Correct |
3 ms |
208 KB |
Output is correct |
9 |
Correct |
3 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 |
2 ms |
208 KB |
Output is correct |
15 |
Correct |
2 ms |
208 KB |
Output is correct |
16 |
Correct |
4 ms |
284 KB |
Output is correct |
17 |
Correct |
12 ms |
208 KB |
Output is correct |
18 |
Correct |
14 ms |
208 KB |
Output is correct |
19 |
Correct |
12 ms |
208 KB |
Output is correct |
20 |
Correct |
10 ms |
308 KB |
Output is correct |
21 |
Correct |
14 ms |
208 KB |
Output is correct |
22 |
Correct |
14 ms |
308 KB |
Output is correct |
23 |
Correct |
17 ms |
284 KB |
Output is correct |
24 |
Correct |
15 ms |
208 KB |
Output is correct |
25 |
Correct |
22 ms |
292 KB |
Output is correct |
26 |
Correct |
20 ms |
208 KB |
Output is correct |
27 |
Correct |
9 ms |
308 KB |
Output is correct |
28 |
Correct |
17 ms |
300 KB |
Output is correct |
29 |
Correct |
15 ms |
208 KB |
Output is correct |
30 |
Correct |
16 ms |
208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
288 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
292 KB |
Output is correct |
4 |
Correct |
3 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 |
4 ms |
208 KB |
Output is correct |
8 |
Correct |
3 ms |
208 KB |
Output is correct |
9 |
Correct |
3 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 |
2 ms |
208 KB |
Output is correct |
15 |
Correct |
2 ms |
208 KB |
Output is correct |
16 |
Correct |
4 ms |
284 KB |
Output is correct |
17 |
Correct |
12 ms |
208 KB |
Output is correct |
18 |
Correct |
14 ms |
208 KB |
Output is correct |
19 |
Correct |
12 ms |
208 KB |
Output is correct |
20 |
Correct |
10 ms |
308 KB |
Output is correct |
21 |
Correct |
14 ms |
208 KB |
Output is correct |
22 |
Correct |
14 ms |
308 KB |
Output is correct |
23 |
Correct |
17 ms |
284 KB |
Output is correct |
24 |
Correct |
15 ms |
208 KB |
Output is correct |
25 |
Correct |
22 ms |
292 KB |
Output is correct |
26 |
Correct |
20 ms |
208 KB |
Output is correct |
27 |
Correct |
9 ms |
308 KB |
Output is correct |
28 |
Correct |
17 ms |
300 KB |
Output is correct |
29 |
Correct |
15 ms |
208 KB |
Output is correct |
30 |
Correct |
16 ms |
208 KB |
Output is correct |
31 |
Correct |
38 ms |
292 KB |
Output is correct |
32 |
Correct |
49 ms |
320 KB |
Output is correct |
33 |
Correct |
86 ms |
312 KB |
Output is correct |
34 |
Correct |
66 ms |
328 KB |
Output is correct |
35 |
Correct |
83 ms |
336 KB |
Output is correct |
36 |
Correct |
99 ms |
336 KB |
Output is correct |
37 |
Correct |
65 ms |
336 KB |
Output is correct |
38 |
Correct |
74 ms |
336 KB |
Output is correct |
39 |
Correct |
78 ms |
316 KB |
Output is correct |
40 |
Correct |
57 ms |
316 KB |
Output is correct |
41 |
Correct |
51 ms |
316 KB |
Output is correct |
42 |
Correct |
63 ms |
336 KB |
Output is correct |
43 |
Correct |
73 ms |
336 KB |
Output is correct |
44 |
Correct |
81 ms |
316 KB |
Output is correct |
45 |
Correct |
69 ms |
336 KB |
Output is correct |
46 |
Correct |
84 ms |
336 KB |
Output is correct |
47 |
Correct |
76 ms |
316 KB |
Output is correct |
48 |
Correct |
63 ms |
336 KB |
Output is correct |
49 |
Correct |
81 ms |
336 KB |
Output is correct |
50 |
Correct |
84 ms |
336 KB |
Output is correct |
51 |
Correct |
88 ms |
336 KB |
Output is correct |
52 |
Correct |
95 ms |
336 KB |
Output is correct |
53 |
Correct |
80 ms |
336 KB |
Output is correct |
54 |
Correct |
86 ms |
324 KB |
Output is correct |
55 |
Correct |
89 ms |
336 KB |
Output is correct |
56 |
Correct |
79 ms |
316 KB |
Output is correct |
57 |
Correct |
56 ms |
336 KB |
Output is correct |
58 |
Correct |
70 ms |
336 KB |
Output is correct |
59 |
Correct |
95 ms |
316 KB |
Output is correct |
60 |
Correct |
73 ms |
316 KB |
Output is correct |