답안 #126256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126256 2019-07-07T10:33:19 Z tjd229 Xylophone (JOI18_xylophone) C++14
100 / 100
125 ms 512 KB
#include "xylophone.h"
#include <stdio.h>
static int A[5001];//ans
int d[5001];
void solve(int N) {
	for (int i = 2; i <= N; ++i) 
		d[i] = query(i-1,i);
	A[1] = 1;
	A[2] = 1 + d[2];
	int mx = A[2], mn = 1;
	int mxi = 2, mni = 1;
	for (int i = 3; i <= N; ++i) {
		int diff = query(i-2,i);
		int sign = A[i - 2] > A[i - 1] ? -1 : 1;
		if (diff == d[i - 1]) A[i] = A[i - 1] - sign * d[i];
		else if (diff == d[i]) A[i] = A[i - 1] - sign * diff;
		else A[i] = A[i - 1] + sign * d[i];

		if (mx < A[i]) mx = A[i], mxi = i;
		if (mn > A[i]) mn = A[i], mni = i;
	}
	if (mni > mxi) {
		mn = 10000;
		for (int i = 2; i <= N; ++i) 
			d[i] = A[i] - A[i - 1];
		for (int i = 2; i <= N; ++i) {
			A[i] = A[i - 1] - d[i];
			if (mn > A[i]) mn = A[i];
		}
	}
	//for (int i = 1; i <= N; ++i) printf("%d:%d\n",i, A[i] );
	for (int i = 1; i <= N; ++i) answer(i, A[i] + 1 - mn);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 304 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 296 KB Output is correct
5 Correct 3 ms 252 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 3 ms 248 KB Output is correct
12 Correct 3 ms 300 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 304 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 296 KB Output is correct
5 Correct 3 ms 252 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 3 ms 248 KB Output is correct
12 Correct 3 ms 300 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 15 ms 252 KB Output is correct
19 Correct 29 ms 248 KB Output is correct
20 Correct 22 ms 296 KB Output is correct
21 Correct 22 ms 248 KB Output is correct
22 Correct 22 ms 248 KB Output is correct
23 Correct 26 ms 248 KB Output is correct
24 Correct 22 ms 356 KB Output is correct
25 Correct 12 ms 376 KB Output is correct
26 Correct 22 ms 376 KB Output is correct
27 Correct 25 ms 376 KB Output is correct
28 Correct 12 ms 300 KB Output is correct
29 Correct 24 ms 376 KB Output is correct
30 Correct 22 ms 248 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 304 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 296 KB Output is correct
5 Correct 3 ms 252 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 3 ms 248 KB Output is correct
12 Correct 3 ms 300 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 12 ms 252 KB Output is correct
18 Correct 15 ms 252 KB Output is correct
19 Correct 29 ms 248 KB Output is correct
20 Correct 22 ms 296 KB Output is correct
21 Correct 22 ms 248 KB Output is correct
22 Correct 22 ms 248 KB Output is correct
23 Correct 26 ms 248 KB Output is correct
24 Correct 22 ms 356 KB Output is correct
25 Correct 12 ms 376 KB Output is correct
26 Correct 22 ms 376 KB Output is correct
27 Correct 25 ms 376 KB Output is correct
28 Correct 12 ms 300 KB Output is correct
29 Correct 24 ms 376 KB Output is correct
30 Correct 22 ms 248 KB Output is correct
31 Correct 25 ms 384 KB Output is correct
32 Correct 50 ms 400 KB Output is correct
33 Correct 97 ms 376 KB Output is correct
34 Correct 90 ms 316 KB Output is correct
35 Correct 104 ms 376 KB Output is correct
36 Correct 106 ms 248 KB Output is correct
37 Correct 104 ms 300 KB Output is correct
38 Correct 108 ms 300 KB Output is correct
39 Correct 108 ms 312 KB Output is correct
40 Correct 119 ms 376 KB Output is correct
41 Correct 86 ms 512 KB Output is correct
42 Correct 112 ms 312 KB Output is correct
43 Correct 100 ms 384 KB Output is correct
44 Correct 116 ms 376 KB Output is correct
45 Correct 98 ms 376 KB Output is correct
46 Correct 105 ms 248 KB Output is correct
47 Correct 102 ms 376 KB Output is correct
48 Correct 109 ms 248 KB Output is correct
49 Correct 86 ms 440 KB Output is correct
50 Correct 72 ms 336 KB Output is correct
51 Correct 71 ms 308 KB Output is correct
52 Correct 55 ms 296 KB Output is correct
53 Correct 125 ms 376 KB Output is correct
54 Correct 113 ms 508 KB Output is correct
55 Correct 79 ms 380 KB Output is correct
56 Correct 77 ms 416 KB Output is correct
57 Correct 100 ms 312 KB Output is correct
58 Correct 91 ms 376 KB Output is correct
59 Correct 99 ms 248 KB Output is correct
60 Correct 121 ms 340 KB Output is correct