Submission #381070

# Submission time Handle Problem Language Result Execution time Memory
381070 2021-03-24T12:48:14 Z aryan12 Xylophone (JOI18_xylophone) C++17
100 / 100
141 ms 620 KB
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

static int A[5000];

void solve(int n) {
	int diff[n + 1];
	int signs[n + 1];
	for(int i = 0; i <= n; i++) {
		signs[i] = 0;
	}
	for(int i = 1; i < n; i++) {
		diff[i] = query(i, i + 1);
	}
	signs[1] = diff[1];
	for(int i = 1; i < n - 1; i++) {
		int x = query(i, i + 2);
		if(x == diff[i] + diff[i + 1]) {
			signs[i + 1] = (signs[i] < 0) ? -diff[i + 1] : diff[i + 1];
		}
		else {
			signs[i + 1] = (signs[i] < 1) ? diff[i + 1] : -diff[i + 1];
		}
	}
	int minTillNow = 0, maxTillNow = 0;
	int cur = 0, pos = 0;
	for(int i = 1; i < n; i++) {
		cur += signs[i];
		minTillNow = min(minTillNow, cur);
		maxTillNow = max(maxTillNow, cur);
		if(maxTillNow - minTillNow == n - 1) {
			pos = i + 1;
			if(signs[i] < 0) {
				for(int j = 1; j < n; j++) {
					signs[j] = -signs[j];
				}
			}
			break;
		}
	}
	int ans[n + 1];
	ans[pos] = n;
	for(int i = pos; i < n; i++) {
		ans[i + 1] = ans[i] + signs[i];
	}
	for(int i = pos - 1; i > 0; i--) {
		ans[i] = ans[i + 1] + -signs[i];
	}
	for(int i = 1; i <= n; i++) {
		answer(i, ans[i]);
	}
}

Compilation message

xylophone.cpp:5:12: warning: 'A' defined but not used [-Wunused-variable]
    5 | static int A[5000];
      |            ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 6 ms 364 KB Output is correct
17 Correct 13 ms 364 KB Output is correct
18 Correct 22 ms 364 KB Output is correct
19 Correct 16 ms 492 KB Output is correct
20 Correct 16 ms 364 KB Output is correct
21 Correct 21 ms 364 KB Output is correct
22 Correct 23 ms 492 KB Output is correct
23 Correct 15 ms 364 KB Output is correct
24 Correct 20 ms 492 KB Output is correct
25 Correct 12 ms 380 KB Output is correct
26 Correct 19 ms 364 KB Output is correct
27 Correct 26 ms 492 KB Output is correct
28 Correct 21 ms 492 KB Output is correct
29 Correct 12 ms 380 KB Output is correct
30 Correct 19 ms 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 3 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 6 ms 364 KB Output is correct
17 Correct 13 ms 364 KB Output is correct
18 Correct 22 ms 364 KB Output is correct
19 Correct 16 ms 492 KB Output is correct
20 Correct 16 ms 364 KB Output is correct
21 Correct 21 ms 364 KB Output is correct
22 Correct 23 ms 492 KB Output is correct
23 Correct 15 ms 364 KB Output is correct
24 Correct 20 ms 492 KB Output is correct
25 Correct 12 ms 380 KB Output is correct
26 Correct 19 ms 364 KB Output is correct
27 Correct 26 ms 492 KB Output is correct
28 Correct 21 ms 492 KB Output is correct
29 Correct 12 ms 380 KB Output is correct
30 Correct 19 ms 380 KB Output is correct
31 Correct 53 ms 364 KB Output is correct
32 Correct 59 ms 492 KB Output is correct
33 Correct 107 ms 528 KB Output is correct
34 Correct 78 ms 516 KB Output is correct
35 Correct 141 ms 364 KB Output is correct
36 Correct 120 ms 364 KB Output is correct
37 Correct 100 ms 492 KB Output is correct
38 Correct 112 ms 364 KB Output is correct
39 Correct 92 ms 492 KB Output is correct
40 Correct 78 ms 364 KB Output is correct
41 Correct 86 ms 492 KB Output is correct
42 Correct 125 ms 364 KB Output is correct
43 Correct 82 ms 492 KB Output is correct
44 Correct 94 ms 492 KB Output is correct
45 Correct 112 ms 492 KB Output is correct
46 Correct 106 ms 364 KB Output is correct
47 Correct 60 ms 492 KB Output is correct
48 Correct 95 ms 492 KB Output is correct
49 Correct 86 ms 492 KB Output is correct
50 Correct 90 ms 364 KB Output is correct
51 Correct 86 ms 492 KB Output is correct
52 Correct 88 ms 560 KB Output is correct
53 Correct 105 ms 492 KB Output is correct
54 Correct 93 ms 492 KB Output is correct
55 Correct 86 ms 364 KB Output is correct
56 Correct 113 ms 620 KB Output is correct
57 Correct 92 ms 492 KB Output is correct
58 Correct 84 ms 620 KB Output is correct
59 Correct 93 ms 620 KB Output is correct
60 Correct 95 ms 492 KB Output is correct