제출 #234669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
234669		Nodir_Bobiev	Xylophone (JOI18_xylophone)	C++14	47 / 100	119 ms	384 KiB

xylophone

#include "xylophone.h"

void solve(int N) {
	int idx = 1;
	for( idx; idx <= N; idx ++ ){
		if( query(1, idx) == N-1 )
			break;
	}
	int ans[N+2] = {};
	ans[idx] = N;
	if( idx != 1 )
		ans[idx-1] = N - query(idx-1, idx);
	if( idx != N )
		ans[idx+1] = N - query(idx, idx+1 );

	for( int i = idx-2; i >= 1; i -- ){
		int val1 = query(i, i+1);
		int val2 = query(i, i+2);
		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 = query(i-1, i);
		int val2 = query(i-2, i);
		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;
			}
		}
	}/*
	for( int i = 1; i <= N; i ++ ){
		printf("%d ", ans[i]);
	}printf("\n");
	*/
	for( int i = 1; i <= N; i ++ ){
		answer(i, ans[i]);
	}
}

컴파일 시 표준 에러 (stderr) 메시지

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:5:10: warning: statement has no effect [-Wunused-value]
  for( idx; idx <= N; idx ++ ){
          ^

• Subtask 1: 11 / 11
• Subtask 2: 36 / 36
• Subtask 3: 0 / 53