oj.uz

Submission #335823

# Submission time Handle Problem Language Result Execution time Memory
335823 2020-12-14T04:39:50 Z Mo_TOI_I_am_Garbage Xylophone (JOI18_xylophone) C++14
100 / 100
 128 ms 620 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;

void solve(int n)
{
	int arr[2][n + 50], res[n + 50];
	res[1] = 0;
	for(int i=1; i <= n; i ++)
	{
		if(i + 1 <= n) arr[0][i] = query(i, i + 1);
		if(i + 1 <= n && i - 1 >= 1) arr[1][i] = query(i - 1, i + 1);
	}
	res[2] = arr[0][1];
	int d[2] = {1, -1}, now = false;
	for(int i=3; i <= n; i ++)
	{
		if(arr[0][i - 2] + arr[0][i - 1] != arr[1][i - 1]) now = !now;
		res[i] = res[i - 1] + arr[0][i - 1] * d[now];
	}
	int mx = 1, mi = 1;
	for(int i=1; i <= n; i ++)
	{
		if(res[i] > res[mx]) mx = i;
		if(res[i] < res[mi]) mi = i;
	}
	if(mx < mi)
	{
		for(int i=1; i <= n; i ++)
			res[i] *= -1;
	}
	mx = 0;
	for(int i=1; i <= n; i ++)
		mx = max(mx, res[i]);
	// for(int i=1; i <= n; i ++)
	// 	cout << res[i] + n - mx << ' ';
	// cout << '\n';
	for(int i=1; i <= n; i ++)
		answer(i, res[i] + n - mx);
}


// static const int N_MAX = 5000;
// static const int Q_MAX = 10000;
// static int N;
// static int A[N_MAX];
// static bool used[N_MAX];
// static int query_c;
// static int answer_c;

// // int query(int s, int t) {
// // 	if(query_c >= Q_MAX) {
// // 		printf("Wrong Answer\n");
// // 		exit(0);
// // 	}
// // 	query_c++;
// // 	if(!(1 <= s && s <= t && t <= N)) {
// // 		printf("Wrong Answer\n");
// // 		exit(0);
// // 	}
// // 	int mx = 0, mn = N + 1;
// // 	for(int i = s - 1; i < t; i++) {
// // 		if(mx < A[i]) {
// // 			mx = A[i];
// // 		}
// // 		if(mn > A[i]) {
// // 			mn = A[i];
// // 		}
// // 	}
// // 	return mx - mn;
// // }

// // // void answer(int i, int a) {
// // // 	answer_c++;
// // // 	if(!(1 <= i && i <= N)) {
// // // 		printf("Wrong Answer\n");
// // // 		exit(0);
// // // 	}
// // // 	if(!(1 <= a && a <= N)) {
// // // 		printf("Wrong Answer\n");
// // // 		exit(0);
// // // 	}
// // // 	if(used[i - 1]) {
// // // 		printf("Wrong Answer\n");
// // // 		exit(0);
// // // 	}
// // // 	if(a != A[i - 1]) {
// // // 		printf("Wrong Answer\n");
// // // 		exit(0);
// // // 	}
// // // 	used[i - 1] = true;
// // // }

// // // int main() {
// // // 	query_c = 0;
// // // 	answer_c = 0;
// // // 	if(scanf("%d", &N) != 1) {
// // // 		fprintf(stderr, "Error while reading input\n");
// // // 		exit(1);
// // // 	}
// // // 	for(int i = 0; i < N; i++) {
// // // 		if(scanf("%d", A + i) != 1) {
// // // 			fprintf(stderr, "Error while reading input\n");
// // // 			exit(1);
// // // 		}
// // // 		used[i] = false;
// // // 	}
// // // 	solve(N);
// // // 	if(!(answer_c == N)) {
// // // 		printf("Wrong Answer\n");
// // // 		exit(0);
// // // 	}
// // // 	printf("Accepted : %d\n", query_c);
// // // }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 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 3 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 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 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 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 3 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 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 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 14 ms 492 KB Output is correct
19 Correct 20 ms 364 KB Output is correct
20 Correct 22 ms 364 KB Output is correct
21 Correct 18 ms 364 KB Output is correct
22 Correct 18 ms 364 KB Output is correct
23 Correct 20 ms 364 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 23 ms 364 KB Output is correct
26 Correct 18 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 20 ms 492 KB Output is correct
29 Correct 10 ms 380 KB Output is correct
30 Correct 18 ms 364 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 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 3 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 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 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 14 ms 492 KB Output is correct
19 Correct 20 ms 364 KB Output is correct
20 Correct 22 ms 364 KB Output is correct
21 Correct 18 ms 364 KB Output is correct
22 Correct 18 ms 364 KB Output is correct
23 Correct 20 ms 364 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 23 ms 364 KB Output is correct
26 Correct 18 ms 384 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 20 ms 492 KB Output is correct
29 Correct 10 ms 380 KB Output is correct
30 Correct 18 ms 364 KB Output is correct
31 Correct 42 ms 364 KB Output is correct
32 Correct 54 ms 400 KB Output is correct
33 Correct 82 ms 532 KB Output is correct
34 Correct 52 ms 380 KB Output is correct
35 Correct 93 ms 364 KB Output is correct
36 Correct 84 ms 364 KB Output is correct
37 Correct 97 ms 512 KB Output is correct
38 Correct 93 ms 364 KB Output is correct
39 Correct 95 ms 620 KB Output is correct
40 Correct 87 ms 500 KB Output is correct
41 Correct 85 ms 364 KB Output is correct
42 Correct 96 ms 364 KB Output is correct
43 Correct 96 ms 364 KB Output is correct
44 Correct 99 ms 532 KB Output is correct
45 Correct 99 ms 364 KB Output is correct
46 Correct 85 ms 364 KB Output is correct
47 Correct 87 ms 492 KB Output is correct
48 Correct 94 ms 364 KB Output is correct
49 Correct 98 ms 364 KB Output is correct
50 Correct 90 ms 364 KB Output is correct
51 Correct 74 ms 488 KB Output is correct
52 Correct 122 ms 364 KB Output is correct
53 Correct 87 ms 364 KB Output is correct
54 Correct 81 ms 500 KB Output is correct
55 Correct 128 ms 364 KB Output is correct
56 Correct 104 ms 364 KB Output is correct
57 Correct 93 ms 364 KB Output is correct
58 Correct 121 ms 404 KB Output is correct
59 Correct 92 ms 364 KB Output is correct
60 Correct 75 ms 492 KB Output is correct