oj.uz

Submission #198584

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

using namespace std;

static int niz[5000];
int Q[5000][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 380 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 380 KB Output is correct
4 Correct 8 ms 248 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 8 ms 248 KB Output is correct
7 Correct 6 ms 244 KB Output is correct
8 Correct 8 ms 248 KB Output is correct
9 Correct 6 ms 248 KB Output is correct
10 Correct 7 ms 252 KB Output is correct
11 Correct 8 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 7 ms 376 KB Output is correct
14 Correct 8 ms 376 KB Output is correct
15 Correct 8 ms 252 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 380 KB Output is correct
4 Correct 8 ms 248 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 8 ms 248 KB Output is correct
7 Correct 6 ms 244 KB Output is correct
8 Correct 8 ms 248 KB Output is correct
9 Correct 6 ms 248 KB Output is correct
10 Correct 7 ms 252 KB Output is correct
11 Correct 8 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 7 ms 376 KB Output is correct
14 Correct 8 ms 376 KB Output is correct
15 Correct 8 ms 252 KB Output is correct
16 Correct 13 ms 248 KB Output is correct
17 Correct 16 ms 376 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 31 ms 376 KB Output is correct
20 Correct 29 ms 504 KB Output is correct
21 Correct 20 ms 248 KB Output is correct
22 Correct 28 ms 256 KB Output is correct
23 Correct 21 ms 248 KB Output is correct
24 Correct 31 ms 312 KB Output is correct
25 Correct 22 ms 248 KB Output is correct
26 Correct 24 ms 376 KB Output is correct
27 Correct 33 ms 248 KB Output is correct
28 Correct 25 ms 248 KB Output is correct
29 Correct 15 ms 300 KB Output is correct
30 Correct 32 ms 376 KB Output is correct
31 Correct 65 ms 312 KB Output is correct
32 Correct 86 ms 376 KB Output is correct
33 Correct 122 ms 376 KB Output is correct
34 Correct 98 ms 632 KB Output is correct
35 Correct 93 ms 376 KB Output is correct
36 Correct 82 ms 376 KB Output is correct
37 Correct 87 ms 376 KB Output is correct
38 Correct 140 ms 376 KB Output is correct
39 Correct 69 ms 376 KB Output is correct
40 Correct 88 ms 376 KB Output is correct
41 Correct 108 ms 504 KB Output is correct
42 Runtime error 139 ms 556 KB Execution killed with signal 11 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -