| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1139538 | gyg | Aliens (IOI16_aliens) | C++20 | 0 ms | 0 KiB |
#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array
#define vec vector
#define pii pair<int, int>
#define fir first
#define sec second
const int N = 4e3 + 5, K = 4e3 + 5, INF = 1e18;
int n, k;
arr<int, N> ps, mn;
// Answer is min of dp[n][1], dp[n][2] ...
arr<arr<int, K>, N> dp;
int sq(int x) { return x * x; }
void dp_cmp() {
for (int i = 1; i <= n; i++) {
int mn_mn = INF;
for (int j = i; j >= 1; j--) mn_mn = min(mn, mn[j]);
dp[i][1] = sq(ps[i] - mn_mn + 1);
}
for (int c = 2; c <= k; c++) {
for (int i = 1; i <= n; i++) {
dp[i][c] = INF;
for (int j = i - 1; j >= 1; j--) {
int intr = sq(ps[j] - max(mn[i], mn[j]) + 1);
int trns = dp[j][c - 1] - intr + sq(ps[i] - mn[i] + 1);
dp[i][c] = min(dp[i][c], trns);
if (mn[j] < mn[i]) break;
}
}
}
}
map<int, int> mn_mp;
int take_photos(signed _sz, signed _m, signed _k, vec<signed> _rw, vec<signed> _cl) {
k = _k;
for (int i = 0; i < _sz; i++) {
int x = max(_rw[i] + 1, _cl[i] + 1), y = min(_rw[i] + 1, _cl[i] + 1);
if (!mn_mp.count(x)) mn_mp[x] = y;
else mn_mp[x] = min(mn_mp[x], y);
}
for (pii x : mn_mp) n++, ps[n] = x.fir, mn[n] = x.sec;
// for (int i = 1; i <= n; i++) cout << i << ": " << ps[i] << " " << mn[i] << endl;
dp_cmp();
int ans = *min_element(dp[n].begin() + 1, dp[n].begin() + k + 1);
return ans;
}