| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1303300 | Mamikonm1 | Aliens (IOI16_aliens) | C++17 | 0 ms | 0 KiB |
#include<bits//stdc++.h>
//#include "aliens.h"
using namespace std;
using ll = long long;
#define mk make_pair
#define V vector
const ll inf=1e18;
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
V<int>ind;
V<bool>del(n);
for(int i=0;i<n;++i)if(r[i]>c[i])swap(r[i],c[i]);
for(int i=0;i<n;++i)for(int j=0;j<n;++j){
if(mk(r[i],c[i])==mk(r[j],c[j]) or r[i]>r[j])continue;
if(r[i]<r[j]){
if(c[i]>c[j])del[j]=1;
}else if(c[i]>c[j])del[j]=1;
}
for(int i=0;i<n;++i)if(!del[i])ind.push_back(i);
auto cmp=[&](int i,int j){
if(min(r[i],c[i])==min(r[j],c[j]))return max(r[i],c[i])<max(r[j],c[j]);
return min(r[i],c[i])<min(r[j],c[j]);
};
n=ind.size();
sort(begin(ind),end(ind),cmp);
ind.insert(begin(ind),n);
r.push_back(-1);
c.push_back(-1);
V<V<ll>>dp(n+1,V<ll>(k+1,inf));
dp[0][0]=0;
ll ht=0;
for(int it=1,ni,mx;it<=n;++it){
ni=ind[it];
if(it>1)ht=pow(max(0,c[ind[it-1]]-r[ni]+1),2);
else ht=0;
for(int j=0;j<k;++j){
mx=0;
for(int t=it,nt;t<=n;++t){
nt=ind[t];
mx=max({mx,r[nt],c[nt]});
dp[t][j+1]=min(dp[t][j+1],dp[it-1][j]+(ll)pow(mx-min(r[ni],c[ni])+1,2)-ht);
}
}
}
return *min_element(begin(dp[n]),end(dp[n]));
}
int main() {
int n, m, k;
assert(3 == scanf("%d %d %d", &n, &m, &k));
std::vector<int> r(n), c(n);
for (int i = 0; i < n; i++) {
assert(2 == scanf("%d %d", &r[i], &c[i]));
}
long long ans = take_photos(n, m, k, r, c);
printf("%lld\n", ans);
return 0;
}