#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "secret.h"
const int N = 1000;
int* ar;
vector<int> need[N][N];
void cost(int a, int b)
{
if (a == b)
{
need[a][b].push_back(ar[a]);
return;
} else if (a == b - 1)
{
need[a][a].push_back(ar[a]);
need[b][b].push_back(ar[b]);
need[a][b].push_back(ar[a]);
need[a][b].push_back(ar[b]);
return;
} else if (a <= 0) return;
int mid = (a + b) / 2;
int cur = ar[mid];
need[mid][mid].push_back(cur);
for (int i = mid - 1; i >= a; i--)
{
cur = Secret(cur, ar[i]);
need[i][mid].push_back(cur);
}
cur = ar[mid + 1];
need[mid + 1][mid + 1].push_back(cur);
for (int i = mid + 2; i <= b; i++)
{
cur = Secret(cur, ar[i]);
need[mid + 1][i].push_back(cur);
}
for (int i = mid; i >= a; i--)
{
for (int j = mid + 1; j <= b; j++)
{
need[i][j].push_back(need[i][mid][0]);
need[i][j].push_back(need[mid + 1][j][0]);
}
}
cost(a, mid - 1);
cost(mid + 1, b);
}
/*
int main()
{
} */
void Init(int n, int A[])
{
ar = A;
cost(0, n - 1);
}
int Query(int l, int r)
{
if (need[l][r].size() == 1) return need[l][r][0];
return Secret(need[l][r][0], need[l][r][1]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
177 ms |
52344 KB |
Execution killed with signal 11 |
2 |
Runtime error |
176 ms |
52460 KB |
Execution killed with signal 11 |
3 |
Runtime error |
180 ms |
52332 KB |
Execution killed with signal 11 |
4 |
Runtime error |
540 ms |
56128 KB |
Execution killed with signal 11 |
5 |
Runtime error |
540 ms |
56172 KB |
Execution killed with signal 11 |
6 |
Runtime error |
557 ms |
56460 KB |
Execution killed with signal 11 |
7 |
Runtime error |
542 ms |
56428 KB |
Execution killed with signal 11 |
8 |
Runtime error |
546 ms |
56312 KB |
Execution killed with signal 11 |
9 |
Runtime error |
588 ms |
56300 KB |
Execution killed with signal 11 |
10 |
Runtime error |
541 ms |
56300 KB |
Execution killed with signal 11 |