제출 #996110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996110		cnn008	Xylophone (JOI18_xylophone)	C++17	47 / 100	2994 ms	97464 KiB

xylophone

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

int a[5005],d[5005][5005];

void solve(int n){
	int _=query(1,2);
	for(int i=3; i<=n; i++) d[i-2][i]=query(i-2,i);
	for(int i=2; i<=n; i++) d[i-1][i]=query(i-1,i);
	cerr<<"array d: "<<endl;
	for(int i=3; i<=n; i++) cerr<<d[i-2][i]<<" ";
	cerr<<endl;
	for(int i=2; i<=n; i++) cerr<<d[i-1][i]<<" ";
	cerr<<endl;
	for(int i=1; i<=n; i++){
		a[1]=i;
		for(int __=-1; __<=1; __+=2){
			set <int> s;
			a[2]=a[1]+__*_;
			s.insert(a[1]);
			s.insert(a[2]);
			for(int j=3; j<=n; j++){
				int v=d[j-2][j];
				int l=d[j-1][j];
				if(v==max(a[j-1],a[j-2])-min(a[j-1],a[j-2])){
					if(a[j-1]>a[j-2]) a[j]=a[j-1]-l;
					else a[j]=a[j-1]+l;
				}else{
					int ifmin=a[j-1]-l;
					int ifmax=a[j-1]+l;
					if(ifmin>0 and max({a[j-2],a[j-1]})-ifmin==v) a[j]=ifmin;
					else a[j]=ifmax;
				}
				s.insert(a[j]);
			}
			int fir=1,last=0;
			for(int j=1; j<=n; j++) if(a[j]==1) fir=j;
			for(int j=1; j<=n; j++) if(a[j]==n) last=j;
			if((int)s.size()==n and *s.begin()==1 and *s.rbegin()==n and fir<last){
				cerr<<"array a"<<endl;
				cerr<<n<<endl;
				for(int i=1; i<=n; i++) cerr<<a[i]<<" ";
				cerr<<endl;
				for(int i=1; i<=n; i++) answer(i,a[i]);
				return;
			}
		}
	}
}

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