oj.uz

Submission #71286

# Submission time Handle Problem Language Result Execution time Memory
71286 2018-08-24T10:00:06 Z ekrem Xylophone (JOI18_xylophone) C++
100 / 100
 143 ms 956 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define orta ((bas + son + 1)/2)
#define NMAX 1000005
using namespace std;

// 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) {
// 	cout << a << " oldu" << endl;
// 	answer_c++;
// 	if(!(1 <= i && i <= N)) {
// 		printf("Wrong Answerwww\n");
// 		exit(0);
// 	}
// 	if(!(1 <= a && a <= N)) {
// 		printf("Wrong Answerqqqq\n");
// 		exit(0);
// 	}
// 	if(used[i - 1]) {
// 		printf("Wrong Answerasd\n");
// 		exit(0);
// 	}
// 	if(a != A[i - 1]) {
// 		printf("Wrong Answerrrr\n");
// 		exit(0);
// 	}
// 	used[i - 1] = true;
// }

int a[NMAX], v[NMAX];

void solve(int n) {
	int i = 1;
	int bas = 1;
	int son = n - 1;
	while(bas < son){
		int cvp = query(orta, n);
		// cout << orta << " " << cvp << endl;
		if(cvp == n - 1)
			bas = orta;
		else
			son = orta - 1;
	}
	i = orta;
	answer(i, 1);
	a[i] = 1;
	v[1] = 1;
	// cout << i << endl;
	if(i > 1){
		int cvp = query(i - 1, i);
		answer(i - 1, cvp + 1);
		a[i - 1] = cvp + 1;
		v[cvp + 1] = 1;
	}
	if(i < n){
		int cvp = query(i, i + 1);
		answer(i + 1, cvp + 1);
		a[i + 1] = cvp + 1;
		v[cvp + 1] = 1;
	}
	for(int j = i - 2; j >= 1; j--){
		int y = query(j, j + 1);
		int aa = a[j + 1];
		int bb = a[j + 2];
		int mx = max(aa, bb);
		int mn = min(aa, bb);
		int p1 = aa + y;
		int p2 = aa - y;
		int son = -1;
		if(v[p1])
			son = p2;
		else if(v[p2])
			son = p1;
		else{
			int x = query(j, j + 2);
			if(max(mx, p1) - min(mn, p1) != x)
				son = p2;
			if(max(mx, p2) - min(mn, p2) != x)
				son = p1;
		}
		assert(son != -1);
		answer(j, son);
		a[j] = son;
		v[son] = 1;

	}
	for(int j = i + 2; j <= n; j++){
		int y = query(j - 1, j);
		int aa = a[j - 1];
		int bb = a[j - 2];
		int mx = max(aa, bb);
		int mn = min(aa, bb);
		int p1 = aa + y;
		int p2 = aa - y;
		int son = -1;
		if(v[p1])
			son = p2;
		else if(v[p2])
			son = p1;
		else{
			int x = query(j - 2, j);
			if(max(mx, p1) - min(mn, p1) != x)
				son = p2;
			if(max(mx, p2) - min(mn, p2) != x)
				son = p1;
		}
		assert(son != -1);
		answer(j, son);
		a[j] = son;
		v[son] = 1;

	}

}


// int main() {
// 	freopen("in.txt", "r", stdin);
// 	freopen("out.txt", "w", stdout);
// 	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);
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 4 ms 440 KB Output is correct
4 Correct 4 ms 464 KB Output is correct
5 Correct 4 ms 508 KB Output is correct
6 Correct 4 ms 668 KB Output is correct
7 Correct 5 ms 668 KB Output is correct
8 Correct 5 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 4 ms 668 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 4 ms 668 KB Output is correct
14 Correct 5 ms 668 KB Output is correct
15 Correct 3 ms 668 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 4 ms 440 KB Output is correct
4 Correct 4 ms 464 KB Output is correct
5 Correct 4 ms 508 KB Output is correct
6 Correct 4 ms 668 KB Output is correct
7 Correct 5 ms 668 KB Output is correct
8 Correct 5 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 4 ms 668 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 4 ms 668 KB Output is correct
14 Correct 5 ms 668 KB Output is correct
15 Correct 3 ms 668 KB Output is correct
16 Correct 8 ms 668 KB Output is correct
17 Correct 12 ms 668 KB Output is correct
18 Correct 19 ms 668 KB Output is correct
19 Correct 25 ms 668 KB Output is correct
20 Correct 13 ms 668 KB Output is correct
21 Correct 22 ms 668 KB Output is correct
22 Correct 24 ms 668 KB Output is correct
23 Correct 12 ms 668 KB Output is correct
24 Correct 21 ms 668 KB Output is correct
25 Correct 30 ms 668 KB Output is correct
26 Correct 11 ms 668 KB Output is correct
27 Correct 19 ms 668 KB Output is correct
28 Correct 10 ms 668 KB Output is correct
29 Correct 16 ms 668 KB Output is correct
30 Correct 19 ms 668 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 4 ms 440 KB Output is correct
4 Correct 4 ms 464 KB Output is correct
5 Correct 4 ms 508 KB Output is correct
6 Correct 4 ms 668 KB Output is correct
7 Correct 5 ms 668 KB Output is correct
8 Correct 5 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 4 ms 668 KB Output is correct
12 Correct 3 ms 668 KB Output is correct
13 Correct 4 ms 668 KB Output is correct
14 Correct 5 ms 668 KB Output is correct
15 Correct 3 ms 668 KB Output is correct
16 Correct 8 ms 668 KB Output is correct
17 Correct 12 ms 668 KB Output is correct
18 Correct 19 ms 668 KB Output is correct
19 Correct 25 ms 668 KB Output is correct
20 Correct 13 ms 668 KB Output is correct
21 Correct 22 ms 668 KB Output is correct
22 Correct 24 ms 668 KB Output is correct
23 Correct 12 ms 668 KB Output is correct
24 Correct 21 ms 668 KB Output is correct
25 Correct 30 ms 668 KB Output is correct
26 Correct 11 ms 668 KB Output is correct
27 Correct 19 ms 668 KB Output is correct
28 Correct 10 ms 668 KB Output is correct
29 Correct 16 ms 668 KB Output is correct
30 Correct 19 ms 668 KB Output is correct
31 Correct 29 ms 668 KB Output is correct
32 Correct 82 ms 668 KB Output is correct
33 Correct 126 ms 668 KB Output is correct
34 Correct 111 ms 712 KB Output is correct
35 Correct 112 ms 712 KB Output is correct
36 Correct 47 ms 712 KB Output is correct
37 Correct 84 ms 712 KB Output is correct
38 Correct 103 ms 712 KB Output is correct
39 Correct 94 ms 712 KB Output is correct
40 Correct 48 ms 728 KB Output is correct
41 Correct 73 ms 728 KB Output is correct
42 Correct 52 ms 728 KB Output is correct
43 Correct 48 ms 728 KB Output is correct
44 Correct 110 ms 728 KB Output is correct
45 Correct 113 ms 728 KB Output is correct
46 Correct 102 ms 728 KB Output is correct
47 Correct 44 ms 728 KB Output is correct
48 Correct 48 ms 728 KB Output is correct
49 Correct 79 ms 728 KB Output is correct
50 Correct 96 ms 728 KB Output is correct
51 Correct 99 ms 728 KB Output is correct
52 Correct 143 ms 728 KB Output is correct
53 Correct 107 ms 728 KB Output is correct
54 Correct 118 ms 728 KB Output is correct
55 Correct 71 ms 728 KB Output is correct
56 Correct 103 ms 728 KB Output is correct
57 Correct 84 ms 828 KB Output is correct
58 Correct 87 ms 828 KB Output is correct
59 Correct 110 ms 828 KB Output is correct
60 Correct 118 ms 956 KB Output is correct