oj.uz

Submission #126700

# Submission time Handle Problem Language Result Execution time Memory
126700 2019-07-08T09:34:21 Z E869120 Xylophone (JOI18_xylophone) C++14
100 / 100
 119 ms 540 KB 
#include "xylophone.h"
#include <algorithm>
using namespace std;

int A[10009], B2[10009], B3[10009];

void solve(int N) {
	for (int i = 0; i < N - 1; i++) B2[i] = query(i + 1, i + 2);
	for (int i = 0; i < N - 2; i++) B3[i] = query(i + 1, i + 3);
	A[0] = 0; A[1] = B2[0];
	for (int i = 2; i < N; i++) {
		int V1 = max({ A[i - 2],A[i - 1],A[i - 1] + B2[i - 1] }) - min({ A[i - 2],A[i - 1],A[i - 1] + B2[i - 1] });
		int V2 = max({ A[i - 2],A[i - 1],A[i - 1] - B2[i - 1] }) - min({ A[i - 2],A[i - 1],A[i - 1] - B2[i - 1] });
		if (V1 == B3[i - 2]) A[i] = A[i - 1] + B2[i - 1];
		else A[i] = A[i - 1] - B2[i - 1];
	}
	int minx = 0;
	for (int i = 0; i < N; i++) minx = min(minx, A[i]);
	for (int i = 0; i < N; i++) A[i] -= minx - 1;

	int id1 = -1, id2 = -1;
	for (int i = 0; i < N; i++) { if (A[i] == 1) id1 = i; if (A[i] == N) id2 = i; }
	if (id1 > id2) { for (int i = 0; i < N; i++) A[i] = N + 1 - A[i]; }
	
	for (int i = 0; i < N; i++) answer(i + 1, A[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:13:7: warning: unused variable 'V2' [-Wunused-variable]
   int V2 = max({ A[i - 2],A[i - 1],A[i - 1] - B2[i - 1] }) - min({ A[i - 2],A[i - 1],A[i - 1] - B2[i - 1] });
       ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 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 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 300 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 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 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 300 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 14 ms 304 KB Output is correct
18 Correct 16 ms 248 KB Output is correct
19 Correct 24 ms 376 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 13 ms 300 KB Output is correct
22 Correct 25 ms 376 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 22 ms 248 KB Output is correct
25 Correct 13 ms 300 KB Output is correct
26 Correct 24 ms 308 KB Output is correct
27 Correct 21 ms 376 KB Output is correct
28 Correct 20 ms 376 KB Output is correct
29 Correct 20 ms 376 KB Output is correct
30 Correct 21 ms 248 KB Output is correct
31 Correct 46 ms 376 KB Output is correct
32 Correct 65 ms 316 KB Output is correct
33 Correct 80 ms 316 KB Output is correct
34 Correct 97 ms 376 KB Output is correct
35 Correct 98 ms 312 KB Output is correct
36 Correct 96 ms 376 KB Output is correct
37 Correct 69 ms 344 KB Output is correct
38 Correct 101 ms 376 KB Output is correct
39 Correct 65 ms 396 KB Output is correct
40 Correct 77 ms 388 KB Output is correct
41 Correct 90 ms 320 KB Output is correct
42 Correct 100 ms 312 KB Output is correct
43 Correct 100 ms 320 KB Output is correct
44 Correct 99 ms 376 KB Output is correct
45 Correct 64 ms 420 KB Output is correct
46 Correct 66 ms 320 KB Output is correct
47 Correct 96 ms 336 KB Output is correct
48 Correct 111 ms 324 KB Output is correct
49 Correct 66 ms 316 KB Output is correct
50 Correct 98 ms 316 KB Output is correct
51 Correct 89 ms 448 KB Output is correct
52 Correct 101 ms 376 KB Output is correct
53 Correct 64 ms 424 KB Output is correct
54 Correct 119 ms 320 KB Output is correct
55 Correct 111 ms 508 KB Output is correct
56 Correct 104 ms 540 KB Output is correct
57 Correct 105 ms 380 KB Output is correct
58 Correct 109 ms 316 KB Output is correct
59 Correct 57 ms 504 KB Output is correct
60 Correct 105 ms 376 KB Output is correct