oj.uz

Submission #230562

# Submission time Handle Problem Language Result Execution time Memory
230562 2020-05-10T11:51:18 Z Dilshod_Imomov Xylophone (JOI18_xylophone) C++17
47 / 100
 110 ms 640 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int n) {
	int l = 1, r = n, ind = 0, md;
	while ( l <= r ) {
		md = (l + r) / 2;
		if ( query( md, n ) == n - 1 ) {
			l = md + 1;
			ind = md;
		}
		else {
			r = md - 1;
		}
	}
	vector < int > a( n + 1 );
	a[ind] = 1;
	set < int > st;
	answer( ind, 1 );
	for ( int i = 2; i <= n; i++ ) {
		st.insert(i);
	}
	if ( ind + 1 <= n ) {
		int x = query( ind, ind + 1 );
		a[ind + 1] = x + 1;
		answer( ind + 1, x + 1 );
	}
	if ( ind - 1 > 0 ) {
		int x = query( ind - 1, ind );
		a[ind - 1] = x + 1;
		answer( ind - 1, x + 1 );
	}
	for ( int i = ind + 2; i <= n; i++ ) {
		int x = a[ i - 1 ], y = a[i - 2];
		int d = query( i - 1, i );
		if ( x - d < 1 ) {
			a[i] = x + d;
			answer( i, x + d );
			continue;
		}
		if ( x + d > n ) {
			a[i] = x - d;
			answer( i, x - d );
			continue;
		}
		int q = query( i - 2, i );
		int mx = max( { x, y, x - d } ), mn = min( { x, y, x - d } );
		if ( q == mx - mn ) {
			a[i] = x - d;
			answer( i, x - d );
		}
		else {
			a[i] = x + d;
			answer( i, x + d );
		}
	}
	for ( int i = ind - 2; i > 0; i-- ) {
		int x = a[ i + 1 ], y = a[i + 2];
		int d = query( i, i + 1 );
		if ( x - d < 1 ) {
			a[i] = x + d;
			answer( i, x + d );
			continue;
		}
		if ( x + d > n ) {
			a[i] = x - d;
			answer( i, x - d );
			continue;
		}
		int q = query( i, i + 2 );
		int mx = max( { x, y, x - d } ), mn = min( { x, y, x - d } );
		if ( q == mx - mn ) {
			a[i] = x - d;
			answer( i, x - d );
		}
		else {
			a[i] = x + d;
			answer( i, x + d );
		}	
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 256 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 256 KB Output is correct
13 Correct 6 ms 256 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 256 KB Output is correct
16 Correct 8 ms 256 KB Output is correct
17 Correct 15 ms 384 KB Output is correct
18 Correct 19 ms 384 KB Output is correct
19 Correct 21 ms 384 KB Output is correct
20 Correct 18 ms 416 KB Output is correct
21 Correct 18 ms 384 KB Output is correct
22 Correct 19 ms 384 KB Output is correct
23 Correct 23 ms 384 KB Output is correct
24 Correct 14 ms 384 KB Output is correct
25 Correct 19 ms 384 KB Output is correct
26 Correct 24 ms 376 KB Output is correct
27 Correct 21 ms 384 KB Output is correct
28 Correct 22 ms 384 KB Output is correct
29 Correct 22 ms 384 KB Output is correct
30 Correct 16 ms 384 KB Output is correct
31 Correct 40 ms 384 KB Output is correct
32 Correct 44 ms 512 KB Output is correct
33 Correct 67 ms 512 KB Output is correct
34 Correct 72 ms 640 KB Output is correct
35 Correct 80 ms 512 KB Output is correct
36 Incorrect 110 ms 512 KB Wrong Answer [2]
37 Halted 0 ms 0 KB -