oj.uz

Submission #198585

# Submission time Handle Problem Language Result Execution time Memory
198585 2020-01-26T17:19:54 Z rKrPaN Xylophone (JOI18_xylophone) C++
100 / 100
 126 ms 544 KB 
#include "xylophone.h"
#include <algorithm>

using namespace std;

static int niz[5010];
int Q[5010][2];

void solve(int N) {

	for (int i = 1; i <= N-1; i++){
		Q[i][1] = query(i, i+1);
	}
	for (int i = 1; i <= N-2; i++){
		Q[i][2] = query(i, i+2);
	}
	
	niz[2] = Q[1][1];
	
	for (int i = 3; i <= N; i++){
		if (Q[i-2][2] == Q[i-2][1] + Q[i-1][1]){
			if (niz[i-2] < niz[i-1])niz[i] = niz[i-1] + Q[i-1][1];
			else niz[i] = niz[i-1] - Q[i-1][1];
		}
		
		if (Q[i-2][2] == max(Q[i-2][1], Q[i-1][1])){
			if (niz[i-2] < niz[i-1])niz[i] = niz[i-1] - Q[i-1][1];
			else niz[i] = niz[i-1] + Q[i-1][1];
		}
	}
	
	int mn = 5010;
	int mx = -5010;
	int plus;
	int inv = 1;
	
	for (int i = 1; i <= N; i++){
		if (niz[i] < mn)mn = niz[i];
		if (niz[i] > mx)mx = niz[i];
	}
	plus = -mn+1;
	
	for (int i = 1; i <= N; i++){
		if (niz[i] == mn)break;
		if (niz[i] == mn + N-1){
			inv = -1;
			plus = mx+1;
			break;
		}
	}
	
	for (int i = 1; i <= N; i++){
		answer (i, inv*niz[i] + plus);
	}

}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:15:9: warning: array subscript is above array bounds [-Warray-bounds]
   Q[i][2] = query(i, i+2);
   ~~~~~~^
xylophone.cpp:21:15: warning: array subscript is above array bounds [-Warray-bounds]
   if (Q[i-2][2] == Q[i-2][1] + Q[i-1][1]){
       ~~~~~~~~^

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 248 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 7 ms 376 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 7 ms 248 KB Output is correct
11 Correct 6 ms 252 KB Output is correct
12 Correct 7 ms 248 KB Output is correct
13 Correct 7 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 248 KB Output is correct
16 Correct 10 ms 504 KB Output is correct
17 Correct 15 ms 424 KB Output is correct
18 Correct 21 ms 308 KB Output is correct
19 Correct 14 ms 388 KB Output is correct
20 Correct 22 ms 248 KB Output is correct
21 Correct 23 ms 248 KB Output is correct
22 Correct 23 ms 248 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 26 ms 376 KB Output is correct
25 Correct 26 ms 248 KB Output is correct
26 Correct 26 ms 248 KB Output is correct
27 Correct 20 ms 252 KB Output is correct
28 Correct 26 ms 248 KB Output is correct
29 Correct 26 ms 248 KB Output is correct
30 Correct 24 ms 376 KB Output is correct
31 Correct 43 ms 376 KB Output is correct
32 Correct 54 ms 248 KB Output is correct
33 Correct 83 ms 376 KB Output is correct
34 Correct 77 ms 304 KB Output is correct
35 Correct 90 ms 376 KB Output is correct
36 Correct 94 ms 336 KB Output is correct
37 Correct 79 ms 376 KB Output is correct
38 Correct 98 ms 376 KB Output is correct
39 Correct 99 ms 388 KB Output is correct
40 Correct 76 ms 304 KB Output is correct
41 Correct 92 ms 376 KB Output is correct
42 Correct 91 ms 320 KB Output is correct
43 Correct 85 ms 504 KB Output is correct
44 Correct 100 ms 544 KB Output is correct
45 Correct 108 ms 444 KB Output is correct
46 Correct 89 ms 376 KB Output is correct
47 Correct 126 ms 376 KB Output is correct
48 Correct 103 ms 376 KB Output is correct
49 Correct 109 ms 376 KB Output is correct
50 Correct 104 ms 444 KB Output is correct
51 Correct 73 ms 304 KB Output is correct
52 Correct 100 ms 452 KB Output is correct
53 Correct 99 ms 504 KB Output is correct
54 Correct 95 ms 248 KB Output is correct
55 Correct 93 ms 516 KB Output is correct
56 Correct 110 ms 504 KB Output is correct
57 Correct 107 ms 344 KB Output is correct
58 Correct 92 ms 300 KB Output is correct
59 Correct 103 ms 376 KB Output is correct
60 Correct 92 ms 376 KB Output is correct