제출 #497852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497852		penguin133	Xylophone (JOI18_xylophone)	C++17	0 / 100	2 ms	200 KiB

xylophone

#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int ans[5005];
void solve(int N) {
	int x = 2,prev= 0 ;
	while(query(x, N) == N - 1)x++;
	ans[x-1] = 1;
	for(int i=x-2;i>=1;i--){
		int y = query(i, i+1);
		if(i == x-2)ans[i] = y + 1;
		else{
			if(ans[i+1] -y <= 1)ans[i] = ans[i+1] + y;
			else if(ans[i+1] + y >= N)ans[i] = ans[i+1] - y;
			else{
				int y2 = query(i, i+2);
				if(y2 != prev){
					if(ans[i+1] + y == min(ans[i+1] ,ans[i+2]) + y2)ans[i] = ans[i+1] + y;
					else ans[i] = ans[i+1] - y;
				}
				else{
					if(ans[i+1] > ans[i+2])ans[i]=ans[i+1] -y;
					else ans[i] = ans[i+1] + y;
				}
			}
		}
		prev = y;
	}
	prev = 0;
	for(int i=x;i<=N;i++){
		int y = query(i-1, i);
		if(i == x)ans[i] = y + 1;
		else{
			if(ans[i-1] -y <= 1)ans[i] = ans[i-1] + y;
			else if(ans[i-1] + y >= N)ans[i] = ans[i-1] - y;
			else{
				int y2 = query(i-2, i);
				if(y2 != prev){
					if(ans[i-1] + y == min(ans[i-1], ans[i-2]) + y2)ans[i] = ans[i-1] + y;
					else ans[i] = ans[i-1] - y;
				}
				else{
					if(ans[i-1] > ans[i-2])ans[i]=ans[i-1] -y;
					else ans[i] = ans[i-1] + y;
				}
			}
		}
		prev = y;
	}
	for(int i=1;i<=N;i++)answer(i, ans[i]);
}

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