oj.uz

답안 #1033745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033745 2024-07-25T04:52:51 Z emptypringlescan Xylophone (JOI18_xylophone) C++17
0 / 100
 1 ms 344 KB 
#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];
	memset(ans,-1,sizeof(ans));
	ans[lo]=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(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(x==max(ans[i+1],ans[i+2])-min(ans[i+1],ans[i+2])){
				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{
				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;
			}
		}
	}
	ans[lo+1]=1+query(lo,lo+1);
	for(int i=lo+2; i<=n; i++){
		int x=query(i-2,i);
		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(x==max(ans[i-1],ans[i-2])-min(ans[i-1],ans[i-2])){
				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{
				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;
			}
		}
	}
	for(int i=1; i<=n; i++) answer(i,ans[i]);
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -