Submission #1100470

#TimeUsernameProblemLanguageResultExecution timeMemory
1100470anhphantSecret (JOI14_secret)C++14
0 / 100
309 ms4860 KiB
#include <bits/stdc++.h> #include "secret.h" using namespace std; typedef long long ll; int N, A[1000007], Q; ll dat[17][1007], mask[1007]; vector<ll> v; // int Secret(int a, int b) { // return a + b; // } void divi(ll l, ll r, ll lev, int A[]) { if (l == r) return; ll mid = (l + r) / 2; dat[lev][mid] = A[mid]; for(int i = mid - 1; i >= l; --i) { dat[lev][i] = Secret(A[i], dat[lev][i + 1]); } dat[lev][mid + 1] = A[mid + 1]; for(int i = mid + 2; i <= r; ++i) { dat[lev][i] = Secret(dat[lev][i - 1], A[i]); } for(int i = mid + 1; i <= r; ++i) mask[i] ^= (1 << lev); divi(l, mid, lev + 1, A); divi(mid + 1, r, lev + 1, A); } void Init(int N, int A[]) { divi(1, N, 0, A); for(int i = 1; i <= N; ++i) v.push_back(A[i]); } int Query(int l, int r) { l++; r++; if (l == r) return v[l - 1]; int bits = __builtin_ctz(mask[l] ^ mask[r]); return Secret(dat[bits][l], dat[bits][r]); }
#Verdict Execution timeMemoryGrader output
Fetching results...