제출 #569848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569848		CSQ31	Aliens (IOI16_aliens)	C++17	12 / 100	99 ms	4612 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
vector<ll>dp[100001];
const ll INF = 1e18;
long long take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
    vector<int>h(m,m);
    for(int i=0;i<n;i++){
		int a = max(r[i],c[i]);
		int b = min(r[i],c[i]);
		h[a] = min(h[a],b);
	}
	int L = m;
	vector<int>b;
	for(int i=m-1;i>=0;i--){
		if(h[i]==m)continue;
		if(h[i]<L)b.push_back(i);
		L = min(L,h[i]);	
	}
	b.push_back(-1);
	reverse(b.begin(),b.end());
	n = b.size()-1;
	for(int i=0;i<=n;i++){
		dp[i].assign(k+1,INF);
	}
	dp[0][0] = 0;
	for(int i=1;i<=n;i++){
		for(int j=i-1;j>=0;j--){
			for(int l=1;l<=k;l++){
				if(dp[j][l-1] != INF){
					ll len = b[i] - h[b[j+1]]+1;
					len*=len;
					dp[i][l] = min(dp[i][l],dp[j][l-1] + len);
				}
			}
			
		}
	}
	ll ans = INF;
	for(int i=1;i<=k;i++)ans = min(ans,dp[n][i]);
	return ans;
}

• Subtask 1: 0 / 4
• Subtask 2: 12 / 12
• Subtask 3: 0 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40