제출 #21129

#제출 시각아이디문제언어결과실행 시간메모리
21129sbansalcs비밀 (JOI14_secret)C++14
100 / 100
619 ms12956 KiB
#include "secret.h"
int val[1002][1002], hav[1002][1002], X[1002];
void comp(int a, int b)  {
	if(a>=b)	return;
    if(b-a==1)  hav[a][b]=1,val[a][b]=Secret(X[a],X[b]);
    int f=(a+b)/2,f2=f+1;
    for(int i=f-1;i>=a;i--)	hav[i][f]=1,val[i][f]=(i==f-1)?Secret(X[i],X[f]):Secret(X[i],val[i+1][f]);
    for(int i=f+2;i<=b;i++)	hav[f+1][i]=1,val[f+1][i]=(i==f+2)?Secret(X[f+1],X[i]):Secret(val[f+1][i-1],X[i]);
    if(hav[f][f2]==0)	hav[f][f2]=1,val[f][f2]=Secret(X[f],X[f2]);
    comp(a,f-1),comp(f2+1,b);
}
void Init(int N, int A[]) {
	for(int i=1;i<=N;i++)	X[i]=A[i-1],hav[i][i]=1,val[i][i]=A[i-1];
	comp(1,N);
}
int Query(int L, int R) {
	if(hav[L+1][R+1])	return val[L+1][R+1];
	for(int i=L+1;i<=R;i++)	{
		if(hav[L+1][i] && hav[i+1][R+1])	return Secret(val[L+1][i],val[i+1][R+1]);
	}
  return -1;
}

컴파일 시 표준 에러 (stderr) 메시지


#Verdict Execution timeMemoryGrader output
Fetching results...