# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731600 | jasen_penchev | Aliens (IOI16_aliens) | C++14 | 714 ms | 512876 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.
/// Divide and Conquer Optimization
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define endl '\n'
using namespace std;
const int MAXN = 4000;
long long dp[MAXN + 5][MAXN + 5];
long long cost[MAXN + 5][MAXN + 5];
void calc(int k, int from, int to, int mn, int mx)
{
int mid = (from + to) / 2;
int opt = -1;
dp[mid][k] = (long long)(1e18);
for (int i = max(k - 1, mn); i <= min(mid - 1, mx); ++ i)
{
if (dp[mid][k] > dp[i][k - 1] + cost[i + 1][mid])
{
dp[mid][k] = dp[i][k - 1] + cost[i + 1][mid];
opt = i;
}
}
if (from == to) return;
if (from <= mid - 1) calc(k, from, mid - 1, mn, opt);
if (mid + 1 <= to) calc(k, mid + 1, to, opt, mx);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |