oj.uz

Submission #566875

# Submission time Handle Problem Language Result Execution time Memory
566875 2022-05-23T05:01:59 Z 1zaid1 Xylophone (JOI18_xylophone) C++17
100 / 100
 105 ms 1092 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

// static int A[5000];
const int M = 1e5+5;
int sm[M], ans[M];

map<pair<int, int>, int> mp;
int cry(int a, int b) {
	if (a == b) return 0;
	if (!mp[{a, b}]) mp[{a, b}] = query(a, b);
	return mp[{a, b}];
}

void solve(int n) {
	sm[1] = 0;
	for (int i = 1; i <= n-2; i++) {
		int a = cry(i, i+1);
		int b = cry(i+1, i+2);
		int c = cry(i, i+2);

		if (a + b == c) sm[i+1] = sm[i];
		else sm[i+1] = !sm[i];
	}

	ans[1] = 0;
	for (int i = 1; i < n; i++) {
		if (sm[i]) ans[i+1] = ans[i] - cry(i, i+1);
		else ans[i+1] = ans[i] + cry(i, i+1);
	}

	int mn = *min_element(ans+1, ans+n+1)-1;
	for (int i = 1; i <= n; i++) ans[i] -= mn;
	if (min_element(ans+1, ans+n+1)-ans > max_element(ans+1, ans+n+1)-ans) {
		for (int i = 1; i <= n; i++) ans[i] = n+1-ans[i];
	}

	for (int i = 1; i <= n; i++) answer(i, ans[i]);
}

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 3 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 ms 292 KB Output is correct
12 Correct 2 ms 320 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 3 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 ms 292 KB Output is correct
12 Correct 2 ms 320 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 3 ms 336 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 18 ms 400 KB Output is correct
19 Correct 17 ms 336 KB Output is correct
20 Correct 18 ms 404 KB Output is correct
21 Correct 19 ms 336 KB Output is correct
22 Correct 11 ms 408 KB Output is correct
23 Correct 22 ms 336 KB Output is correct
24 Correct 16 ms 380 KB Output is correct
25 Correct 17 ms 388 KB Output is correct
26 Correct 17 ms 352 KB Output is correct
27 Correct 23 ms 372 KB Output is correct
28 Correct 18 ms 328 KB Output is correct
29 Correct 13 ms 332 KB Output is correct
30 Correct 19 ms 384 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 3 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 2 ms 292 KB Output is correct
12 Correct 2 ms 320 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 3 ms 336 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 18 ms 400 KB Output is correct
19 Correct 17 ms 336 KB Output is correct
20 Correct 18 ms 404 KB Output is correct
21 Correct 19 ms 336 KB Output is correct
22 Correct 11 ms 408 KB Output is correct
23 Correct 22 ms 336 KB Output is correct
24 Correct 16 ms 380 KB Output is correct
25 Correct 17 ms 388 KB Output is correct
26 Correct 17 ms 352 KB Output is correct
27 Correct 23 ms 372 KB Output is correct
28 Correct 18 ms 328 KB Output is correct
29 Correct 13 ms 332 KB Output is correct
30 Correct 19 ms 384 KB Output is correct
31 Correct 40 ms 476 KB Output is correct
32 Correct 63 ms 716 KB Output is correct
33 Correct 56 ms 836 KB Output is correct
34 Correct 71 ms 924 KB Output is correct
35 Correct 94 ms 896 KB Output is correct
36 Correct 91 ms 956 KB Output is correct
37 Correct 89 ms 948 KB Output is correct
38 Correct 89 ms 876 KB Output is correct
39 Correct 80 ms 948 KB Output is correct
40 Correct 86 ms 932 KB Output is correct
41 Correct 99 ms 920 KB Output is correct
42 Correct 78 ms 940 KB Output is correct
43 Correct 99 ms 872 KB Output is correct
44 Correct 102 ms 968 KB Output is correct
45 Correct 93 ms 968 KB Output is correct
46 Correct 89 ms 908 KB Output is correct
47 Correct 105 ms 968 KB Output is correct
48 Correct 71 ms 892 KB Output is correct
49 Correct 94 ms 948 KB Output is correct
50 Correct 92 ms 944 KB Output is correct
51 Correct 86 ms 1092 KB Output is correct
52 Correct 86 ms 916 KB Output is correct
53 Correct 65 ms 932 KB Output is correct
54 Correct 56 ms 952 KB Output is correct
55 Correct 92 ms 952 KB Output is correct
56 Correct 89 ms 960 KB Output is correct
57 Correct 83 ms 980 KB Output is correct
58 Correct 78 ms 924 KB Output is correct
59 Correct 90 ms 992 KB Output is correct
60 Correct 98 ms 1024 KB Output is correct