oj.uz

Submission #882086

# Submission time Handle Problem Language Result Execution time Memory
882086 2023-12-02T15:05:30 Z Sharky Xylophone (JOI18_xylophone) C++17
100 / 100
 69 ms 740 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N) {
	vector<int> di(N + 1);
	for (int i = 1; i <= N - 1; i++) di[i] = query(i, i + 1);
	vector<int> s(N + 1, -1);
	for (int i = 1; i <= N - 2; i++) {
		int q = query(i, i + 2);
		if (di[i] + di[i + 1] == q) s[i + 1] = s[i];
		else s[i + 1] = (s[i] == -1 ? 1 : -1);
	}
	vector<int> a(N + 1, 0);
	a[1] = 0;
	for (int i = 2; i <= N; i++) {
		a[i] = a[i - 1] + di[i - 1] * s[i - 1];
	}
	int mn = 0;
	for (int i = 1; i <= N; i++) mn = min(mn, a[i]);
	mn = -mn + 1;
	int op = mn;
	int mn_idx = 0, mx_idx = 0;
	mn = N + 1;
	int mx = 0;
	for (int i = 1; i <= N; i++) {
		a[i] += op;
		if (a[i] < mn) mn = a[i], mn_idx = i;
		if (a[i] > mx) mx = a[i], mx_idx = i;
	}
	if (mx_idx < mn_idx) {
		for (int i = 1; i <= N; i++) a[i] = N + 1 - a[i];
	}
	for (int i = 1; i <= N; i++) answer(i, a[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 4 ms 440 KB Output is correct
18 Correct 7 ms 448 KB Output is correct
19 Correct 7 ms 700 KB Output is correct
20 Correct 7 ms 696 KB Output is correct
21 Correct 12 ms 444 KB Output is correct
22 Correct 8 ms 696 KB Output is correct
23 Correct 8 ms 700 KB Output is correct
24 Correct 9 ms 696 KB Output is correct
25 Correct 9 ms 692 KB Output is correct
26 Correct 7 ms 440 KB Output is correct
27 Correct 7 ms 696 KB Output is correct
28 Correct 10 ms 444 KB Output is correct
29 Correct 10 ms 700 KB Output is correct
30 Correct 11 ms 688 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 4 ms 440 KB Output is correct
18 Correct 7 ms 448 KB Output is correct
19 Correct 7 ms 700 KB Output is correct
20 Correct 7 ms 696 KB Output is correct
21 Correct 12 ms 444 KB Output is correct
22 Correct 8 ms 696 KB Output is correct
23 Correct 8 ms 700 KB Output is correct
24 Correct 9 ms 696 KB Output is correct
25 Correct 9 ms 692 KB Output is correct
26 Correct 7 ms 440 KB Output is correct
27 Correct 7 ms 696 KB Output is correct
28 Correct 10 ms 444 KB Output is correct
29 Correct 10 ms 700 KB Output is correct
30 Correct 11 ms 688 KB Output is correct
31 Correct 22 ms 680 KB Output is correct
32 Correct 28 ms 696 KB Output is correct
33 Correct 54 ms 684 KB Output is correct
34 Correct 54 ms 704 KB Output is correct
35 Correct 52 ms 684 KB Output is correct
36 Correct 57 ms 532 KB Output is correct
37 Correct 43 ms 452 KB Output is correct
38 Correct 51 ms 688 KB Output is correct
39 Correct 47 ms 704 KB Output is correct
40 Correct 52 ms 452 KB Output is correct
41 Correct 49 ms 740 KB Output is correct
42 Correct 49 ms 596 KB Output is correct
43 Correct 43 ms 720 KB Output is correct
44 Correct 48 ms 528 KB Output is correct
45 Correct 49 ms 520 KB Output is correct
46 Correct 53 ms 468 KB Output is correct
47 Correct 49 ms 456 KB Output is correct
48 Correct 44 ms 452 KB Output is correct
49 Correct 58 ms 536 KB Output is correct
50 Correct 69 ms 488 KB Output is correct
51 Correct 48 ms 452 KB Output is correct
52 Correct 55 ms 700 KB Output is correct
53 Correct 37 ms 468 KB Output is correct
54 Correct 40 ms 456 KB Output is correct
55 Correct 46 ms 684 KB Output is correct
56 Correct 46 ms 448 KB Output is correct
57 Correct 45 ms 504 KB Output is correct
58 Correct 56 ms 452 KB Output is correct
59 Correct 48 ms 472 KB Output is correct
60 Correct 50 ms 684 KB Output is correct