제출 #169081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169081		mohammad_kilani	Aliens (IOI16_aliens)	C++17	12 / 100	255 ms	126360 KiB

aliens

#include <bits/stdc++.h>
#include "aliens.h"
using namespace std;
const int N = 4010 , K = 4010;
vector< pair<int,int> > arr , tmp;
long long dp[N][K];
int n , m , k;

long long solve(int i,int cur){
	if(i == n)
		return 0;
	if(cur == k)
		return (long long)1e18;
	if(dp[i][cur] != -1)
		return dp[i][cur];
	dp[i][cur] = (long long)1e18;
	int mx = -1;
	for(int j = i ;j < n;j++){
		mx = max(mx,arr[j].second);
		dp[i][cur] = min(dp[i][cur] , (long long)(mx - arr[i].first + 1) * (long long)(mx - arr[i].first + 1) + solve(j + 1, cur + 1));
	}
	return dp[i][cur];
}

long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c){
	::n = n;
	::m = m;
	::k = k;
	for(int i = 0 ;i < n;i++){
		arr.push_back(make_pair(min(r[i] , c[i]) , max(r[i] , c[i])));
	}
	sort(arr.begin(),arr.end());
	int mx = -1;
	for(int i = 0 ;i < (int)arr.size();i++){
		if(arr[i].second > mx){
			tmp.push_back(arr[i]);
			mx = arr[i].second;
		}
	}
	arr = tmp;
	n = (int)arr.size();
	memset(dp,-1,sizeof(dp));
    return solve(0 , 0);
}

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