Submission #1231257

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231257		sitingfake	비밀 (JOI14_secret)	C++20	0 / 100	336 ms	4476 KiB

secret

#include<bits/stdc++.h>
#include "secret.h"
using namespace std;

// define

#define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n";
#define ll long long
#define ld double
#define ii pair<int,int>
#define se second
#define fi first
#define iii pair<int,ii>
#define all(v) v.begin(),v.end()
#define bit(x,i) (((x)>>(i))&1LL)
#define flip(x,i) ((x)^(1LL<<(i)))
#define ms(d,x) memset(d,x,sizeof(d))
#define sitingfake 1
#define orz 1
#define visit visited
#define left __left
#define right __right

//constant

const ll mod = 1e9 + 7;
const long long linf = 4557430888798830399;
const int inf = 1061109567;
const int maxarr = 1e6 + 5;
int dx[] = {0 , -1 , 0 , 1};
int dy[] = {-1 , 0 , 1 , 0};

template<typename T> bool maximize(T &a, const T &b)
{
    if(a < b) {a = b; return 1;}
    return 0;
}

template<typename T> bool minimize(T &a, const T &b)
{
    if(a > b) {a = b; return 1;}
    return 0;
}

inline void Plus(ll & a ,ll b)
{
    b %= mod;
    a += b;
    if(a >= mod) a -= mod;
    if(a < 0) a += mod;
    return;
}

inline void Mul(ll & a, ll b)
{
    a %= mod; b %= mod;
    a *= b;
    a %= mod;
    return;
}

//code
const int maxn = 2002;

int left[maxn][20] , right[maxn][20] , mask[maxn];
int a[maxn] , n;

void DnC(int l , int r , int lv)
{
    if(l > r) return;
    if(l == r)
    {
        return;
    }

    int mid = (r + l) >> 1;

    left[mid][lv] = a[mid];

    for(int i = mid - 1; i >= l; i--)
    {
        left[i][lv] = Secret(left[i + 1][lv] , a[i]);
    }

    right[mid + 1][lv] = a[mid + 1];

    for(int i = mid + 2; i <= r; i++)
    {
        right[i][lv] = Secret(right[i - 1][lv] , a[i]);
    }

    for(int i = mid + 1; i <= r; i++) mask[i] |= (1 << lv);

    DnC(l , mid , lv + 1);
    DnC(mid + 1 , r , lv + 1);

}

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

    DnC(1 , n , 0);
}

int Query(int L , int R)
{
    L++ , R++;

    if(L == R) return a[L];

    int id = __builtin_ctz(mask[L] ^ mask[R]);

    return Secret(left[L][id] , right[R][id]);
}

• Subtask 1: 0 / 100