# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
555682 | Fidan | Aliens (IOI16_aliens) | C++17 | 0 ms | 0 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 "aliens.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long take_photos(ll n, ll m, ll k, vector<ll> r, vector<ll> c) {
vector<bool> v(m+1, false);
ll i, j;
for(i=0; i<n; i++){
r[i]++;
v[r[i]]=true;
}
sort(r.begin(), r.end());
vector<vector<ll>> dp(m+1, vector<ll> (k+1, n*n+100));
for(i=0; i<r[0]; i++){
for(j=0; j<=k; j++){
dp[i][j]=0;
}
}
for(i=r[0]; i<=m; i++){
if(!v[i]){
dp[i][1]=dp[i-1][1];
}
else {
dp[i][1]=(i-r[0]+1)*(i-r[0]+1);
}
}
for(i=1; i<=m; i++){
for(j=1; j<=k; j++){
if(!v[i]){
dp[i][j]=dp[i-1][j];
}
else {
dp[i][j]=min(dp[i][j], dp[i][j-1]);
for(ll a: r){
if(a>i){
break;
}
dp[i][j]=min(dp[i][j], dp[a-1][j-1]+(i-a+1)*(i-a+1));
}
}
}
}
return dp[n][k];
}