Submission #1033759

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033759		emptypringlescan	Xylophone (JOI18_xylophone)	C++17	47 / 100	62 ms	600 KiB

xylophone

#include <bits/stdc++.h>
using namespace std;
#include "xylophone.h"

void solve(int n){
	int lo=1,hi=n-1,mid;
	while(lo<hi){
		mid=(lo+hi+1)/2;
		int x=query(mid,n);
		if(x==n-1) lo=mid;
		else hi=mid-1;
	}
	int ans[n+1],got[n+1];
	memset(got,0,sizeof(got));
	memset(ans,-1,sizeof(ans));
	ans[lo]=1;
	got[1]=1;
	if(lo>1) ans[lo-1]=1+query(lo-1,lo);
	for(int i=lo-2; i>0; i--){
		int x=query(i,i+2);
		if(x==max(ans[i+1],ans[i+2])-min(ans[i+1],ans[i+2])){
			int empt=-1;
			for(int j=min(ans[i+1],ans[i+2]); j<max(ans[i+1],ans[i+2]); j++){
				if(got[j]==0){
					if(empt==-1) empt=j;
					else empt=-2;
				}
			}
			if(empt>0) ans[i]=empt;
			else if(ans[i+1]<ans[i+2]) ans[i]=ans[i+1]+query(i,i+1);
			else ans[i]=ans[i+1]-query(i,i+1);
		}
		else if(min(ans[i+1],ans[i+2])+x>=n) ans[i]=max(ans[i+1],ans[i+2])-x;
		else if(max(ans[i+1],ans[i+2])-x<1) ans[i]=min(ans[i+1],ans[i+2])+x;
		else{
			if(got[min(ans[i+1],ans[i+2])+x]) ans[i]=max(ans[i+1],ans[i+2])-x;
			else if(got[max(ans[i+1],ans[i+2])-x]) ans[i]=min(ans[i+1],ans[i+2])+x;
			else{
				int y=query(i,i+1);
				if(ans[i+1]+y==min(ans[i+1],ans[i+2])+x) ans[i]=ans[i+1]+y;
				else ans[i]=ans[i+1]-y;
			}
		}
		got[ans[i]]=1;
	}
	ans[lo+1]=1+query(lo,lo+1);
	for(int i=lo+2; i<=n; i++){
		int x=query(i-2,i);
		if(x==max(ans[i-1],ans[i-2])-min(ans[i-1],ans[i-2])){
			int empt=-1;
			for(int j=min(ans[i-1],ans[i-2]); j<max(ans[i-1],ans[i-2]); j++){
				if(got[j]==0){
					if(empt==-1) empt=j;
					else empt=-2;
				}
			}
			if(empt>0) ans[i]=empt;
			else if(ans[i-1]<ans[i-2]) ans[i]=ans[i-1]+query(i-1,i);
			else ans[i]=ans[i-1]-query(i-1,i);
		}
		else if(min(ans[i-1],ans[i-2])+x>n) ans[i]=max(ans[i-1],ans[i-2])-x;
		else if(max(ans[i-1],ans[i-2])-x<1) ans[i]=min(ans[i-1],ans[i-2])+x;
		else{
			if(got[min(ans[i-1],ans[i-2])+x]) ans[i]=max(ans[i-1],ans[i-2])-x;
			else if(got[max(ans[i-1],ans[i-2])-x]) ans[i]=min(ans[i-1],ans[i-2])+x;
			else{
				int y=query(i-1,i);
				if(ans[i-1]+y==min(ans[i-1],ans[i-2])+x) ans[i]=ans[i-1]+y;
				else ans[i]=ans[i-1]-y;
			}
		}
		got[ans[i]]=1;
	}
	for(int i=1; i<=n; i++) answer(i,ans[i]);
}

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