oj.uz

Submission #145451

# Submission time Handle Problem Language Result Execution time Memory
145451 2019-08-19T22:18:17 Z faremy Xylophone (JOI18_xylophone) C++14
100 / 100
 147 ms 508 KB 
#include "xylophone.h"


static int A[5000];

const int MAXN = 5e3;

int diff[MAXN];
int direction[MAXN];
int relAns[MAXN];


void solve(int N)
{
	for (int i = 1; i < N; i++)
		diff[i - 1] = query(i, i + 1);

	direction[0] = 1;
	for (int i = 2; i < N; i++)
	{
		direction[i - 1] = direction[i - 2];
		if (query(i - 1, i + 1) != diff[i - 2] + diff[i - 1])
			direction[i - 1] *= -1;
	}

	int posMin = 0, posMax = 0;
	for (int i = 1; i < N; i++)
	{
		relAns[i] = relAns[i - 1] + diff[i - 1] * direction[i - 1];
		if (relAns[i] < relAns[posMin])
			posMin = i;
		if (relAns[i] > relAns[posMax])
			posMax = i;
	}
	
	if (posMax < posMin)
	{
		posMin = posMax;
		for (int i = 1; i < N; i++)
			relAns[i] *= -1;
	}

	for (int i = 0; i < N; i++)
		answer(i + 1, relAns[i] - relAns[posMin] + 1);
}

Compilation message

xylophone.cpp:4:12: warning: 'A' defined but not used [-Wunused-variable]
 static int A[5000];
            ^

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 248 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 3 ms 380 KB Output is correct
10 Correct 3 ms 300 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 300 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 12 ms 304 KB Output is correct
18 Correct 16 ms 248 KB Output is correct
19 Correct 12 ms 304 KB Output is correct
20 Correct 12 ms 384 KB Output is correct
21 Correct 23 ms 252 KB Output is correct
22 Correct 24 ms 376 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 26 ms 312 KB Output is correct
25 Correct 28 ms 248 KB Output is correct
26 Correct 27 ms 248 KB Output is correct
27 Correct 12 ms 384 KB Output is correct
28 Correct 23 ms 376 KB Output is correct
29 Correct 12 ms 384 KB Output is correct
30 Correct 19 ms 296 KB Output is correct
31 Correct 24 ms 296 KB Output is correct
32 Correct 67 ms 328 KB Output is correct
33 Correct 106 ms 432 KB Output is correct
34 Correct 64 ms 508 KB Output is correct
35 Correct 98 ms 452 KB Output is correct
36 Correct 126 ms 248 KB Output is correct
37 Correct 53 ms 300 KB Output is correct
38 Correct 103 ms 384 KB Output is correct
39 Correct 98 ms 320 KB Output is correct
40 Correct 98 ms 320 KB Output is correct
41 Correct 109 ms 248 KB Output is correct
42 Correct 52 ms 340 KB Output is correct
43 Correct 65 ms 332 KB Output is correct
44 Correct 127 ms 384 KB Output is correct
45 Correct 96 ms 464 KB Output is correct
46 Correct 95 ms 320 KB Output is correct
47 Correct 98 ms 316 KB Output is correct
48 Correct 60 ms 376 KB Output is correct
49 Correct 95 ms 384 KB Output is correct
50 Correct 103 ms 376 KB Output is correct
51 Correct 112 ms 248 KB Output is correct
52 Correct 90 ms 396 KB Output is correct
53 Correct 101 ms 440 KB Output is correct
54 Correct 147 ms 248 KB Output is correct
55 Correct 66 ms 312 KB Output is correct
56 Correct 110 ms 460 KB Output is correct
57 Correct 110 ms 320 KB Output is correct
58 Correct 122 ms 248 KB Output is correct
59 Correct 82 ms 376 KB Output is correct
60 Correct 58 ms 344 KB Output is correct