# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435848 | Hegdahl | Aliens (IOI16_aliens) | C++17 | 9 ms | 220 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 <bits/stdc++.h>
#include "aliens.h"
#define ar array
using namespace std;
using ll = long long;
int n, m, k;
vector<ar<ll, 2>> a;
const ll INF = 1LL<<60;
ll sq(ll a) { return a*a; }
pair<ll, int> solve(ll penalty) {
vector<ll> cost(n+1, INF);
vector<int> used(n+1, 0);
cost[0] = 0;
for (int i = 0; i < n; ++i) {
int pr = i==0 ? -1 : a[i-1][1];
int l = a[i][0], r = a[i][1];
for (int j = i+1; j <= n; ++j) {
r = a[j-1][1];
ll c = cost[i] + sq(r-l+1) - sq(max(0, pr-l+1)) + penalty;
if (c < cost[j]) {
cost[j] = c;
used[j] = used[i]+1;
# | 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... |