oj.uz

Submission #788786

# Submission time Handle Problem Language Result Execution time Memory
788786 2023-07-20T15:38:06 Z tch1cherin Xylophone (JOI18_xylophone) C++17
100 / 100
 94 ms 428 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N) {
	vector<int> d(N - 1);
	for (int i = 0; i < N - 1; i++) {
		d[i] = query(i + 1, i + 2);
	}
	for (int i = 1; i < N - 1; i++) {
		if (query(i, i + 2) != abs(d[i - 1]) + d[i]) {
			d[i] *= d[i - 1] < 0 ? 1 : -1;
		} else {
			d[i] *= d[i - 1] < 0 ? -1 : 1;
		}
	}
	for (int r = 0; r < 2; r++) {
		vector<int> p = d;
		p.insert(p.begin(), 0);
		partial_sum(p.begin(), p.end(), p.begin());
		int Min = *min_element(p.begin(), p.end());
		int good = 0;
		for (int &v : p) {
			v -= Min - 1;
			if (v == 1 && good == 0) {
				good++;
			}
			if (v == N && good == 1) {
				good++;
			}
		}
		if (good == 2) {
			for (int i = 0; i < N; i++) {
				answer(1 + i, p[i]);
			}
		}
		for (int i = 0; i < N - 1; i++) {
			d[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 1 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 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 1 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 1 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 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 1 ms 208 KB Output is correct
16 Correct 3 ms 300 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 11 ms 308 KB Output is correct
19 Correct 13 ms 208 KB Output is correct
20 Correct 16 ms 296 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 17 ms 296 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 18 ms 296 KB Output is correct
25 Correct 18 ms 296 KB Output is correct
26 Correct 17 ms 280 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 17 ms 300 KB Output is correct
29 Correct 12 ms 296 KB Output is correct
30 Correct 13 ms 292 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 1 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 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 1 ms 208 KB Output is correct
16 Correct 3 ms 300 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 11 ms 308 KB Output is correct
19 Correct 13 ms 208 KB Output is correct
20 Correct 16 ms 296 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 17 ms 296 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 18 ms 296 KB Output is correct
25 Correct 18 ms 296 KB Output is correct
26 Correct 17 ms 280 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 17 ms 300 KB Output is correct
29 Correct 12 ms 296 KB Output is correct
30 Correct 13 ms 292 KB Output is correct
31 Correct 15 ms 300 KB Output is correct
32 Correct 52 ms 300 KB Output is correct
33 Correct 60 ms 312 KB Output is correct
34 Correct 63 ms 328 KB Output is correct
35 Correct 94 ms 300 KB Output is correct
36 Correct 75 ms 300 KB Output is correct
37 Correct 81 ms 296 KB Output is correct
38 Correct 56 ms 404 KB Output is correct
39 Correct 60 ms 312 KB Output is correct
40 Correct 62 ms 296 KB Output is correct
41 Correct 83 ms 348 KB Output is correct
42 Correct 80 ms 312 KB Output is correct
43 Correct 62 ms 304 KB Output is correct
44 Correct 76 ms 304 KB Output is correct
45 Correct 68 ms 304 KB Output is correct
46 Correct 62 ms 296 KB Output is correct
47 Correct 66 ms 308 KB Output is correct
48 Correct 69 ms 304 KB Output is correct
49 Correct 61 ms 296 KB Output is correct
50 Correct 78 ms 428 KB Output is correct
51 Correct 59 ms 320 KB Output is correct
52 Correct 77 ms 304 KB Output is correct
53 Correct 61 ms 300 KB Output is correct
54 Correct 60 ms 300 KB Output is correct
55 Correct 89 ms 296 KB Output is correct
56 Correct 43 ms 304 KB Output is correct
57 Correct 79 ms 296 KB Output is correct
58 Correct 48 ms 308 KB Output is correct
59 Correct 65 ms 332 KB Output is correct
60 Correct 66 ms 300 KB Output is correct