Submission #403276

#	Time	Username	Problem	Language	Result	Execution time	Memory
403276		thomas_li	비밀 (JOI14_secret)	C++17	0 / 100	561 ms	4500 KiB

secret

#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int MM = 1e6+5;
int n,a[MM],pre[21][MM],mask[MM];

void rec(int l, int r, int d){
	if(l == r) return;
	int mid = (l+r)/2;
	pre[d][mid] = a[mid];
	for(int i = mid-1; i >= l; i--) pre[d][i] = Secret(a[i],pre[d][i+1]);
	pre[d][mid+1] = a[mid+1];
	for(int i = mid+2; i <= r; i++) pre[d][i] = Secret(a[i],pre[d][i-1]);
	for(int i = mid+1; i <= r; i++) mask[i] ^= (1<<d);
	rec(l,mid,d+1); rec(mid+1,r,d+1);
}

void Init(int N, int A[]){
	n = N;
	for(int i = 0; i < n; i++) a[i] = A[i];
	rec(0,n-1,0);
}

int Query(int L, int R){
	if(L == R) return a[L];
	int d = __builtin_ctz(mask[L]^mask[R]);
	return Secret(pre[d][L],pre[d][R]);
}

/*
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int A[] = {1,4,7,2,5,8,3,6};
	Init(8,A);
	cout << Query(0,3) << "\n";
	cout << Query(1,7) << "\n";
	cout << Query(5,5) << "\n";
	cout << Query(2,4) << "\n";
}*/

• Subtask 1: 0 / 100