# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834500 | serifefedartar | Secret (JOI14_secret) | C++17 | 585 ms | 524288 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 "secret.h"
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 200005
int ranges[1005][1005];
int n;
void build(int l, int r, int A[]) {
if (l > r)
return ;
int mid1 = (l+r)/2;
int mid2 = mid1+1;
ranges[mid1][mid1] = A[mid1];
ranges[mid2][mid2] = A[mid2];
for (int i = mid1-1; i >= 0; i--)
ranges[i][mid1] = Secret(A[i], ranges[i+1][mid1]);
for (int i = mid2+1; i <= r; i++)
ranges[mid2][i] = Secret(ranges[mid2][i-1], A[i]);
build(l, mid1, A);
build(mid2, r, A);
}
void Init(int N, int A[]) {
build(0, N-1, A);
n = N;
}
int Query(int L, int R) {
int now_l = 0;
int now_r = n-1;
while (now_l <= now_r) {
int mid1 = (now_l+now_r)/2;
int mid2 = (now_l+now_r)/2+1;
if (L <= mid1 && R >= mid2)
return Secret(ranges[L][mid1], ranges[mid2][R]);
else if (L == mid2)
return ranges[L][R];
else if (R == mid1)
return ranges[L][R];
if (L >= mid2)
now_l = mid2;
else
now_r = mid1;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |