oj.uz

Submission #161120

# Submission time Handle Problem Language Result Execution time Memory
161120 2019-10-31T14:55:51 Z pianoda618 Xylophone (JOI18_xylophone) C++14
100 / 100
 140 ms 556 KB 
#include "xylophone.h"
 
void solve(int N) {
	int A[N];
	A[0] = 0;
	int D[N - 1];
	int T[N - 2];
	for(int i = 1; i < N; i++) {
		D[i - 1] = query(i, i + 1);
	}
	for(int i = 2; i < N; i++) {
		T[i - 2] = query(i - 1, i + 1);
	}
	A[1] = D[0];
	bool up = true;
	for(int i = 2; i < N; i++) {
		if(D[i - 2] + D[i - 1] != T[i - 2]) {
			up = !up;
		}
		A[i] = A[i - 1] + D[i - 1] * ((int)up * 2 - 1);
	}
	int mx = 0, mn = 0;
	int mxp = 0, mnp = 0;
	for(int i = 1; i < N; i++) {
		if(A[i] > mx) {
			mx = A[i];
			mxp = i;
		}
		if(A[i] < mn) {
			mn = A[i];
			mnp = i;
		}
	}
	if(mnp < mxp) {
		for(int i = 0; i < N; i++) {
			answer(i + 1, A[i] - mn + 1);
		}
	} else {
		for(int i = 0; i < N; i++) {
			answer(i + 1, mx - A[i] + 1);
		}
	}
	
	return;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 3 ms 252 KB Output is correct
9 Correct 3 ms 248 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 3 ms 248 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 3 ms 252 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 6 ms 248 KB Output is correct
17 Correct 14 ms 376 KB Output is correct
18 Correct 25 ms 292 KB Output is correct
19 Correct 21 ms 376 KB Output is correct
20 Correct 20 ms 248 KB Output is correct
21 Correct 26 ms 248 KB Output is correct
22 Correct 19 ms 248 KB Output is correct
23 Correct 28 ms 248 KB Output is correct
24 Correct 26 ms 376 KB Output is correct
25 Correct 25 ms 308 KB Output is correct
26 Correct 21 ms 376 KB Output is correct
27 Correct 20 ms 296 KB Output is correct
28 Correct 25 ms 248 KB Output is correct
29 Correct 23 ms 248 KB Output is correct
30 Correct 20 ms 248 KB Output is correct
31 Correct 51 ms 376 KB Output is correct
32 Correct 71 ms 328 KB Output is correct
33 Correct 91 ms 404 KB Output is correct
34 Correct 104 ms 380 KB Output is correct
35 Correct 98 ms 376 KB Output is correct
36 Correct 112 ms 388 KB Output is correct
37 Correct 109 ms 388 KB Output is correct
38 Correct 128 ms 472 KB Output is correct
39 Correct 117 ms 520 KB Output is correct
40 Correct 105 ms 376 KB Output is correct
41 Correct 61 ms 444 KB Output is correct
42 Correct 104 ms 512 KB Output is correct
43 Correct 50 ms 400 KB Output is correct
44 Correct 118 ms 324 KB Output is correct
45 Correct 119 ms 392 KB Output is correct
46 Correct 103 ms 376 KB Output is correct
47 Correct 87 ms 344 KB Output is correct
48 Correct 52 ms 404 KB Output is correct
49 Correct 89 ms 332 KB Output is correct
50 Correct 83 ms 556 KB Output is correct
51 Correct 96 ms 452 KB Output is correct
52 Correct 103 ms 552 KB Output is correct
53 Correct 140 ms 376 KB Output is correct
54 Correct 116 ms 456 KB Output is correct
55 Correct 106 ms 424 KB Output is correct
56 Correct 123 ms 248 KB Output is correct
57 Correct 88 ms 508 KB Output is correct
58 Correct 119 ms 504 KB Output is correct
59 Correct 131 ms 376 KB Output is correct
60 Correct 101 ms 384 KB Output is correct