oj.uz

Submission #234680

# Submission time Handle Problem Language Result Execution time Memory
234680 2020-05-25T06:40:43 Z Nodir_Bobiev Xylophone (JOI18_xylophone) C++14
100 / 100
 270 ms 632 KB 
#include "xylophone.h"
int diff2[5555], diff3[5555], ans[5555], cnt[5555];

bool please_do_it(int idx, int N){
	ans[idx] = N;
	if( idx != 1 )
		ans[idx-1] = N - diff2[idx-1];
	if( idx != N )
		ans[idx+1] = N - diff2[idx];

	for( int i = idx-2; i >= 1; i -- ){
		int val1 = diff2[i];
		int val2 = diff3[i];
		if( ans[i+1] < ans[i+2] ){
			if( ans[i+2]-ans[i+1] > val1 and val2 == ans[i+2] - ans[i+1]){
				ans[i] = ans[i+1] + val1;
			}
			else if( val2 > val1 ){
				ans[i] = ans[i+1] - val1;
			}
			else{
				ans[i] = ans[i+1] + val1;
			}
		}else{
			if( ans[i+1]-ans[i+2] > val1 and val2 == ans[i+1] - ans[i+2]){
				ans[i] = ans[i+1] - val1;
			}
			else if( val2 > val1 ){
				ans[i] = ans[i+1] + val1;
			}
			else{
				ans[i] = ans[i+1] - val1;
			}
		}
	}
	for( int i = idx+2; i <= N; i ++ ){
		int val1 = diff2[i-1];
		int val2 = diff3[i-2];
		if( ans[i-2] > ans[i-1] ){
			if( ans[i-2] - ans[i-1] > val1 and val2 == ans[i-2] - ans[i-1]){
				ans[i] = ans[i-1] + val1;
			}
			else if( val2 > val1 ){
				ans[i] = ans[i-1] - val1;
			}else{
				ans[i] = ans[i-1] + val1;
			}
		}else{
			if( ans[i-1]-ans[i-2] > val1 and val2 == ans[i-1] - ans[i-2] ){
				ans[i] = ans[i-1] - val1;
			}
			else if( val2 > val1 ){
				ans[i] = ans[i-1] + val1;
			}else{
				ans[i] = ans[i-1] - val1;
			}
		}
	}
	int cnt[5555] = {}, one = false;
	
	for( int i = 1; i <= N; i ++ ){
		if( ans[i] > N || ans[i] < 1)return false;
		cnt[ans[i]] ++;
		if( cnt[ans[i]]>1) return false;
		if( ans[i] == 1 )one = true;
		if( ans[i] == N && !one )return false;
	}
	return true;
}

void solve(int N) {
	for( int i = 1; i <= N-1; i ++ ){
		diff2[i] = query(i, i+1);
	}
	for( int i = 1; i <= N-2; i ++ ){
		diff3[i] = query(i, i + 2 );
	}
	for( int i = 1; i <= N; i ++ ){
		if( please_do_it(i, N) ){
			/*
			for( int i = 1; i <= N; i ++ ){
				printf("%d ", ans[i]);
			}printf("\n");
			*/
			for( int i = 1; i <= N; i ++ ){
				answer(i, ans[i]);
			}
			return;
		}
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 7 ms 256 KB Output is correct
6 Correct 8 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 12 ms 364 KB Output is correct
18 Correct 16 ms 360 KB Output is correct
19 Correct 23 ms 376 KB Output is correct
20 Correct 30 ms 376 KB Output is correct
21 Correct 31 ms 376 KB Output is correct
22 Correct 31 ms 376 KB Output is correct
23 Correct 29 ms 376 KB Output is correct
24 Correct 19 ms 360 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 32 ms 376 KB Output is correct
27 Correct 29 ms 376 KB Output is correct
28 Correct 21 ms 376 KB Output is correct
29 Correct 27 ms 376 KB Output is correct
30 Correct 27 ms 376 KB Output is correct
31 Correct 80 ms 384 KB Output is correct
32 Correct 106 ms 376 KB Output is correct
33 Correct 153 ms 408 KB Output is correct
34 Correct 251 ms 632 KB Output is correct
35 Correct 227 ms 484 KB Output is correct
36 Correct 241 ms 376 KB Output is correct
37 Correct 241 ms 376 KB Output is correct
38 Correct 107 ms 384 KB Output is correct
39 Correct 191 ms 376 KB Output is correct
40 Correct 192 ms 376 KB Output is correct
41 Correct 229 ms 376 KB Output is correct
42 Correct 221 ms 396 KB Output is correct
43 Correct 245 ms 376 KB Output is correct
44 Correct 77 ms 384 KB Output is correct
45 Correct 132 ms 376 KB Output is correct
46 Correct 215 ms 360 KB Output is correct
47 Correct 108 ms 376 KB Output is correct
48 Correct 175 ms 504 KB Output is correct
49 Correct 195 ms 408 KB Output is correct
50 Correct 179 ms 384 KB Output is correct
51 Correct 237 ms 404 KB Output is correct
52 Correct 270 ms 504 KB Output is correct
53 Correct 194 ms 384 KB Output is correct
54 Correct 145 ms 492 KB Output is correct
55 Correct 150 ms 376 KB Output is correct
56 Correct 156 ms 524 KB Output is correct
57 Correct 169 ms 384 KB Output is correct
58 Correct 263 ms 376 KB Output is correct
59 Correct 168 ms 384 KB Output is correct
60 Correct 193 ms 384 KB Output is correct