oj.uz

Submission #71276

# Submission time Handle Problem Language Result Execution time Memory
71276 2018-08-24T09:53:02 Z ekrem Xylophone (JOI18_xylophone) C++
47 / 100
 85 ms 700 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

#define st first
#define nd second
#define mp make_pair
#define pb push_back
#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;
	while(query(i, n) == n - 1)i++;i--;
	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);
// }

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:69:2: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
  while(query(i, n) == n - 1)i++;i--;
  ^~~~~
xylophone.cpp:69:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  while(query(i, n) == n - 1)i++;i--;
                                 ^

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 3 ms 308 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 5 ms 420 KB Output is correct
5 Correct 6 ms 548 KB Output is correct
6 Correct 5 ms 576 KB Output is correct
7 Correct 4 ms 576 KB Output is correct
8 Correct 5 ms 576 KB Output is correct
9 Correct 4 ms 576 KB Output is correct
10 Correct 5 ms 576 KB Output is correct
11 Correct 7 ms 576 KB Output is correct
12 Correct 4 ms 576 KB Output is correct
13 Correct 4 ms 576 KB Output is correct
14 Correct 5 ms 576 KB Output is correct
15 Correct 3 ms 576 KB Output is correct
16 Correct 8 ms 576 KB Output is correct
17 Correct 10 ms 576 KB Output is correct
18 Correct 15 ms 576 KB Output is correct
19 Correct 23 ms 576 KB Output is correct
20 Correct 24 ms 700 KB Output is correct
21 Correct 12 ms 700 KB Output is correct
22 Correct 21 ms 700 KB Output is correct
23 Correct 11 ms 700 KB Output is correct
24 Correct 37 ms 700 KB Output is correct
25 Correct 15 ms 700 KB Output is correct
26 Correct 28 ms 700 KB Output is correct
27 Correct 25 ms 700 KB Output is correct
28 Correct 29 ms 700 KB Output is correct
29 Correct 30 ms 700 KB Output is correct
30 Correct 24 ms 700 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 308 KB Output is correct
2 Correct 3 ms 308 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 5 ms 420 KB Output is correct
5 Correct 6 ms 548 KB Output is correct
6 Correct 5 ms 576 KB Output is correct
7 Correct 4 ms 576 KB Output is correct
8 Correct 5 ms 576 KB Output is correct
9 Correct 4 ms 576 KB Output is correct
10 Correct 5 ms 576 KB Output is correct
11 Correct 7 ms 576 KB Output is correct
12 Correct 4 ms 576 KB Output is correct
13 Correct 4 ms 576 KB Output is correct
14 Correct 5 ms 576 KB Output is correct
15 Correct 3 ms 576 KB Output is correct
16 Correct 8 ms 576 KB Output is correct
17 Correct 10 ms 576 KB Output is correct
18 Correct 15 ms 576 KB Output is correct
19 Correct 23 ms 576 KB Output is correct
20 Correct 24 ms 700 KB Output is correct
21 Correct 12 ms 700 KB Output is correct
22 Correct 21 ms 700 KB Output is correct
23 Correct 11 ms 700 KB Output is correct
24 Correct 37 ms 700 KB Output is correct
25 Correct 15 ms 700 KB Output is correct
26 Correct 28 ms 700 KB Output is correct
27 Correct 25 ms 700 KB Output is correct
28 Correct 29 ms 700 KB Output is correct
29 Correct 30 ms 700 KB Output is correct
30 Correct 24 ms 700 KB Output is correct
31 Correct 58 ms 700 KB Output is correct
32 Correct 85 ms 700 KB Output is correct
33 Correct 45 ms 700 KB Output is correct
34 Incorrect 45 ms 700 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -