Submission #483690

#	Time	Username	Problem	Language	Result	Execution time	Memory
483690		MilosMilutinovic	Xylophone (JOI18_xylophone)	C++14	47 / 100	92 ms	632 KiB

xylophone

#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
 
const int N=5010;
int n,a[N],ans[N];
//int query(int l,int r) {
//	int mn=1e9,mx=0;
//	rep(i,l,r+1) mn=min(mn,a[i]),mx=max(mx,a[i]);
//	return mx-mn;
//}
map<int,int> was;
int gao(int x,int y,int z) {
	return max({x,y,z})-min({x,y,z});
}
void solve(int n) {
	int l=1,r=n,pos;
	while (r-l>1) {
		int md=(l+r)>>1;
		if (query(1,md)!=n-1) l=md;
		else r=md;
	}
	pos=r;
	ans[pos]=n; was[ans[pos]]=1;
	if (pos>1) ans[pos-1]=n-query(pos-1,pos),was[ans[pos-1]]=1;
	per(i,1,pos-1) {
		int x=query(i,i+1);
		int y=query(i,i+2);
		if (ans[i+1]+x>n) ans[i]=ans[i+1]-x;
		else if (was[ans[i+1]-x]==0&&(ans[i+1]-x>=1&&gao(ans[i+1]-x,ans[i+1],ans[i+2])==y)) ans[i]=ans[i+1]-x;
		else ans[i]=ans[i+1]+x;
		was[ans[i]]=1;
	}
	if (pos<n) ans[pos+1]=n-query(pos,pos+1),was[ans[pos+1]]=1;
	rep(i,pos+2,n+1) {
		int x=query(i-1,i);
		int y=query(i-2,i);
		if (ans[i-1]+x>n) ans[i]=ans[i-1]-x;
		else if (was[ans[i-1]-x]==0&&(ans[i-1]-x>=1&&gao(ans[i-1]-x,ans[i-1],ans[i-2])==y)) ans[i]=ans[i-1]-x;
		else ans[i]=ans[i-1]+x;
		was[ans[i]]=1;
	}
	rep(i,1,n+1) answer(i,ans[i]);
}
//int main() {
//	scanf("%d",&n);
//	rep(i,1,n+1) scanf("%d",a+i);
//	solve(n);
//	rep(i,1,n+1) printf("%d",ans[i]);
//}
 
/*
5
2 1 5 3 4
*/

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