Submission #1318610

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318610		Robert_junior	Secret (JOI14_secret)	C++20	0 / 100	337 ms	4440 KiB

secret

#include "secret.h"
#include <bits/stdc++.h>
using namespace std; 
const int N = 1e6 + 100, mod = 998443532;
int n;
int t[N][22], a[N], msk[N], L[N], R[N], b[N];
void dc(int l, int r, int lev){
    if(l == r) return;
    int m = (l + r) / 2;
    t[m][lev] = a[m]; 
    for(int i = m - 1; i >= l; i--) t[i][lev] = Secret(a[i], t[i + 1][lev]);
    t[m + 1][lev] = a[m + 1];
    for(int i = m + 2; i <= r; i++) t[i][lev] = Secret(a[i], t[i - 1][lev]);
    for(int i = m + 1; i <= r; i++) msk[i] ^= (1<<lev);
    dc(l, m, lev + 1);
    dc(m + 1, r, lev + 1);
}
int get(int l, int r){
    if(l == r) return a[l];
    int bits = __builtin_ctz(msk[l] ^ msk[r]);
    return Secret(t[l][bits], t[r][bits]);
}
void Init(int N, int A[]){
    n = N;
    for(int i = 0; i < n; i++){
        a[i] = A[i];
        msk[i] = 0;
    }
    dc(0, n - 1, 0) ;
}
int Query(int L, int R){
    return get(L, R);
}

• Subtask 1: 0 / 100