# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26412 | zscoder | Secret (JOI14_secret) | C++14 | 639 ms | 9996 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;
int a[1010][1010];
void gen(int l, int r)
{
if(r - l < 2)
{
return ;
}
int mid = (l+r)/2;
for(int i = mid - 1; i >= l; i--)
{
//cout << i << ' ' << a[i][mid] << endl;
if(a[i][mid] == -1)
{
a[i][mid] = Secret(a[i][i + 1], a[i + 1][mid]);
}
}
for(int i = mid + 1; i <= r; i++)
{
//cout << i << ' ' << a[mid][i] << endl;
if(a[mid][i] == -1)
{
a[mid][i] = Secret(a[mid][i - 1], a[i - 1][i]);
}
}
gen(l, mid);
gen(mid, r);
}
void Init(int N, int A[])
{
memset(a, -1, sizeof(a));
for(int i = 0; i < N; i++)
{
a[i][i + 1] = A[i];
}
gen(0, N);
}
int Query(int L, int R)
{
if(a[L][R+1] != -1) return a[L][R+1];
for(int i = L + 1; i <= R; i++)
{
if(a[L][i] != -1 && a[i][R + 1] != -1)
{
return Secret(a[L][i], a[i][R + 1]);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |