제출 #703287

#제출 시각아이디문제언어결과실행 시간메모리
703287bane비밀 (JOI14_secret)C++17
0 / 100
431 ms8712 KiB
#include <bits/stdc++.h> #include "secret.h" using namespace std; typedef long long ll; const int MAX = 1005; ll arr[MAX], ret[20][MAX], mask[MAX]; int n; void Init(int N_, int A[]) { n = N_; for (int i = 0; i < n; ++i)arr[i] = A[i]; function<void(int,int,int)>init = [&](int l, int r, int dep = 0){ if (l == r) return; int m = l+(r-l)/2; for(int i = m; i>=l; --i){ if (i == m){ ret[dep][i] = arr[i]; }else{ ret[dep][i] = Secret(ret[dep][i + 1], arr[i]); } } for (int i = m + 1; i<=r; ++i){ if (i == m + 1){ ret[dep][i] = arr[i]; }else{ ret[dep][i] = Secret(ret[dep][i - 1], arr[i]); } } for (int i = m + 1; i<=r; ++i)mask[i]^=(1 << dep); init(l,m,dep +1); init(m+1,r,dep+1); }; init(0,n-1,0); } int Query(int L, int R) { int k = __builtin_clz(mask[L] ^ mask[R]); return Secret(ret[k][L], ret[k][R]); }
#Verdict Execution timeMemoryGrader output
Fetching results...