Submission #21126

#	Time	Username	Problem	Language	Result	Execution time	Memory
21126		sbansalcs	Secret (JOI14_secret)	C++14	100 / 100	633 ms	12956 KiB

secret

#include "secret.h"
using namespace std;
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]);
    else    {
        int f=(a+b)/2;
        int f2=f+1;
        for(int i=f-1;i>=a;i--)	{
        	hav[i][f]=1;
        	if(i==f-1)	val[i][f]=Secret(X[i],X[f]);
        	else	val[i][f]=Secret(X[i],val[i+1][f]);
        }
        f++;
        for(int i=f+1;i<=b;i++)	{
        	hav[f][i]=1;
        	if(i==f+1)	val[f][i]=Secret(X[f],X[i]);
        	else	val[f][i]=Secret(val[f][i-1],X[i]);
        }
        f--;
        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) {
	L++,R++;
	if(hav[L][R])	return val[L][R];
	for(int i=L;i<=R-1;i++)	{
		if(hav[L][i] && hav[i+1][R])	return Secret(val[L][i],val[i+1][R]);
	}
  return -1;
}

• Subtask 1: 100 / 100