#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
static int a[N];
void solve(int n){
a[2] = query(1, 2);
for(int i = 3, x, y; i <= n; i++){
x = query(i - 2, i);
y = query(i - 1, i);
if((x == y + abs(a[i - 2] - a[i - 1])) ^ (a[i - 2] > a[i - 1]))
a[i] = a[i - 1] + y;
else a[i] = a[i - 1] - y;
}
if(min_element(a + 1, a + n + 1) > max_element(a + 1, a + n + 1))
for(int i = 1; i <= n; i++) a[i] *= -1;
int m = *min_element(a + 1, a + n + 1);
for(int i = 1; i <= n; i++) answer(i, a[i] - m + 1);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
452 KB |
Output is correct |
3 |
Correct |
2 ms |
532 KB |
Output is correct |
4 |
Correct |
3 ms |
532 KB |
Output is correct |
5 |
Correct |
3 ms |
532 KB |
Output is correct |
6 |
Correct |
3 ms |
532 KB |
Output is correct |
7 |
Correct |
3 ms |
532 KB |
Output is correct |
8 |
Correct |
3 ms |
532 KB |
Output is correct |
9 |
Correct |
3 ms |
532 KB |
Output is correct |
10 |
Correct |
3 ms |
532 KB |
Output is correct |
11 |
Correct |
4 ms |
532 KB |
Output is correct |
12 |
Correct |
3 ms |
532 KB |
Output is correct |
13 |
Correct |
3 ms |
544 KB |
Output is correct |
14 |
Correct |
3 ms |
544 KB |
Output is correct |
15 |
Correct |
3 ms |
544 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
452 KB |
Output is correct |
3 |
Correct |
2 ms |
532 KB |
Output is correct |
4 |
Correct |
3 ms |
532 KB |
Output is correct |
5 |
Correct |
3 ms |
532 KB |
Output is correct |
6 |
Correct |
3 ms |
532 KB |
Output is correct |
7 |
Correct |
3 ms |
532 KB |
Output is correct |
8 |
Correct |
3 ms |
532 KB |
Output is correct |
9 |
Correct |
3 ms |
532 KB |
Output is correct |
10 |
Correct |
3 ms |
532 KB |
Output is correct |
11 |
Correct |
4 ms |
532 KB |
Output is correct |
12 |
Correct |
3 ms |
532 KB |
Output is correct |
13 |
Correct |
3 ms |
544 KB |
Output is correct |
14 |
Correct |
3 ms |
544 KB |
Output is correct |
15 |
Correct |
3 ms |
544 KB |
Output is correct |
16 |
Correct |
5 ms |
544 KB |
Output is correct |
17 |
Correct |
9 ms |
560 KB |
Output is correct |
18 |
Correct |
8 ms |
688 KB |
Output is correct |
19 |
Correct |
11 ms |
688 KB |
Output is correct |
20 |
Correct |
18 ms |
688 KB |
Output is correct |
21 |
Correct |
20 ms |
688 KB |
Output is correct |
22 |
Correct |
11 ms |
688 KB |
Output is correct |
23 |
Correct |
20 ms |
688 KB |
Output is correct |
24 |
Correct |
10 ms |
688 KB |
Output is correct |
25 |
Correct |
16 ms |
688 KB |
Output is correct |
26 |
Correct |
11 ms |
688 KB |
Output is correct |
27 |
Correct |
17 ms |
688 KB |
Output is correct |
28 |
Correct |
18 ms |
688 KB |
Output is correct |
29 |
Correct |
16 ms |
688 KB |
Output is correct |
30 |
Correct |
18 ms |
688 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
248 KB |
Output is correct |
2 |
Correct |
2 ms |
452 KB |
Output is correct |
3 |
Correct |
2 ms |
532 KB |
Output is correct |
4 |
Correct |
3 ms |
532 KB |
Output is correct |
5 |
Correct |
3 ms |
532 KB |
Output is correct |
6 |
Correct |
3 ms |
532 KB |
Output is correct |
7 |
Correct |
3 ms |
532 KB |
Output is correct |
8 |
Correct |
3 ms |
532 KB |
Output is correct |
9 |
Correct |
3 ms |
532 KB |
Output is correct |
10 |
Correct |
3 ms |
532 KB |
Output is correct |
11 |
Correct |
4 ms |
532 KB |
Output is correct |
12 |
Correct |
3 ms |
532 KB |
Output is correct |
13 |
Correct |
3 ms |
544 KB |
Output is correct |
14 |
Correct |
3 ms |
544 KB |
Output is correct |
15 |
Correct |
3 ms |
544 KB |
Output is correct |
16 |
Correct |
5 ms |
544 KB |
Output is correct |
17 |
Correct |
9 ms |
560 KB |
Output is correct |
18 |
Correct |
8 ms |
688 KB |
Output is correct |
19 |
Correct |
11 ms |
688 KB |
Output is correct |
20 |
Correct |
18 ms |
688 KB |
Output is correct |
21 |
Correct |
20 ms |
688 KB |
Output is correct |
22 |
Correct |
11 ms |
688 KB |
Output is correct |
23 |
Correct |
20 ms |
688 KB |
Output is correct |
24 |
Correct |
10 ms |
688 KB |
Output is correct |
25 |
Correct |
16 ms |
688 KB |
Output is correct |
26 |
Correct |
11 ms |
688 KB |
Output is correct |
27 |
Correct |
17 ms |
688 KB |
Output is correct |
28 |
Correct |
18 ms |
688 KB |
Output is correct |
29 |
Correct |
16 ms |
688 KB |
Output is correct |
30 |
Correct |
18 ms |
688 KB |
Output is correct |
31 |
Correct |
47 ms |
688 KB |
Output is correct |
32 |
Correct |
30 ms |
688 KB |
Output is correct |
33 |
Correct |
79 ms |
716 KB |
Output is correct |
34 |
Correct |
45 ms |
716 KB |
Output is correct |
35 |
Correct |
79 ms |
720 KB |
Output is correct |
36 |
Correct |
77 ms |
720 KB |
Output is correct |
37 |
Correct |
47 ms |
720 KB |
Output is correct |
38 |
Correct |
80 ms |
720 KB |
Output is correct |
39 |
Correct |
76 ms |
720 KB |
Output is correct |
40 |
Correct |
80 ms |
720 KB |
Output is correct |
41 |
Correct |
74 ms |
720 KB |
Output is correct |
42 |
Correct |
74 ms |
720 KB |
Output is correct |
43 |
Correct |
44 ms |
720 KB |
Output is correct |
44 |
Correct |
71 ms |
720 KB |
Output is correct |
45 |
Correct |
43 ms |
720 KB |
Output is correct |
46 |
Correct |
76 ms |
720 KB |
Output is correct |
47 |
Correct |
78 ms |
720 KB |
Output is correct |
48 |
Correct |
74 ms |
720 KB |
Output is correct |
49 |
Correct |
77 ms |
720 KB |
Output is correct |
50 |
Correct |
79 ms |
720 KB |
Output is correct |
51 |
Correct |
76 ms |
720 KB |
Output is correct |
52 |
Correct |
79 ms |
720 KB |
Output is correct |
53 |
Correct |
43 ms |
720 KB |
Output is correct |
54 |
Correct |
81 ms |
724 KB |
Output is correct |
55 |
Correct |
80 ms |
724 KB |
Output is correct |
56 |
Correct |
56 ms |
724 KB |
Output is correct |
57 |
Correct |
76 ms |
724 KB |
Output is correct |
58 |
Correct |
66 ms |
724 KB |
Output is correct |
59 |
Correct |
86 ms |
724 KB |
Output is correct |
60 |
Correct |
81 ms |
724 KB |
Output is correct |