제출 #1084881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1084881		fyan	Aliens (IOI16_aliens)	C++14	41 / 100	583 ms	2760 KiB

aliens

#include "bits/stdc++.h"
using namespace std;
#define int int64_t 
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int MXN=4e3+5, INF=1e9;
int N,M,K;
array<int,2> arr[MXN];
int dp[MXN], amt[MXN];

bool cc1(const array<int,2> &a, const array<int,2> &b) {
	if (a[0]==b[0]) {
		return a[1]>b[1];
	}
	return a[0]<b[0];
}
bool cc2(const array<int,2> &a, const array<int,2> &b) {
	return a[1]<b[1];
}

int check(int w) {
	memset(dp,0x3f,sizeof(dp));
	memset(amt,0,sizeof(amt));
	dp[0] = 0;
	for (int i=1; i<=N; i++) {
		for (int p=0; p<i; p++) {
			int area = (arr[i][1]-arr[p+1][0]+1)*(arr[i][1]-arr[p+1][0]+1);
			int dif = 1ll*max(0ll,arr[p][1]-arr[p+1][0]+1ll)*max(0ll,arr[p][1]-arr[p+1][0]+1ll);
			area -= dif;
			int val = dp[p]+area+w;
			if (val < dp[i]) {
				dp[i] = val, amt[i] = amt[p]+1;
			}
		}
	}
	return amt[N];
}

int search(int lo, int hi) {
	if (lo==hi) return lo;
	if (lo+1==hi) {
		if (check(hi)==K) return hi;
		return lo;
	}
	int mid = (lo+hi)/2;
	if (check(mid) <= K) {
		return search(lo,mid);
	}
	return search(mid,hi);
}

int take_photos(int32_t n, int32_t m, int32_t k, vector<int32_t> r, vector<int32_t> c) {
	N = n, M = m, K = k;
	for (int i=1; i<=N; i++) {
		arr[i] = {min(r[i-1],c[i-1]),max(r[i-1],c[i-1])};
	}
	arr[0] = {-INF,-INF};
	sort(arr,arr+N+1,cc1);
	int pv = 0,sub = 0;
	for (int i=1; i<=N; i++) {
		if (arr[pv][1] >= arr[i][1]) {
			sub++; arr[i] = {INF,INF};
		} else pv = i;
	}
	sort(arr,arr+1+N,cc2);
	N -= sub; K = min(K,N);
	
	int w = search(-1e12,1e12);
	check(w);
	while (amt[N] > K) {
		w++; check(w);
	}
	return dp[N]-w*(K);
}

/*
signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int32_t a,b,c; cin>>a>>b>>c;
	vector<int32_t> x(a),y(a);
	for (int i=0; i<a; i++) {
		cin>>x[i]>>y[i];
	}
	cout<<take_photos(a,b,c,x,y);
	
	return 0;
}
*/

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