| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1329773 | hoangtien69 | Secret (JOI14_secret) | C++20 | 334 ms | 8296 KiB |
#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
const int MAXN = 1005;
int peal[MAXN][MAXN];
void solve(int left, int right)
{
if (left >= right) return;
int mid = (left + right) / 2;
solve(left, mid);
solve(mid + 1, right);
for (int i = mid - 1; i >= left; i--)
{
peal[i][mid] = Secret(peal[i][mid - 1], peal[mid][mid]);
}
for (int i = mid + 1; i <= right; i++)
{
peal[mid][i] = Secret(peal[mid][i - 1], peal[i][i]);
}
}
void Init(int N, int A[])
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
peal[i][j] = -1;
}
}
for (int i = 0; i < N; i++)
{
peal[i][i] = A[i];
}
solve(0, N - 1);
}
int Query(int L, int R)
{
if (peal[L][R] != -1)
{
return peal[L][R];
}
int mid = (L + R) / 2;
if (peal[L][mid] != -1 && peal[mid + 1][R] != -1)
{
return Secret(peal[L][mid], peal[mid + 1][R]);
}
for (int i = L; i < R; i++)
{
if (peal[L][i] != -1 && peal[i + 1][R] != -1)
{
return Secret(peal[L][i], peal[i + 1][R]);
}
}
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
