oj.uz

Submission #736071

# Submission time Handle Problem Language Result Execution time Memory
736071 2023-05-05T07:45:48 Z rxlfd314 Xylophone (JOI18_xylophone) C++17
100 / 100
 103 ms 384 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N) {
	int A[N+1], B[N+1];
	
	A[1] = B[1] = 500069;
	int maxa = 1, maxb = 1, mina = 1, minb = 1;
	for (int i = 2; i <= N; i++) {
		int q1 = query(i-1, i);
		if (i == 2) {
			A[2] = A[1] + q1;
			B[2] = B[1] - q1;
		} else {
			int q2 = query(i-2, i);
			if (A[i-2] < A[i-1]) {
				if (q2 == q1 + A[i-1] - A[i-2]) {
					A[i] = A[i-1] + q1;
					B[i] = B[i-1] - q1;
				} else {
					A[i] = A[i-1] - q1;
					B[i] = B[i-1] + q1;
				}
			} else {
				if (q2 == q1 + A[i-2] - A[i-1]) {
					A[i] = A[i-1] - q1;
					B[i] = B[i-1] + q1;
				} else {
					A[i] = A[i-1] + q1;
					B[i] = B[i-1] - q1;
				}
			}
		}
		mina = A[mina] > A[i] ? i : mina;
		minb = B[minb] > B[i] ? i : minb;
		maxa = A[maxa] < A[i] ? i : maxa;
		maxb = B[maxb] < B[i] ? i : maxb;
	}
	
	if (mina < maxa) {
		int sub = A[mina] - 1;
		for (int i = 1; i <= N; i++) {
			answer(i, A[i] - sub);
		}
	} else {
		int sub = B[minb] - 1;
		for (int i = 1; i <= N; i++) {
			answer(i, B[i] - sub);
		}
	}
}

Subtask #1
11.0 / 11.0

# 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 1 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 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 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 15 ms 208 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 14 ms 208 KB Output is correct
22 Correct 16 ms 208 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 16 ms 208 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 25 ms 208 KB Output is correct
28 Correct 18 ms 284 KB Output is correct
29 Correct 19 ms 208 KB Output is correct
30 Correct 17 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 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 15 ms 208 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 14 ms 208 KB Output is correct
22 Correct 16 ms 208 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 16 ms 208 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 25 ms 208 KB Output is correct
28 Correct 18 ms 284 KB Output is correct
29 Correct 19 ms 208 KB Output is correct
30 Correct 17 ms 208 KB Output is correct
31 Correct 43 ms 292 KB Output is correct
32 Correct 53 ms 300 KB Output is correct
33 Correct 77 ms 312 KB Output is correct
34 Correct 93 ms 316 KB Output is correct
35 Correct 96 ms 316 KB Output is correct
36 Correct 74 ms 320 KB Output is correct
37 Correct 76 ms 336 KB Output is correct
38 Correct 56 ms 336 KB Output is correct
39 Correct 79 ms 328 KB Output is correct
40 Correct 99 ms 316 KB Output is correct
41 Correct 71 ms 328 KB Output is correct
42 Correct 102 ms 356 KB Output is correct
43 Correct 79 ms 384 KB Output is correct
44 Correct 92 ms 336 KB Output is correct
45 Correct 92 ms 336 KB Output is correct
46 Correct 78 ms 312 KB Output is correct
47 Correct 71 ms 316 KB Output is correct
48 Correct 79 ms 316 KB Output is correct
49 Correct 86 ms 336 KB Output is correct
50 Correct 83 ms 336 KB Output is correct
51 Correct 75 ms 328 KB Output is correct
52 Correct 103 ms 316 KB Output is correct
53 Correct 96 ms 336 KB Output is correct
54 Correct 48 ms 336 KB Output is correct
55 Correct 75 ms 312 KB Output is correct
56 Correct 83 ms 336 KB Output is correct
57 Correct 45 ms 316 KB Output is correct
58 Correct 80 ms 316 KB Output is correct
59 Correct 80 ms 336 KB Output is correct
60 Correct 50 ms 312 KB Output is correct