oj.uz

Submission #711919

# Submission time Handle Problem Language Result Execution time Memory
711919 2023-03-17T16:25:13 Z rainboy Xylophone (JOI18_xylophone) C++17
100 / 100
 101 ms 556 KB 
#include "xylophone.h"

const int N = 5000;

int min(int a, int b) { return a < b ? a : b; }

int dd1[N], dd2[N], aa[N];

void solve(int n) {
	for (int i = 0; i + 1 < n; i++)
		dd1[i] = query(i + 1, i + 2);
	for (int i = 0; i + 2 < n; i++)
		dd2[i] = query(i + 1, i + 3);
	aa[0] = 0, aa[1] = dd1[0];
	for (int i = 0; i + 2 < n; i++)
		aa[i + 2] = (aa[i] < aa[i + 1]) == (dd2[i] == dd1[i] + dd1[i + 1]) ? aa[i + 1] + dd1[i + 1] : aa[i + 1] - dd1[i + 1];
	int a = 0;
	for (int i = 0; i < n; i++)
		a = min(a, aa[i]);
	for (int i = 0; i < n; i++)
		aa[i] -= a;
	bool rev = false;
	for (int i = 0; i < n; i++)
		if (aa[i] == n - 1) {
			rev = true;
			break;
		} else if (aa[i] == 0) {
			rev = false;
			break;
		}
	if (rev)
		for (int i = 0; i < n; i++)
			aa[i] = n - 1 - aa[i];
	for (int i = 0; i < n; i++)
		answer(i + 1, aa[i] + 1);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 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 1 ms 208 KB Output is correct
9 Correct 2 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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 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 1 ms 208 KB Output is correct
9 Correct 2 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 2 ms 336 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 15 ms 296 KB Output is correct
20 Correct 17 ms 284 KB Output is correct
21 Correct 20 ms 308 KB Output is correct
22 Correct 11 ms 336 KB Output is correct
23 Correct 15 ms 300 KB Output is correct
24 Correct 15 ms 300 KB Output is correct
25 Correct 17 ms 292 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 12 ms 296 KB Output is correct
28 Correct 18 ms 296 KB Output is correct
29 Correct 17 ms 288 KB Output is correct
30 Correct 21 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 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 1 ms 208 KB Output is correct
9 Correct 2 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 2 ms 336 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 15 ms 296 KB Output is correct
20 Correct 17 ms 284 KB Output is correct
21 Correct 20 ms 308 KB Output is correct
22 Correct 11 ms 336 KB Output is correct
23 Correct 15 ms 300 KB Output is correct
24 Correct 15 ms 300 KB Output is correct
25 Correct 17 ms 292 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 12 ms 296 KB Output is correct
28 Correct 18 ms 296 KB Output is correct
29 Correct 17 ms 288 KB Output is correct
30 Correct 21 ms 208 KB Output is correct
31 Correct 37 ms 300 KB Output is correct
32 Correct 52 ms 304 KB Output is correct
33 Correct 94 ms 412 KB Output is correct
34 Correct 68 ms 416 KB Output is correct
35 Correct 81 ms 296 KB Output is correct
36 Correct 97 ms 292 KB Output is correct
37 Correct 97 ms 292 KB Output is correct
38 Correct 88 ms 300 KB Output is correct
39 Correct 84 ms 472 KB Output is correct
40 Correct 97 ms 428 KB Output is correct
41 Correct 79 ms 416 KB Output is correct
42 Correct 87 ms 284 KB Output is correct
43 Correct 89 ms 296 KB Output is correct
44 Correct 84 ms 328 KB Output is correct
45 Correct 97 ms 288 KB Output is correct
46 Correct 63 ms 556 KB Output is correct
47 Correct 100 ms 292 KB Output is correct
48 Correct 87 ms 428 KB Output is correct
49 Correct 96 ms 300 KB Output is correct
50 Correct 100 ms 288 KB Output is correct
51 Correct 101 ms 304 KB Output is correct
52 Correct 43 ms 416 KB Output is correct
53 Correct 48 ms 284 KB Output is correct
54 Correct 83 ms 328 KB Output is correct
55 Correct 100 ms 336 KB Output is correct
56 Correct 73 ms 292 KB Output is correct
57 Correct 97 ms 304 KB Output is correct
58 Correct 96 ms 292 KB Output is correct
59 Correct 91 ms 296 KB Output is correct
60 Correct 92 ms 328 KB Output is correct