oj.uz

Submission #894032

# Submission time Handle Problem Language Result Execution time Memory
894032 2023-12-27T20:29:31 Z vovik Xylophone (JOI18_xylophone) C++17
100 / 100
 61 ms 600 KB 
void solve(int N);
int query(int s, int t);
void answer(int i, int a);

#include <bits/stdc++.h>

void solve(int N) {
	std::vector<int> a(N + 1), b(N), c(N - 1);
	for (int i = 1; i < N; ++i) b[i] = query(i, i + 1);
	for (int i = 1; i + 1 < N; ++i) c[i] = query(i, i + 2);
	a[2] = b[1];
	int x = 1;
	for (int i = 3; i <= N; ++i) a[i] = a[i - 1] + (x *= 1 - 2 * (c[i - 2] != b[i - 2] + b[i - 1])) * b[i - 1];
	int mx = std::max_element(a.begin() + 1, a.end()) - a.begin();
	int mn = std::min_element(a.begin() + 1, a.end()) - a.begin();
	if (mn > mx) {
		a[2] = -b[1];
		int x = -1;
		for (int i = 3; i <= N; ++i) a[i] = a[i - 1] + (x *= 1 - 2 * (c[i - 2] != b[i - 2] + b[i - 1])) * b[i - 1];
	}
	int h = *std::min_element(a.begin() + 1, a.end());
	for (int i = 1; i < a.size(); ++i) a[i] -= h - 1;
	for (int i = 1; i <= N; ++i) answer(i, a[i]);
}


#ifdef __APPLE__
#include <cstdio>
#include <cstdlib>

static const int N_MAX = 5000;
static const int Q_MAX = 10000;
static int N;
static int A[N_MAX];
static bool used[N_MAX];
static int query_c;
static int answer_c;

int query(int s, int t) {
	if(query_c >= Q_MAX) {
		printf("Wrong Answer\n");
		exit(0);
	}
	query_c++;
	if(!(1 <= s && s <= t && t <= N)) {
		printf("Wrong Answer\n");
		exit(0);
	}
	int mx = 0, mn = N + 1;
	for(int i = s - 1; i < t; i++) {
		if(mx < A[i]) {
			mx = A[i];
		}
		if(mn > A[i]) {
			mn = A[i];
		}
	}
	return mx - mn;
}

void answer(int i, int a) {
	answer_c++;
	if(!(1 <= i && i <= N)) {
		printf("Wrong Answer\n");
		exit(0);
	}
	if(!(1 <= a && a <= N)) {
		printf("Wrong Answer\n");
		exit(0);
	}
	if(used[i - 1]) {
		printf("Wrong Answer\n");
		exit(0);
	}
	if(a != A[i - 1]) {
		printf("Wrong Answer\n");
		exit(0);
	}
	used[i - 1] = true;
}

int main() {
	query_c = 0;
	answer_c = 0;
	if(scanf("%d", &N) != 1) {
		fprintf(stderr, "Error while reading input\n");
		exit(1);
	}
	for(int i = 0; i < N; i++) {
		if(scanf("%d", A + i) != 1) {
			fprintf(stderr, "Error while reading input\n");
			exit(1);
		}
		used[i] = false;
	}
	solve(N);
	if(!(answer_c == N)) {
		printf("Wrong Answer\n");
		exit(0);
	}
	printf("Accepted : %d\n", query_c);
}

#endif

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:22:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for (int i = 1; i < a.size(); ++i) a[i] -= h - 1;
      |                  ~~^~~~~~~~~~

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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 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 596 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 8 ms 340 KB Output is correct
19 Correct 11 ms 344 KB Output is correct
20 Correct 7 ms 500 KB Output is correct
21 Correct 8 ms 444 KB Output is correct
22 Correct 14 ms 448 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 9 ms 440 KB Output is correct
25 Correct 7 ms 600 KB Output is correct
26 Correct 8 ms 444 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 7 ms 448 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 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 596 KB Output is correct
17 Correct 4 ms 344 KB Output is correct
18 Correct 8 ms 340 KB Output is correct
19 Correct 11 ms 344 KB Output is correct
20 Correct 7 ms 500 KB Output is correct
21 Correct 8 ms 444 KB Output is correct
22 Correct 14 ms 448 KB Output is correct
23 Correct 9 ms 344 KB Output is correct
24 Correct 9 ms 440 KB Output is correct
25 Correct 7 ms 600 KB Output is correct
26 Correct 8 ms 444 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 9 ms 344 KB Output is correct
29 Correct 7 ms 344 KB Output is correct
30 Correct 7 ms 448 KB Output is correct
31 Correct 17 ms 440 KB Output is correct
32 Correct 30 ms 468 KB Output is correct
33 Correct 37 ms 464 KB Output is correct
34 Correct 43 ms 472 KB Output is correct
35 Correct 48 ms 468 KB Output is correct
36 Correct 40 ms 484 KB Output is correct
37 Correct 45 ms 488 KB Output is correct
38 Correct 53 ms 484 KB Output is correct
39 Correct 44 ms 488 KB Output is correct
40 Correct 42 ms 492 KB Output is correct
41 Correct 49 ms 488 KB Output is correct
42 Correct 47 ms 488 KB Output is correct
43 Correct 51 ms 488 KB Output is correct
44 Correct 48 ms 472 KB Output is correct
45 Correct 44 ms 492 KB Output is correct
46 Correct 37 ms 484 KB Output is correct
47 Correct 50 ms 472 KB Output is correct
48 Correct 44 ms 472 KB Output is correct
49 Correct 45 ms 472 KB Output is correct
50 Correct 45 ms 472 KB Output is correct
51 Correct 48 ms 476 KB Output is correct
52 Correct 47 ms 596 KB Output is correct
53 Correct 57 ms 484 KB Output is correct
54 Correct 51 ms 472 KB Output is correct
55 Correct 49 ms 472 KB Output is correct
56 Correct 61 ms 472 KB Output is correct
57 Correct 45 ms 476 KB Output is correct
58 Correct 53 ms 476 KB Output is correct
59 Correct 42 ms 484 KB Output is correct
60 Correct 44 ms 468 KB Output is correct