Submission #286161

#	Time	Username	Problem	Language	Result	Execution time	Memory
286161		YJU	Secret (JOI14_secret)	C++14	0 / 100	507 ms	12552 KiB

secret

#include<bits/stdc++.h>
#include "secret.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e3+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll pre[N][N],suf[N][N],n;

void Init(int N,int a[]){
	n=N;
	function<void(ll,ll)> build = [&](ll l,ll r){
		if(l>=r)return ;
		ll mid=(l+r)/2;
		build(l,mid);build(mid+1,r);
		pre[mid][mid+1]=a[mid];
		suf[mid][mid-1]=a[mid-1];
		for(int i=mid+2;i<=r;i++)pre[mid][i]=Secret(pre[mid][i-1],a[i-1]);
		for(int i=mid-2;i>=l;i--)suf[mid][i]=Secret(suf[mid][i+1],a[i]);
	};
	build(0,n);
} 

ll q(ll l,ll r,ll ql,ll qr){
	ll mid=(l+r)/2;
	if(ql<=mid&&mid<qr){
		if(mid==ql)return pre[mid][qr];
		if(mid==qr-1)return suf[mid][ql];
		return Secret(pre[mid][qr],suf[mid][ql]);
	}else{
		if(qr<=mid){
			return q(l,mid,ql,qr);
		}else{
			return q(mid+1,r,ql,qr);
		}
	}
}

int Query(int L,int R){
	return q(0,n,L,R+1);
}

• Subtask 1: 0 / 100