oj.uz

Submission #704388

# Submission time Handle Problem Language Result Execution time Memory
704388 2023-03-02T05:11:22 Z hollwo_pelw Xylophone (JOI18_xylophone) C++17
100 / 100
 95 ms 464 KB 
#include <bits/stdc++.h>
using namespace std;

#ifndef hollwo_pelw_local
#	include "xylophone.h"
#else
	namespace {
		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;
	}

#endif

int p[5005];

void solve(int n) {
	p[2] = query(1, 2);
	for (int i = 3, last = p[2]; i <= n; i++) {
		int a = query(i - 1, i);
		int b = query(i - 2, i);
		if (last + a == b) {
			if (p[i - 1] > p[i - 2])
				p[i] = p[i - 1] + a;
			else
				p[i] = p[i - 1] - a;
		} else {
			if (p[i - 1] > p[i - 2])
				p[i] = p[i - 1] - a;
			else
				p[i] = p[i - 1] + a;	
		}
		last = a;
	}
	int off = *min_element(p + 1, p + n + 1);
	for (int i = 1; i <= n; i++)
		p[i] -= off - 1;
	if (max_element(p + 1, p + n + 1) < min_element(p + 1, p + n + 1)) {
		for (int i = 1; i <= n; i++)
			p[i] = n + 1 - p[i];
	}
	for (int i = 1; i <= n; i++)
		answer(i, p[i]);
}

#ifdef hollwo_pelw_local

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 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 1 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 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 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 5 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 14 ms 296 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 8 ms 300 KB Output is correct
21 Correct 13 ms 284 KB Output is correct
22 Correct 17 ms 284 KB Output is correct
23 Correct 15 ms 292 KB Output is correct
24 Correct 25 ms 208 KB Output is correct
25 Correct 19 ms 304 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 17 ms 296 KB Output is correct
28 Correct 18 ms 284 KB Output is correct
29 Correct 19 ms 292 KB Output is correct
30 Correct 18 ms 308 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 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 5 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 14 ms 296 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 8 ms 300 KB Output is correct
21 Correct 13 ms 284 KB Output is correct
22 Correct 17 ms 284 KB Output is correct
23 Correct 15 ms 292 KB Output is correct
24 Correct 25 ms 208 KB Output is correct
25 Correct 19 ms 304 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 17 ms 296 KB Output is correct
28 Correct 18 ms 284 KB Output is correct
29 Correct 19 ms 292 KB Output is correct
30 Correct 18 ms 308 KB Output is correct
31 Correct 38 ms 300 KB Output is correct
32 Correct 37 ms 296 KB Output is correct
33 Correct 58 ms 296 KB Output is correct
34 Correct 78 ms 292 KB Output is correct
35 Correct 64 ms 464 KB Output is correct
36 Correct 42 ms 336 KB Output is correct
37 Correct 81 ms 300 KB Output is correct
38 Correct 73 ms 300 KB Output is correct
39 Correct 84 ms 304 KB Output is correct
40 Correct 72 ms 416 KB Output is correct
41 Correct 94 ms 304 KB Output is correct
42 Correct 89 ms 300 KB Output is correct
43 Correct 71 ms 424 KB Output is correct
44 Correct 95 ms 296 KB Output is correct
45 Correct 88 ms 424 KB Output is correct
46 Correct 92 ms 456 KB Output is correct
47 Correct 63 ms 308 KB Output is correct
48 Correct 89 ms 328 KB Output is correct
49 Correct 88 ms 288 KB Output is correct
50 Correct 77 ms 304 KB Output is correct
51 Correct 56 ms 300 KB Output is correct
52 Correct 51 ms 296 KB Output is correct
53 Correct 74 ms 296 KB Output is correct
54 Correct 75 ms 292 KB Output is correct
55 Correct 90 ms 300 KB Output is correct
56 Correct 64 ms 296 KB Output is correct
57 Correct 76 ms 296 KB Output is correct
58 Correct 91 ms 304 KB Output is correct
59 Correct 85 ms 416 KB Output is correct
60 Correct 92 ms 292 KB Output is correct