oj.uz

Submission #102469

# Submission time Handle Problem Language Result Execution time Memory
102469 2019-03-25T07:24:27 Z IOrtroiii Xylophone (JOI18_xylophone) C++14
100 / 100
 91 ms 576 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

const int N = 5050;

int a[N];
int p[N];

void solve(int n) {
	if (n == 1) {
		answer(1, 1);
	}
	a[1] = 0;
	a[2] = query(1, 2);
	for (int i = 3; i <= n; ++i) {
		int u = query(i - 1, i), v = query(i - 2, i);
		if (a[i - 1] < a[i - 2]) {
			if (v == u + a[i - 2] - a[i - 1]) {
				a[i] = a[i - 1] - u;
			} else {
				a[i] = a[i - 1] + u;
			}
		} else {
			if (v == u + a[i - 1] - a[i - 2]) {
				a[i] = a[i - 1] + u;
			} else {
				a[i] = a[i - 1] - u;
			}
		}
	}
	int val = *min_element(a + 1, a + n + 1);
	for (int i = 1; i <= n; ++i) {
		a[i] += (1 - val);
		p[a[i]] = i;
	}
	if (p[1] > p[n]) {
		for (int i = 1; i <= n; ++i) {
			a[i] = n + 1 - a[i];
		}
	}
	for (int i = 1; i <= n; ++i) {
		answer(i, a[i]);
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 408 KB Output is correct
17 Correct 5 ms 324 KB Output is correct
18 Correct 17 ms 256 KB Output is correct
19 Correct 20 ms 256 KB Output is correct
20 Correct 18 ms 256 KB Output is correct
21 Correct 9 ms 328 KB Output is correct
22 Correct 14 ms 376 KB Output is correct
23 Correct 17 ms 256 KB Output is correct
24 Correct 17 ms 304 KB Output is correct
25 Correct 21 ms 256 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 9 ms 540 KB Output is correct
28 Correct 19 ms 256 KB Output is correct
29 Correct 21 ms 256 KB Output is correct
30 Correct 24 ms 384 KB Output is correct
31 Correct 35 ms 256 KB Output is correct
32 Correct 50 ms 384 KB Output is correct
33 Correct 52 ms 528 KB Output is correct
34 Correct 87 ms 384 KB Output is correct
35 Correct 54 ms 332 KB Output is correct
36 Correct 91 ms 464 KB Output is correct
37 Correct 58 ms 376 KB Output is correct
38 Correct 80 ms 384 KB Output is correct
39 Correct 84 ms 336 KB Output is correct
40 Correct 86 ms 376 KB Output is correct
41 Correct 57 ms 332 KB Output is correct
42 Correct 84 ms 380 KB Output is correct
43 Correct 85 ms 452 KB Output is correct
44 Correct 78 ms 384 KB Output is correct
45 Correct 70 ms 360 KB Output is correct
46 Correct 79 ms 384 KB Output is correct
47 Correct 77 ms 380 KB Output is correct
48 Correct 74 ms 384 KB Output is correct
49 Correct 89 ms 516 KB Output is correct
50 Correct 83 ms 436 KB Output is correct
51 Correct 82 ms 256 KB Output is correct
52 Correct 91 ms 376 KB Output is correct
53 Correct 67 ms 328 KB Output is correct
54 Correct 75 ms 256 KB Output is correct
55 Correct 61 ms 576 KB Output is correct
56 Correct 83 ms 456 KB Output is correct
57 Correct 41 ms 288 KB Output is correct
58 Correct 61 ms 460 KB Output is correct
59 Correct 82 ms 324 KB Output is correct
60 Correct 69 ms 256 KB Output is correct