Submission #704247

# Submission time Handle Problem Language Result Execution time Memory
704247 2023-03-02T01:46:56 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
97 ms 332 KB
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
typedef long long ll;
int ask(int a, int b){
	int l = min(a, b) + 1, r = max(a, b) + 1;
	return query(l, r);
}
void ans(int idx, int val){
	answer(idx+1, val+1);
}
void solve(int n){
	vector<int> result(n);
	result[1] = ask(0, 1);
	int pdist = result[1];
	for (int i=2; i<n; i++){
		int to1 = ask(i-1, i);
		int to2 = ask(i-2, i);
		if (to1 + pdist == to2){
			if (result[i-2] < result[i-1])
				result[i] = result[i-1] + to1;
			else
				result[i] = result[i-1] - to1;
		}
		else{
			if (result[i-2] < result[i-1])
				result[i] = result[i-1] - to1;
			else
				result[i] = result[i-1] + to1;
		}
		pdist = to1;
	}
	int zrelem = min_element(result.begin(), result.end()) - result.begin();
	int nelem = max_element(result.begin(), result.end()) - result.begin();
	if (zrelem > nelem){
		for (int i=0; i<n; i++) result[i] = -result[i];
	}
	int offset = *min_element(result.begin(), result.end());
	for (int i=0; i<n; i++){
		result[i] -= offset;
	}
	for (int i=0; i<n; i++) ans(i, result[i]);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 22 ms 208 KB Output is correct
20 Correct 15 ms 284 KB Output is correct
21 Correct 15 ms 296 KB Output is correct
22 Correct 18 ms 208 KB Output is correct
23 Correct 16 ms 284 KB Output is correct
24 Correct 17 ms 208 KB Output is correct
25 Correct 19 ms 208 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 16 ms 208 KB Output is correct
29 Correct 18 ms 296 KB Output is correct
30 Correct 15 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 22 ms 208 KB Output is correct
20 Correct 15 ms 284 KB Output is correct
21 Correct 15 ms 296 KB Output is correct
22 Correct 18 ms 208 KB Output is correct
23 Correct 16 ms 284 KB Output is correct
24 Correct 17 ms 208 KB Output is correct
25 Correct 19 ms 208 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 16 ms 208 KB Output is correct
29 Correct 18 ms 296 KB Output is correct
30 Correct 15 ms 208 KB Output is correct
31 Correct 37 ms 288 KB Output is correct
32 Correct 58 ms 292 KB Output is correct
33 Correct 71 ms 292 KB Output is correct
34 Correct 97 ms 296 KB Output is correct
35 Correct 79 ms 300 KB Output is correct
36 Correct 83 ms 308 KB Output is correct
37 Correct 73 ms 312 KB Output is correct
38 Correct 93 ms 300 KB Output is correct
39 Correct 56 ms 332 KB Output is correct
40 Correct 89 ms 324 KB Output is correct
41 Correct 68 ms 296 KB Output is correct
42 Correct 72 ms 312 KB Output is correct
43 Correct 90 ms 304 KB Output is correct
44 Correct 92 ms 316 KB Output is correct
45 Correct 91 ms 296 KB Output is correct
46 Correct 84 ms 296 KB Output is correct
47 Correct 77 ms 296 KB Output is correct
48 Correct 70 ms 300 KB Output is correct
49 Correct 93 ms 300 KB Output is correct
50 Correct 75 ms 300 KB Output is correct
51 Correct 85 ms 304 KB Output is correct
52 Correct 78 ms 316 KB Output is correct
53 Correct 78 ms 304 KB Output is correct
54 Correct 94 ms 328 KB Output is correct
55 Correct 82 ms 308 KB Output is correct
56 Correct 59 ms 308 KB Output is correct
57 Correct 51 ms 300 KB Output is correct
58 Correct 95 ms 328 KB Output is correct
59 Correct 82 ms 328 KB Output is correct
60 Correct 93 ms 296 KB Output is correct