oj.uz

Submission #114845

# Submission time Handle Problem Language Result Execution time Memory
114845 2019-06-03T13:27:09 Z maruii Xylophone (JOI18_xylophone) C++14
100 / 100
 116 ms 576 KB 
#include "xylophone.h"
#include <algorithm>

int X[5000], ans[5000];

void solve(int N) {
	for (int i = 0; i < N - 1; ++i) X[i] = query(i + 1, i + 2);
	ans[1] = X[0];
	for (int i = 0; i < N - 2; ++i) {
		int t = query(i + 1, i + 3);
		if (X[i] + X[i+1] == t) {
			if(ans[i+1] > ans[i]) ans[i+2] = ans[i] + t;
			else ans[i+2] = ans[i] - t;
		}
		else {
			if (ans[i+1] > ans[i]) ans[i+2] = ans[i+1] - X[i+1];
			else ans[i+2] = ans[i+1] + X[i+1];
		}
	}
	int m = *std::min_element(ans, ans + N) - 1;
	int a, b;
	for (int i = 0; i < N; ++i) {
		ans[i] -= m;
		if (ans[i] == 1) a = i;
		if (ans[i] == N) b = i;
	}
	for(int i = 1; i <= N; i++) {
		if (a > b) ans[i-1] = N + 1 - ans[i-1];
		answer(i, ans[i-1]);
	}
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:28:3: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if (a > b) ans[i-1] = N + 1 - ans[i-1];
   ^~
xylophone.cpp:28:3: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 392 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 412 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 392 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 412 KB Output is correct
16 Correct 3 ms 392 KB Output is correct
17 Correct 10 ms 372 KB Output is correct
18 Correct 16 ms 376 KB Output is correct
19 Correct 20 ms 384 KB Output is correct
20 Correct 21 ms 256 KB Output is correct
21 Correct 21 ms 256 KB Output is correct
22 Correct 18 ms 256 KB Output is correct
23 Correct 22 ms 256 KB Output is correct
24 Correct 15 ms 352 KB Output is correct
25 Correct 8 ms 308 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 19 ms 320 KB Output is correct
28 Correct 18 ms 256 KB Output is correct
29 Correct 18 ms 392 KB Output is correct
30 Correct 17 ms 256 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 392 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 5 ms 412 KB Output is correct
16 Correct 3 ms 392 KB Output is correct
17 Correct 10 ms 372 KB Output is correct
18 Correct 16 ms 376 KB Output is correct
19 Correct 20 ms 384 KB Output is correct
20 Correct 21 ms 256 KB Output is correct
21 Correct 21 ms 256 KB Output is correct
22 Correct 18 ms 256 KB Output is correct
23 Correct 22 ms 256 KB Output is correct
24 Correct 15 ms 352 KB Output is correct
25 Correct 8 ms 308 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 19 ms 320 KB Output is correct
28 Correct 18 ms 256 KB Output is correct
29 Correct 18 ms 392 KB Output is correct
30 Correct 17 ms 256 KB Output is correct
31 Correct 37 ms 320 KB Output is correct
32 Correct 23 ms 424 KB Output is correct
33 Correct 113 ms 560 KB Output is correct
34 Correct 90 ms 320 KB Output is correct
35 Correct 91 ms 320 KB Output is correct
36 Correct 84 ms 384 KB Output is correct
37 Correct 67 ms 256 KB Output is correct
38 Correct 65 ms 256 KB Output is correct
39 Correct 98 ms 576 KB Output is correct
40 Correct 99 ms 384 KB Output is correct
41 Correct 75 ms 256 KB Output is correct
42 Correct 97 ms 320 KB Output is correct
43 Correct 76 ms 256 KB Output is correct
44 Correct 98 ms 384 KB Output is correct
45 Correct 98 ms 316 KB Output is correct
46 Correct 81 ms 448 KB Output is correct
47 Correct 85 ms 388 KB Output is correct
48 Correct 65 ms 256 KB Output is correct
49 Correct 43 ms 416 KB Output is correct
50 Correct 33 ms 388 KB Output is correct
51 Correct 85 ms 392 KB Output is correct
52 Correct 116 ms 384 KB Output is correct
53 Correct 36 ms 304 KB Output is correct
54 Correct 56 ms 540 KB Output is correct
55 Correct 71 ms 256 KB Output is correct
56 Correct 93 ms 308 KB Output is correct
57 Correct 96 ms 384 KB Output is correct
58 Correct 68 ms 320 KB Output is correct
59 Correct 69 ms 256 KB Output is correct
60 Correct 65 ms 332 KB Output is correct