oj.uz

Submission #763682

# Submission time Handle Problem Language Result Execution time Memory
763682 2023-06-22T15:31:39 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 94 ms 428 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

const int maxn = 5e3 + 5;

int arr[maxn];

void solve(int N){
	arr[2] = query(1, 2);
	bool is_up = true;
	for(int i = 3; i <= N; i++){
		int dou = query(i - 1, i);
		int tri = query(i - 2, i);
		int pre = abs(arr[i - 1] - arr[i - 2]);
		if(tri != dou + pre){
			is_up ^= 1;
		}
		if(is_up){
			arr[i] = arr[i - 1] + dou;
		}else{
			arr[i] = arr[i - 1] - dou;
		}
	}

	int pos_min = std::min_element(arr + 1, arr + N + 1) - arr;
	int pos_max = std::max_element(arr + 1, arr + N + 1) - arr;

	// for(int i = 1; i <= N; i++){
	// 	std::cout << arr[i];
	// 	if(i != N) std::cout << " ";
	// 	else std::cout << std::endl;
	// }

	if(pos_min > pos_max){
		int diff = *(std::max_element(arr + 1, arr + N + 1));
		for(int i = 1; i <= N; i++){
			answer(i, diff - arr[i] + 1);
		}
	}else{
		int diff = *(std::min_element(arr + 1, arr + N + 1));
		for(int i = 1; i <= N; i++){
			answer(i, arr[i] - diff + 1);
		}
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
6 Correct 2 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 3 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 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
6 Correct 2 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 3 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 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 7 ms 308 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 17 ms 208 KB Output is correct
20 Correct 12 ms 300 KB Output is correct
21 Correct 18 ms 284 KB Output is correct
22 Correct 17 ms 280 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 11 ms 308 KB Output is correct
25 Correct 12 ms 300 KB Output is correct
26 Correct 17 ms 284 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 16 ms 208 KB Output is correct
29 Correct 13 ms 208 KB Output is correct
30 Correct 17 ms 284 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 208 KB Output is correct
6 Correct 2 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 3 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 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 7 ms 308 KB Output is correct
18 Correct 13 ms 208 KB Output is correct
19 Correct 17 ms 208 KB Output is correct
20 Correct 12 ms 300 KB Output is correct
21 Correct 18 ms 284 KB Output is correct
22 Correct 17 ms 280 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 11 ms 308 KB Output is correct
25 Correct 12 ms 300 KB Output is correct
26 Correct 17 ms 284 KB Output is correct
27 Correct 13 ms 208 KB Output is correct
28 Correct 16 ms 208 KB Output is correct
29 Correct 13 ms 208 KB Output is correct
30 Correct 17 ms 284 KB Output is correct
31 Correct 44 ms 288 KB Output is correct
32 Correct 39 ms 296 KB Output is correct
33 Correct 55 ms 300 KB Output is correct
34 Correct 71 ms 428 KB Output is correct
35 Correct 74 ms 284 KB Output is correct
36 Correct 91 ms 288 KB Output is correct
37 Correct 94 ms 296 KB Output is correct
38 Correct 90 ms 328 KB Output is correct
39 Correct 68 ms 300 KB Output is correct
40 Correct 59 ms 296 KB Output is correct
41 Correct 63 ms 292 KB Output is correct
42 Correct 89 ms 304 KB Output is correct
43 Correct 84 ms 284 KB Output is correct
44 Correct 75 ms 296 KB Output is correct
45 Correct 64 ms 296 KB Output is correct
46 Correct 65 ms 304 KB Output is correct
47 Correct 87 ms 300 KB Output is correct
48 Correct 82 ms 288 KB Output is correct
49 Correct 76 ms 420 KB Output is correct
50 Correct 76 ms 328 KB Output is correct
51 Correct 59 ms 304 KB Output is correct
52 Correct 81 ms 292 KB Output is correct
53 Correct 72 ms 300 KB Output is correct
54 Correct 90 ms 300 KB Output is correct
55 Correct 33 ms 304 KB Output is correct
56 Correct 75 ms 288 KB Output is correct
57 Correct 66 ms 424 KB Output is correct
58 Correct 64 ms 304 KB Output is correct
59 Correct 85 ms 292 KB Output is correct
60 Correct 71 ms 288 KB Output is correct