Submission #989295

#	Time	Username	Problem	Language	Result	Execution time	Memory
989295		aaaaaarroz	Secret (JOI14_secret)	C++17	0 / 100	299 ms	4472 KiB

secret

#include <bits/stdc++.h>
using namespace std;
int Secret(int l, int r);
vector<vector<int>>dvc;
vector<int>arr;
void dc(int l, int r, int lvl){
	if(l==r){
		dvc[lvl][l]=arr[l];
		return;
	}
	int mid=(l+r)>>1;
	dvc[lvl][mid]=arr[mid];
	dvc[lvl][mid+1]=arr[mid+1];
	for(int i=mid-1;i>=l;i--){
		dvc[lvl][i]=Secret(dvc[lvl][i+1],arr[i]);
	}
	for(int i=mid+2;i<=r;i++){
		dvc[lvl][i]=Secret(dvc[lvl][i-1],arr[i]);
	}
	dc(l,mid,lvl+1);
	dc(mid+1,r,lvl+1);
}
void Init(int n, int a[]){ 
    arr.resize(n);
    for(int i=0;i<n;i++){
        arr[i]=a[i];
	}
    dvc.resize(15,vector<int>(n));
	dc(0,n-1,0);
}
int retorno(int a,int b,int l,int r, int lvl){
	int mid=(a+b)>>1;
	if(a==b){
		return dvc[lvl][a];
	}
	if(r<(mid+1)){
		return retorno(a,mid,l,r,lvl+1);
	}
	else if(l>mid){
		return retorno(mid+1,b,l,r,lvl+1);
	}
	return Secret(dvc[lvl][a],dvc[lvl][b]);
}
int Query(int l,int r){ 
    return retorno(0,arr.size()-1,l,r,0);
}

• Subtask 1: 0 / 100