oj.uz

Submission #146232

# Submission time Handle Problem Language Result Execution time Memory
146232 2019-08-22T23:49:52 Z Diuven Xylophone (JOI18_xylophone) C++14
100 / 100
 116 ms 520 KB 
#include "xylophone.h"
#include <algorithm>
using namespace std;

static int P[5001], A[5001];

void solve(int n){
	for(int i=2; i<=n; i++) P[i] = query(i-1, i);
	A[1] = 0; A[2] = P[2];

	for(int i=3; i<=n; i++){
		int sg = A[i-1]>A[i-2] ? 1 : -1;
		if(query(i-2, i)!=P[i-1]+P[i]) sg *= -1;
		A[i] = A[i-1] + sg*P[i];
	}

	int x = min_element(A+1, A+n+1)-A, z=A[x];
	int y = max_element(A+1, A+n+1)-A;
	for(int i=1; i<=n; i++) A[i] -= z-1;
	if(x>y) for(int i=1; i<=n; i++) A[i] = n-A[i]+1;

	for(int i=1; i<=n; i++) answer(i, A[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 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 296 KB Output is correct
5 Correct 4 ms 304 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 3 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 7 ms 248 KB Output is correct
17 Correct 12 ms 244 KB Output is correct
18 Correct 11 ms 384 KB Output is correct
19 Correct 23 ms 248 KB Output is correct
20 Correct 13 ms 296 KB Output is correct
21 Correct 14 ms 304 KB Output is correct
22 Correct 26 ms 248 KB Output is correct
23 Correct 17 ms 304 KB Output is correct
24 Correct 12 ms 388 KB Output is correct
25 Correct 22 ms 380 KB Output is correct
26 Correct 23 ms 248 KB Output is correct
27 Correct 18 ms 248 KB Output is correct
28 Correct 25 ms 392 KB Output is correct
29 Correct 24 ms 308 KB Output is correct
30 Correct 13 ms 300 KB Output is correct
31 Correct 33 ms 316 KB Output is correct
32 Correct 72 ms 324 KB Output is correct
33 Correct 93 ms 376 KB Output is correct
34 Correct 102 ms 376 KB Output is correct
35 Correct 101 ms 428 KB Output is correct
36 Correct 113 ms 448 KB Output is correct
37 Correct 116 ms 248 KB Output is correct
38 Correct 75 ms 444 KB Output is correct
39 Correct 105 ms 376 KB Output is correct
40 Correct 110 ms 436 KB Output is correct
41 Correct 111 ms 448 KB Output is correct
42 Correct 106 ms 324 KB Output is correct
43 Correct 96 ms 248 KB Output is correct
44 Correct 96 ms 464 KB Output is correct
45 Correct 109 ms 396 KB Output is correct
46 Correct 112 ms 248 KB Output is correct
47 Correct 53 ms 384 KB Output is correct
48 Correct 79 ms 416 KB Output is correct
49 Correct 100 ms 504 KB Output is correct
50 Correct 110 ms 340 KB Output is correct
51 Correct 78 ms 520 KB Output is correct
52 Correct 100 ms 316 KB Output is correct
53 Correct 75 ms 460 KB Output is correct
54 Correct 109 ms 248 KB Output is correct
55 Correct 54 ms 384 KB Output is correct
56 Correct 61 ms 300 KB Output is correct
57 Correct 103 ms 320 KB Output is correct
58 Correct 97 ms 396 KB Output is correct
59 Correct 115 ms 300 KB Output is correct
60 Correct 109 ms 376 KB Output is correct