제출 #831888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831888		CSQ31	Aliens (IOI16_aliens)	C++17	25 / 100	2013 ms	24540 KiB

aliens

#include "aliens.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
vector<ll>dp[100001];
const ll INF = 1e18;
ll take_photos(int n, int m, int K, vector<int> r, vector<int> c) {
	vector<pii>tmp,p;
	for(int i=0;i<n;i++)tmp.pb({min(r[i],c[i]),max(r[i],c[i])});
	sort(all(tmp),[&](pii x,pii y){
		if(x.fi==y.fi)return x.se > y.se;
		return y.fi > x.fi;
	});
	int mx = -1;
	for(pii x:tmp){
		if(mx >= x.se)continue;
		mx = max(mx,x.se);
		p.pb(x);
	}
	n = sz(p);
	p.pb({-1,-1});
	sort(all(p),[&](pii x,pii y){
		return y.se > x.se;
	});
	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=0;j<i;j++){
			for(int k=1;k<=K;k++){
				ll x = (p[i].se - p[j+1].fi + 1);
				ll y = max(p[j].se - p[j+1].fi+1,0);
				x*=x;
				y*=y;
				dp[i][k] = min(dp[i][k], dp[j][k-1] + x - y); 
				
			}
		}
	}
	ll ans = INF;
	for(int i=1;i<=K;i++)ans = min(ans,dp[n][i]);
	return ans;
}

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