oj.uz

Submission #102101

# Submission time Handle Problem Language Result Execution time Memory
102101 2019-03-22T09:59:40 Z gs14004 Xylophone (JOI18_xylophone) C++17
100 / 100
 97 ms 512 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 5005;
static int A[5000];
int ans[MAXN];
int q1[MAXN], q2[MAXN];

void solve(int N) {
	for(int i=1; i+1<=N; i++) q1[i] = query(i, i + 1);
	for(int i=1; i+2<=N; i++) q2[i] = query(i, i + 2);
	ans[1] = 0;
	ans[2] = q1[1];
	for(int i=3; i<=N; i++){
		if(q1[i-2] + q1[i-1] == q2[i-2]){
			if(ans[i-2] < ans[i-1]) ans[i] = ans[i-1] + q1[i-1];
			else ans[i] = ans[i-1] - q1[i-1];
		}
		else{
			if(ans[i-2] < ans[i-1]) ans[i] = ans[i-1] - q1[i-1];
			else ans[i] = ans[i-1] + q1[i-1];
		}
	}
	int minv = *min_element(ans + 1, ans + N + 1);
	for(int i=1; i<=N; i++) ans[i] += 1 - minv;
	int pos1 = find(ans + 1, ans + N + 1, 1) - ans;
	int posn = find(ans + 1, ans + N + 1, N) - ans;
	if(pos1 > posn){
		for(int i=1; i<=N; i++) ans[i] = N + 1 - ans[i];
	}
	for(int i=1; i<=N; i++){
		answer(i, ans[i]);
	}
}

Compilation message

xylophone.cpp:6: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 312 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 3 ms 324 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 7 ms 424 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 408 KB Output is correct
12 Correct 4 ms 324 KB Output is correct
13 Correct 3 ms 408 KB Output is correct
14 Correct 3 ms 404 KB Output is correct
15 Correct 3 ms 412 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 3 ms 324 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 7 ms 424 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 408 KB Output is correct
12 Correct 4 ms 324 KB Output is correct
13 Correct 3 ms 408 KB Output is correct
14 Correct 3 ms 404 KB Output is correct
15 Correct 3 ms 412 KB Output is correct
16 Correct 3 ms 324 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 10 ms 412 KB Output is correct
19 Correct 16 ms 256 KB Output is correct
20 Correct 20 ms 256 KB Output is correct
21 Correct 10 ms 384 KB Output is correct
22 Correct 14 ms 324 KB Output is correct
23 Correct 14 ms 412 KB Output is correct
24 Correct 16 ms 384 KB Output is correct
25 Correct 15 ms 256 KB Output is correct
26 Correct 17 ms 384 KB Output is correct
27 Correct 9 ms 328 KB Output is correct
28 Correct 19 ms 320 KB Output is correct
29 Correct 18 ms 384 KB Output is correct
30 Correct 17 ms 384 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 3 ms 324 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 7 ms 424 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 408 KB Output is correct
12 Correct 4 ms 324 KB Output is correct
13 Correct 3 ms 408 KB Output is correct
14 Correct 3 ms 404 KB Output is correct
15 Correct 3 ms 412 KB Output is correct
16 Correct 3 ms 324 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 10 ms 412 KB Output is correct
19 Correct 16 ms 256 KB Output is correct
20 Correct 20 ms 256 KB Output is correct
21 Correct 10 ms 384 KB Output is correct
22 Correct 14 ms 324 KB Output is correct
23 Correct 14 ms 412 KB Output is correct
24 Correct 16 ms 384 KB Output is correct
25 Correct 15 ms 256 KB Output is correct
26 Correct 17 ms 384 KB Output is correct
27 Correct 9 ms 328 KB Output is correct
28 Correct 19 ms 320 KB Output is correct
29 Correct 18 ms 384 KB Output is correct
30 Correct 17 ms 384 KB Output is correct
31 Correct 24 ms 320 KB Output is correct
32 Correct 51 ms 408 KB Output is correct
33 Correct 53 ms 384 KB Output is correct
34 Correct 58 ms 408 KB Output is correct
35 Correct 79 ms 376 KB Output is correct
36 Correct 54 ms 428 KB Output is correct
37 Correct 76 ms 348 KB Output is correct
38 Correct 82 ms 324 KB Output is correct
39 Correct 75 ms 256 KB Output is correct
40 Correct 77 ms 504 KB Output is correct
41 Correct 80 ms 384 KB Output is correct
42 Correct 51 ms 384 KB Output is correct
43 Correct 94 ms 256 KB Output is correct
44 Correct 58 ms 504 KB Output is correct
45 Correct 85 ms 332 KB Output is correct
46 Correct 51 ms 420 KB Output is correct
47 Correct 84 ms 380 KB Output is correct
48 Correct 50 ms 332 KB Output is correct
49 Correct 97 ms 376 KB Output is correct
50 Correct 83 ms 376 KB Output is correct
51 Correct 95 ms 448 KB Output is correct
52 Correct 62 ms 416 KB Output is correct
53 Correct 76 ms 384 KB Output is correct
54 Correct 97 ms 376 KB Output is correct
55 Correct 79 ms 424 KB Output is correct
56 Correct 77 ms 384 KB Output is correct
57 Correct 67 ms 376 KB Output is correct
58 Correct 95 ms 504 KB Output is correct
59 Correct 96 ms 424 KB Output is correct
60 Correct 87 ms 304 KB Output is correct