# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223006 | aggu_01000101 | Secret (JOI14_secret) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "secret.h"
#define int long long
#define mid(l, u) ((l+u)/2)
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
using namespace std;
int DP[1000][1000];
int segtree[4000];
int N;
int build(int l, int u, int i, int a[]){
if(l==u) return segtree[i] = a[l];
return segtree[i] = Secret(build(l, mid(l, u), lchild(i), a), build(mid(l, u)+1, u, rchild(i), a));
}
int query(int l, int u, int i, int ll, int uu){
if(l>=ll && u<=uu) return segtree[i];
if(l>mid(l, u)) return query(mid(l, u)+1, u, rchild(i), ll, uu);
if(u<=mid(l, u)) return query(l, mid(l, u), lchild(i), ll, uu);
return Secret(query(l, mid(l, u), lchild(i), ll, mid(l, u)), query(mid(l, u)+1, u, rchild(i), mid(l, u)+1, uu));
}
void Init(int n, int a[]){
N = n;
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++) DP[i][j] = -1;
}
build(0, n-1, 0, a);
}
int Query(int L, int R){
return query(0, N-1, 0, L, R);
}
//-2 4 5 5 6 8
//8 -2 6 4 5 5
//5 5 4 6 -2 8