oj.uz

Submission #58073

# Submission time Handle Problem Language Result Execution time Memory
58073 2018-07-16T17:38:33 Z memikakizaki Xylophone (JOI18_xylophone) C++14
100 / 100
 119 ms 848 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5001;
static int A[N];

int n, d[N], d2[N], dir[N], res[N];

bool check_res() {
	int mnpos = -1, mxpos = -1;
	for(int i = 1; i <= n; i++) {
		if(mnpos == -1 || res[mnpos] > res[i]) mnpos = i;
		if(mxpos == -1 || res[mxpos] < res[i]) mxpos = i;
	}
	assert(mnpos != -1 && mxpos != -1 && mnpos != mxpos);
	return mnpos < mxpos;
}

void bye() {
	int mn = *min_element(res+1, res+n+1);
	for(int i = 1; i <= n; i++) answer(i, res[i]-mn+1);
}

void calc() {
	for(int i = 1; i <= n-1; i++) {
		if(d[i] + d[i+1] != d2[i]) dir[i+1] = dir[i] ^ 1;
		else dir[i+1] = dir[i];
	}
	for(int i = 2, curr = 0; i <= n; i++) {
		if(dir[i-1] == 0) curr += d[i-1];
		else res[i] = curr -= d[i-1];
		res[i] = curr;
	}
}

void solve(int _n) {
	n = _n;
	if(n == 1) {
		answer(1, 1);
		return;
	}
	if(n == 2) {
		answer(1, 1);
		answer(2, 2);
		return;
	}
	for(int i = 1; i <= n-1; i++) d[i] = query(i, i+1);
	for(int i = 1; i <= n-2; i++) d2[i] = query(i, i+2);
	dir[1] = 0;
	calc();
	if(check_res()) {
		bye();
		return;
	}
	dir[1] = 1;
	calc();
	assert(check_res());
	bye();
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 308 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 4 ms 540 KB Output is correct
8 Correct 3 ms 540 KB Output is correct
9 Correct 5 ms 544 KB Output is correct
10 Correct 4 ms 544 KB Output is correct
11 Correct 4 ms 544 KB Output is correct
12 Correct 4 ms 548 KB Output is correct
13 Correct 4 ms 548 KB Output is correct
14 Correct 3 ms 548 KB Output is correct
15 Correct 5 ms 548 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 3 ms 308 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 4 ms 540 KB Output is correct
8 Correct 3 ms 540 KB Output is correct
9 Correct 5 ms 544 KB Output is correct
10 Correct 4 ms 544 KB Output is correct
11 Correct 4 ms 544 KB Output is correct
12 Correct 4 ms 548 KB Output is correct
13 Correct 4 ms 548 KB Output is correct
14 Correct 3 ms 548 KB Output is correct
15 Correct 5 ms 548 KB Output is correct
16 Correct 6 ms 548 KB Output is correct
17 Correct 6 ms 548 KB Output is correct
18 Correct 16 ms 548 KB Output is correct
19 Correct 20 ms 548 KB Output is correct
20 Correct 16 ms 548 KB Output is correct
21 Correct 11 ms 548 KB Output is correct
22 Correct 18 ms 548 KB Output is correct
23 Correct 17 ms 548 KB Output is correct
24 Correct 17 ms 548 KB Output is correct
25 Correct 14 ms 548 KB Output is correct
26 Correct 20 ms 676 KB Output is correct
27 Correct 17 ms 676 KB Output is correct
28 Correct 13 ms 676 KB Output is correct
29 Correct 24 ms 676 KB Output is correct
30 Correct 21 ms 676 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 3 ms 308 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 3 ms 532 KB Output is correct
7 Correct 4 ms 540 KB Output is correct
8 Correct 3 ms 540 KB Output is correct
9 Correct 5 ms 544 KB Output is correct
10 Correct 4 ms 544 KB Output is correct
11 Correct 4 ms 544 KB Output is correct
12 Correct 4 ms 548 KB Output is correct
13 Correct 4 ms 548 KB Output is correct
14 Correct 3 ms 548 KB Output is correct
15 Correct 5 ms 548 KB Output is correct
16 Correct 6 ms 548 KB Output is correct
17 Correct 6 ms 548 KB Output is correct
18 Correct 16 ms 548 KB Output is correct
19 Correct 20 ms 548 KB Output is correct
20 Correct 16 ms 548 KB Output is correct
21 Correct 11 ms 548 KB Output is correct
22 Correct 18 ms 548 KB Output is correct
23 Correct 17 ms 548 KB Output is correct
24 Correct 17 ms 548 KB Output is correct
25 Correct 14 ms 548 KB Output is correct
26 Correct 20 ms 676 KB Output is correct
27 Correct 17 ms 676 KB Output is correct
28 Correct 13 ms 676 KB Output is correct
29 Correct 24 ms 676 KB Output is correct
30 Correct 21 ms 676 KB Output is correct
31 Correct 40 ms 676 KB Output is correct
32 Correct 38 ms 676 KB Output is correct
33 Correct 47 ms 676 KB Output is correct
34 Correct 87 ms 676 KB Output is correct
35 Correct 89 ms 676 KB Output is correct
36 Correct 49 ms 676 KB Output is correct
37 Correct 84 ms 724 KB Output is correct
38 Correct 50 ms 724 KB Output is correct
39 Correct 89 ms 724 KB Output is correct
40 Correct 92 ms 724 KB Output is correct
41 Correct 83 ms 724 KB Output is correct
42 Correct 87 ms 724 KB Output is correct
43 Correct 83 ms 848 KB Output is correct
44 Correct 83 ms 848 KB Output is correct
45 Correct 86 ms 848 KB Output is correct
46 Correct 44 ms 848 KB Output is correct
47 Correct 74 ms 848 KB Output is correct
48 Correct 116 ms 848 KB Output is correct
49 Correct 114 ms 848 KB Output is correct
50 Correct 74 ms 848 KB Output is correct
51 Correct 100 ms 848 KB Output is correct
52 Correct 91 ms 848 KB Output is correct
53 Correct 119 ms 848 KB Output is correct
54 Correct 77 ms 848 KB Output is correct
55 Correct 47 ms 848 KB Output is correct
56 Correct 95 ms 848 KB Output is correct
57 Correct 98 ms 848 KB Output is correct
58 Correct 112 ms 848 KB Output is correct
59 Correct 78 ms 848 KB Output is correct
60 Correct 74 ms 848 KB Output is correct