Submission #1135881

#TimeUsernameProblemLanguageResultExecution timeMemory
1135881daoquanglinh2007Secret (JOI14_secret)C++20
100 / 100
341 ms12180 KiB
#include <bits/stdc++.h> #include "secret.h" using namespace std; const int NM = 1000; int N, A[NM+5]; int f[4*NM+5][NM+5]; void build(int id, int l, int r, int t){ if (t == 0){ f[id][l] = A[l]; for (int i = l+1; i <= r; i++) f[id][i] = Secret(f[id][i-1], A[i]); } if (t == 1){ f[id][r] = A[r]; for (int i = r-1; i >= l; i--) f[id][i] = Secret(A[i], f[id][i+1]); } if (l == r) return; int mid = (l+r)/2; build(2*id, l, mid, 1); build(2*id+1, mid+1, r, 0); } void Init(int _N, int _A[]){ N = _N; for (int i = 1; i <= N; i++) A[i] = _A[i-1]; build(1, 1, N, -1); } int get(int id, int l, int r, int u, int v){ int mid = (l+r)/2; if (v <= mid) return get(2*id, l, mid, u, v); if (u > mid) return get(2*id+1, mid+1, r, u, v); return Secret(f[2*id][u], f[2*id+1][v]); } int Query(int L, int R){ L++, R++; if (L == R) return A[L]; return get(1, 1, N, L, R); }
#Verdict Execution timeMemoryGrader output
Fetching results...