oj.uz

Submission #130614

# Submission time Handle Problem Language Result Execution time Memory
130614 2019-07-15T18:06:27 Z tutis Xylophone (JOI18_xylophone) C++17
100 / 100
 119 ms 504 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#include "xylophone.h"
using namespace std;
void solve(int N)
{
	int A[N + 1];
	A[1] = 0;
	A[2] = A[1] + query(1, 2);
	for (int i = 3; i <= N; i++)
	{
		int x = query(i - 1, i);
		int y = query(i - 2, i);
		if (y == x + abs(A[i - 1] - A[i - 2]))
		{
			if (A[i - 1] > A[i - 2])
				A[i] = A[i - 1] + x;
			else
				A[i] = A[i - 1] - x;
		}
		else
		{
			if (A[i - 1] < A[i - 2])
				A[i] = A[i - 1] + x;
			else
				A[i] = A[i - 1] - x;
		}
	}
	auto it1 = min_element(A + 1, A + (N + 1));
	auto itn = max_element(A + 1, A + (N + 1));
	if (it1 > itn)
	{
		for (int i = 1; i <= N; i++)
			A[i] = -A[i];
	}
	int x = *min_element(A, A + (N + 1));
	for (int i = 1; i <= N; i++)
	{
		A[i] -= x;
		A[i]++;
		answer(i, A[i]);
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 252 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 380 KB Output is correct
15 Correct 3 ms 248 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 252 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 380 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 13 ms 376 KB Output is correct
18 Correct 22 ms 248 KB Output is correct
19 Correct 23 ms 248 KB Output is correct
20 Correct 21 ms 248 KB Output is correct
21 Correct 19 ms 248 KB Output is correct
22 Correct 20 ms 316 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 22 ms 376 KB Output is correct
25 Correct 21 ms 248 KB Output is correct
26 Correct 28 ms 248 KB Output is correct
27 Correct 29 ms 376 KB Output is correct
28 Correct 12 ms 404 KB Output is correct
29 Correct 22 ms 248 KB Output is correct
30 Correct 20 ms 248 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 4 ms 248 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 252 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 380 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 13 ms 376 KB Output is correct
18 Correct 22 ms 248 KB Output is correct
19 Correct 23 ms 248 KB Output is correct
20 Correct 21 ms 248 KB Output is correct
21 Correct 19 ms 248 KB Output is correct
22 Correct 20 ms 316 KB Output is correct
23 Correct 23 ms 248 KB Output is correct
24 Correct 22 ms 376 KB Output is correct
25 Correct 21 ms 248 KB Output is correct
26 Correct 28 ms 248 KB Output is correct
27 Correct 29 ms 376 KB Output is correct
28 Correct 12 ms 404 KB Output is correct
29 Correct 22 ms 248 KB Output is correct
30 Correct 20 ms 248 KB Output is correct
31 Correct 31 ms 376 KB Output is correct
32 Correct 66 ms 376 KB Output is correct
33 Correct 89 ms 376 KB Output is correct
34 Correct 79 ms 376 KB Output is correct
35 Correct 104 ms 328 KB Output is correct
36 Correct 95 ms 460 KB Output is correct
37 Correct 104 ms 332 KB Output is correct
38 Correct 69 ms 504 KB Output is correct
39 Correct 109 ms 248 KB Output is correct
40 Correct 119 ms 248 KB Output is correct
41 Correct 54 ms 404 KB Output is correct
42 Correct 105 ms 248 KB Output is correct
43 Correct 114 ms 248 KB Output is correct
44 Correct 96 ms 320 KB Output is correct
45 Correct 106 ms 376 KB Output is correct
46 Correct 71 ms 328 KB Output is correct
47 Correct 97 ms 408 KB Output is correct
48 Correct 106 ms 456 KB Output is correct
49 Correct 102 ms 448 KB Output is correct
50 Correct 102 ms 328 KB Output is correct
51 Correct 108 ms 432 KB Output is correct
52 Correct 113 ms 248 KB Output is correct
53 Correct 105 ms 424 KB Output is correct
54 Correct 99 ms 332 KB Output is correct
55 Correct 72 ms 412 KB Output is correct
56 Correct 96 ms 376 KB Output is correct
57 Correct 108 ms 248 KB Output is correct
58 Correct 107 ms 376 KB Output is correct
59 Correct 98 ms 380 KB Output is correct
60 Correct 104 ms 252 KB Output is correct