oj.uz

Submission #740070

# Submission time Handle Problem Language Result Execution time Memory
740070 2023-05-12T04:59:07 Z maeola Xylophone (JOI18_xylophone) C++17
100 / 100
 107 ms 444 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

static int g1[5005], g2[5005], A[5005];

void solve(int N)
{
	for (int i = 1; i <= N - 1; i++)
		g1[i] = query(i, i + 1);
	for (int i = 1; i <= N - 2; i++)
		g2[i] = query(i, i + 2);

	A[1] = 0;
	A[2] = g1[1];
	for (int i = 3; i <= N; i++)
	{
		// A[i - 1] + g1[i - 1]
		// A[i - 1] - g1[i - 1]
		if (g1[i - 2] + g1[i - 1] == g2[i - 2])
		{
			if (A[i - 1] > A[i - 2])
			{
				A[i] = A[i - 1] + g1[i - 1];
			}else{
				A[i] = A[i - 1] - g1[i - 1];
			}
		}
		else
		{
			if (A[i - 1] > A[i - 2])
			{
				A[i] = A[i - 1] - g1[i - 1];
			}else{
				A[i] = A[i - 1] + g1[i - 1];
			}
		}
	}
	auto mni = min_element(A + 1, A + 1 + N) - A;
	auto mxi = max_element(A + 1, A + 1 + N) - A;
	if (mni > mxi)
	{
		for (int i = 1; i <= N; i++)
			A[i] = -A[i];
	}
	auto mn = *min_element(A + 1, A + 1 + N);
	for (int i = 1; i <= N; i++)
		answer(i, A[i] - mn + 1);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 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 1 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 1 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 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 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 1 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 1 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 4 ms 208 KB Output is correct
17 Correct 7 ms 308 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 16 ms 208 KB Output is correct
20 Correct 15 ms 308 KB Output is correct
21 Correct 27 ms 296 KB Output is correct
22 Correct 23 ms 296 KB Output is correct
23 Correct 19 ms 208 KB Output is correct
24 Correct 19 ms 300 KB Output is correct
25 Correct 15 ms 312 KB Output is correct
26 Correct 16 ms 300 KB Output is correct
27 Correct 20 ms 300 KB Output is correct
28 Correct 18 ms 208 KB Output is correct
29 Correct 24 ms 292 KB Output is correct
30 Correct 18 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 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 1 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 1 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 4 ms 208 KB Output is correct
17 Correct 7 ms 308 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 16 ms 208 KB Output is correct
20 Correct 15 ms 308 KB Output is correct
21 Correct 27 ms 296 KB Output is correct
22 Correct 23 ms 296 KB Output is correct
23 Correct 19 ms 208 KB Output is correct
24 Correct 19 ms 300 KB Output is correct
25 Correct 15 ms 312 KB Output is correct
26 Correct 16 ms 300 KB Output is correct
27 Correct 20 ms 300 KB Output is correct
28 Correct 18 ms 208 KB Output is correct
29 Correct 24 ms 292 KB Output is correct
30 Correct 18 ms 208 KB Output is correct
31 Correct 38 ms 296 KB Output is correct
32 Correct 51 ms 336 KB Output is correct
33 Correct 92 ms 308 KB Output is correct
34 Correct 71 ms 292 KB Output is correct
35 Correct 86 ms 312 KB Output is correct
36 Correct 81 ms 288 KB Output is correct
37 Correct 84 ms 444 KB Output is correct
38 Correct 100 ms 328 KB Output is correct
39 Correct 35 ms 440 KB Output is correct
40 Correct 75 ms 304 KB Output is correct
41 Correct 87 ms 432 KB Output is correct
42 Correct 103 ms 424 KB Output is correct
43 Correct 65 ms 400 KB Output is correct
44 Correct 104 ms 296 KB Output is correct
45 Correct 90 ms 316 KB Output is correct
46 Correct 107 ms 300 KB Output is correct
47 Correct 88 ms 296 KB Output is correct
48 Correct 95 ms 340 KB Output is correct
49 Correct 88 ms 324 KB Output is correct
50 Correct 90 ms 324 KB Output is correct
51 Correct 83 ms 328 KB Output is correct
52 Correct 83 ms 424 KB Output is correct
53 Correct 85 ms 304 KB Output is correct
54 Correct 81 ms 336 KB Output is correct
55 Correct 92 ms 328 KB Output is correct
56 Correct 86 ms 388 KB Output is correct
57 Correct 103 ms 308 KB Output is correct
58 Correct 99 ms 336 KB Output is correct
59 Correct 96 ms 296 KB Output is correct
60 Correct 76 ms 328 KB Output is correct