oj.uz

Submission #160582

# Submission time Handle Problem Language Result Execution time Memory
160582 2019-10-28T15:31:10 Z iefnah06 Xylophone (JOI18_xylophone) C++11
100 / 100
 119 ms 760 KB 
#include "xylophone.h"

#include<bits/stdc++.h>
using namespace std;

void solve(int N) {
	vector<int> A(N);
	vector<int> two;
	vector<int> three;
	for (int i = 0; i+1 < N; i++) {
		two.push_back(query(i+1, i+2));
	}
	for (int i = 0; i+2 < N; i++) {
		three.push_back(query(i+1, i+3));
	}
	A[0] = 0;
	A[1] = A[0] + two[0];
	for (int i = 0; i+2 < N; i++) {
		if (three[i] == two[i]) {
			A[i+2] = (A[i] < A[i+1] ? A[i+1] - two[i+1] : A[i+1] + two[i+1]);
		} else {
			assert(three[i] > two[i]);
			if (bool(A[i] < A[i+1]) == bool(two[i] + two[i+1] == three[i])) {
				A[i+2] = A[i+1] + two[i+1];
			} else {
				A[i+2] = A[i+1] - two[i+1];
			}
		}
	}

	int mi = *min_element(A.begin(), A.end());
	for (int i = 0; i < N; i++) {
		A[i] -= mi;
	}
	assert(set<int>(A.begin(), A.end()).size() == size_t(N) && *max_element(A.begin(), A.end()) == N-1);
	if (int(find(A.begin(), A.end(), 0) - A.begin()) > int(find(A.begin(), A.end(), N-1) - A.begin())) {
		for (int i = 0; i < N; i++) {
			A[i] = N - 1 - A[i];
		}
	}
	for (int i = 0; i < N; i++) {
		answer(i+1, A[i]+1);
	}
}

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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 3 ms 312 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 312 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 3 ms 248 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 3 ms 312 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 312 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 3 ms 248 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 27 ms 248 KB Output is correct
20 Correct 28 ms 504 KB Output is correct
21 Correct 16 ms 376 KB Output is correct
22 Correct 12 ms 328 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 16 ms 376 KB Output is correct
25 Correct 27 ms 248 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 24 ms 376 KB Output is correct
28 Correct 27 ms 376 KB Output is correct
29 Correct 22 ms 376 KB Output is correct
30 Correct 20 ms 424 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 3 ms 312 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 4 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 3 ms 312 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 3 ms 248 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 27 ms 248 KB Output is correct
20 Correct 28 ms 504 KB Output is correct
21 Correct 16 ms 376 KB Output is correct
22 Correct 12 ms 328 KB Output is correct
23 Correct 23 ms 376 KB Output is correct
24 Correct 16 ms 376 KB Output is correct
25 Correct 27 ms 248 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 24 ms 376 KB Output is correct
28 Correct 27 ms 376 KB Output is correct
29 Correct 22 ms 376 KB Output is correct
30 Correct 20 ms 424 KB Output is correct
31 Correct 44 ms 376 KB Output is correct
32 Correct 68 ms 376 KB Output is correct
33 Correct 47 ms 708 KB Output is correct
34 Correct 108 ms 504 KB Output is correct
35 Correct 102 ms 628 KB Output is correct
36 Correct 61 ms 632 KB Output is correct
37 Correct 119 ms 632 KB Output is correct
38 Correct 111 ms 620 KB Output is correct
39 Correct 108 ms 620 KB Output is correct
40 Correct 114 ms 552 KB Output is correct
41 Correct 106 ms 544 KB Output is correct
42 Correct 93 ms 540 KB Output is correct
43 Correct 113 ms 624 KB Output is correct
44 Correct 89 ms 760 KB Output is correct
45 Correct 99 ms 628 KB Output is correct
46 Correct 106 ms 620 KB Output is correct
47 Correct 117 ms 632 KB Output is correct
48 Correct 111 ms 628 KB Output is correct
49 Correct 99 ms 620 KB Output is correct
50 Correct 103 ms 552 KB Output is correct
51 Correct 55 ms 632 KB Output is correct
52 Correct 108 ms 624 KB Output is correct
53 Correct 103 ms 620 KB Output is correct
54 Correct 95 ms 552 KB Output is correct
55 Correct 106 ms 520 KB Output is correct
56 Correct 97 ms 512 KB Output is correct
57 Correct 109 ms 552 KB Output is correct
58 Correct 106 ms 608 KB Output is correct
59 Correct 101 ms 632 KB Output is correct
60 Correct 109 ms 552 KB Output is correct