oj.uz

답안 #679580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679580 2023-01-08T15:12:52 Z Doncho_Bonboncho Xylophone (JOI18_xylophone) C++14
100 / 100
 99 ms 436 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

const int MAX_N = 8192;

static int a[MAX_N];

int two[MAX_N];
int tri[MAX_N];

bool otn[MAX_N]; // i and i+1
	
void solve(int n) {

	for( int i=1 ; i<n ; i++ ){
		two[i] =  query( i, i+1 );;
	}

	for( int i=1 ; i<n-1 ; i++ ){
		tri[i] =  query( i, i+2 );;
	}
	
	otn[1] = 1;
	for( int i=1 ; i<n-1; i++ ){
		if( tri[i] == two[i] + two[i+1] ) otn[i+1] = otn[i];
		else otn[i+1] = !otn[i];
	}

	int min = 1, max = 1;
	a[1] = 0;
	for( int i=1 ; i<n ; i++ ){
		if( otn[i] ) a[i+1] = a[i] - two[i];
		else a[i+1] = a[i] + two[i];

		if( a[min] > a[i] ) min = i;
		if( a[max] < a[i] ) max = i;
	}

	if( a[min] > a[n] ) min = n;
	if( a[max] < a[n] ) max = n;

	/*
	std::cerr<<" ! "<<min<<" "<<max<<" -> "<<a[min]<<" "<<a[max]<<"\n";
	for( int i=1 ; i<=n ; i++ ) std::cerr<<a[i]<<" ";
	std::cerr<<"\n";
	*/

	if( min < max ){
		for( int i=1; i<=n ; i++ ){
			answer( i, a[i] + 1 - a[min] );

		}
		return ;
	}//else std::cerr<<" ne stava \n\n\n\n ";


	min = 1, max = 1;
	a[1] = 0;
	for( int i=1 ; i<n ; i++ ){
		if( otn[i] ) a[i+1] = a[i] + two[i];
		else a[i+1] = a[i] - two[i];

		if( a[min] > a[i] ) min = i;
		if( a[max] < a[i] ) max = i;
	}

	if( a[min] > a[n] ) min = n;
	if( a[max] < a[n] ) max = n;

	/*
	for( int i=1 ; i<=n ; i++ ) std::cerr<<a[i]<<" ";
	std::cerr<<"\n";
	*/
	

	for( int i=1; i<=n ; i++ ){
		answer( i, a[i] + 1 - a[min] );
	}

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 2 ms 308 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 316 KB Output is correct
7 Correct 3 ms 304 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 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 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 2 ms 308 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 316 KB Output is correct
7 Correct 3 ms 304 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 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 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 8 ms 312 KB Output is correct
18 Correct 16 ms 308 KB Output is correct
19 Correct 15 ms 308 KB Output is correct
20 Correct 13 ms 308 KB Output is correct
21 Correct 20 ms 308 KB Output is correct
22 Correct 14 ms 304 KB Output is correct
23 Correct 15 ms 316 KB Output is correct
24 Correct 17 ms 208 KB Output is correct
25 Correct 17 ms 308 KB Output is correct
26 Correct 15 ms 312 KB Output is correct
27 Correct 13 ms 308 KB Output is correct
28 Correct 19 ms 308 KB Output is correct
29 Correct 19 ms 328 KB Output is correct
30 Correct 16 ms 304 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 2 ms 308 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 3 ms 316 KB Output is correct
7 Correct 3 ms 304 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 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 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 308 KB Output is correct
17 Correct 8 ms 312 KB Output is correct
18 Correct 16 ms 308 KB Output is correct
19 Correct 15 ms 308 KB Output is correct
20 Correct 13 ms 308 KB Output is correct
21 Correct 20 ms 308 KB Output is correct
22 Correct 14 ms 304 KB Output is correct
23 Correct 15 ms 316 KB Output is correct
24 Correct 17 ms 208 KB Output is correct
25 Correct 17 ms 308 KB Output is correct
26 Correct 15 ms 312 KB Output is correct
27 Correct 13 ms 308 KB Output is correct
28 Correct 19 ms 308 KB Output is correct
29 Correct 19 ms 328 KB Output is correct
30 Correct 16 ms 304 KB Output is correct
31 Correct 33 ms 308 KB Output is correct
32 Correct 40 ms 316 KB Output is correct
33 Correct 76 ms 304 KB Output is correct
34 Correct 95 ms 328 KB Output is correct
35 Correct 88 ms 324 KB Output is correct
36 Correct 90 ms 304 KB Output is correct
37 Correct 90 ms 348 KB Output is correct
38 Correct 77 ms 304 KB Output is correct
39 Correct 91 ms 320 KB Output is correct
40 Correct 63 ms 432 KB Output is correct
41 Correct 71 ms 296 KB Output is correct
42 Correct 79 ms 316 KB Output is correct
43 Correct 62 ms 324 KB Output is correct
44 Correct 50 ms 420 KB Output is correct
45 Correct 82 ms 304 KB Output is correct
46 Correct 85 ms 292 KB Output is correct
47 Correct 45 ms 420 KB Output is correct
48 Correct 85 ms 304 KB Output is correct
49 Correct 91 ms 328 KB Output is correct
50 Correct 81 ms 296 KB Output is correct
51 Correct 99 ms 304 KB Output is correct
52 Correct 92 ms 328 KB Output is correct
53 Correct 95 ms 328 KB Output is correct
54 Correct 75 ms 308 KB Output is correct
55 Correct 39 ms 420 KB Output is correct
56 Correct 60 ms 436 KB Output is correct
57 Correct 90 ms 328 KB Output is correct
58 Correct 60 ms 308 KB Output is correct
59 Correct 77 ms 324 KB Output is correct
60 Correct 68 ms 328 KB Output is correct