oj.uz

답안 #148084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148084 2019-08-31T13:44:38 Z WhipppedCream Xylophone (JOI18_xylophone) C++17
100 / 100
 106 ms 460 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 296 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 248 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 4 ms 296 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 3 ms 268 KB Output is correct
15 Correct 3 ms 292 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 296 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 248 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 4 ms 296 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 3 ms 268 KB Output is correct
15 Correct 3 ms 292 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 13 ms 248 KB Output is correct
18 Correct 12 ms 296 KB Output is correct
19 Correct 22 ms 376 KB Output is correct
20 Correct 22 ms 248 KB Output is correct
21 Correct 15 ms 308 KB Output is correct
22 Correct 13 ms 308 KB Output is correct
23 Correct 22 ms 276 KB Output is correct
24 Correct 21 ms 248 KB Output is correct
25 Correct 20 ms 376 KB Output is correct
26 Correct 22 ms 248 KB Output is correct
27 Correct 25 ms 248 KB Output is correct
28 Correct 21 ms 308 KB Output is correct
29 Correct 21 ms 296 KB Output is correct
30 Correct 13 ms 304 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 296 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 248 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 4 ms 296 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 3 ms 268 KB Output is correct
15 Correct 3 ms 292 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 13 ms 248 KB Output is correct
18 Correct 12 ms 296 KB Output is correct
19 Correct 22 ms 376 KB Output is correct
20 Correct 22 ms 248 KB Output is correct
21 Correct 15 ms 308 KB Output is correct
22 Correct 13 ms 308 KB Output is correct
23 Correct 22 ms 276 KB Output is correct
24 Correct 21 ms 248 KB Output is correct
25 Correct 20 ms 376 KB Output is correct
26 Correct 22 ms 248 KB Output is correct
27 Correct 25 ms 248 KB Output is correct
28 Correct 21 ms 308 KB Output is correct
29 Correct 21 ms 296 KB Output is correct
30 Correct 13 ms 304 KB Output is correct
31 Correct 24 ms 312 KB Output is correct
32 Correct 38 ms 248 KB Output is correct
33 Correct 48 ms 308 KB Output is correct
34 Correct 54 ms 328 KB Output is correct
35 Correct 54 ms 432 KB Output is correct
36 Correct 64 ms 360 KB Output is correct
37 Correct 69 ms 460 KB Output is correct
38 Correct 56 ms 332 KB Output is correct
39 Correct 59 ms 396 KB Output is correct
40 Correct 73 ms 380 KB Output is correct
41 Correct 89 ms 352 KB Output is correct
42 Correct 74 ms 380 KB Output is correct
43 Correct 64 ms 328 KB Output is correct
44 Correct 63 ms 328 KB Output is correct
45 Correct 54 ms 340 KB Output is correct
46 Correct 60 ms 352 KB Output is correct
47 Correct 65 ms 340 KB Output is correct
48 Correct 61 ms 388 KB Output is correct
49 Correct 67 ms 348 KB Output is correct
50 Correct 54 ms 388 KB Output is correct
51 Correct 57 ms 304 KB Output is correct
52 Correct 97 ms 392 KB Output is correct
53 Correct 74 ms 348 KB Output is correct
54 Correct 69 ms 332 KB Output is correct
55 Correct 62 ms 332 KB Output is correct
56 Correct 80 ms 364 KB Output is correct
57 Correct 56 ms 344 KB Output is correct
58 Correct 60 ms 376 KB Output is correct
59 Correct 59 ms 352 KB Output is correct
60 Correct 106 ms 340 KB Output is correct