제출 #471354

#제출 시각아이디문제언어결과실행 시간메모리
471354sofapudenAliens (IOI16_aliens)C++14
0 / 100
1 ms268 KiB
#include "aliens.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll INF = (1ll<<60);

ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
	vector<pair<ll,ll>> v(n);
	for(int i = 0; i < n; ++i){
		v[i] = {r[i],c[i]};
	}
	for(int i = 0; i < n; ++i){
		if(v[i].first > v[i].second)swap(v[i].first,v[i].second);
	}
	sort(v.begin(),v.end());
	ll st = v[0].first, cu = v[0].second;
	ll su = (cu-st+1)*(cu-st+1);
	ll cn = 1;
	for(int i = 0; i < n; ++i){
		if(v[i].second <= cu)continue;
		if((v[i].second-v[i].first+1)*(v[i].second-v[i].first+1) < (v[i].second-st+1)*(v[i].second-st+1)-(cu-st+1)*(cu-st+1)){
			cn++;
			su+=(v[i].second-v[i].first+1)*(v[i].second-v[i].first+1);
			st = v[i].first;
			cu = v[i].second;
		}
		else{
			su+=(v[i].second-st+1)*(v[i].second-st+1)-(cu-st+1)*(cu-st+1);
			cu = v[i].second;
		}
	}
	if(cn <= k)return su;
	ll l = 0, ri = INF, ans = INF;
	while(l <= ri){
		ll m = (l+ri)>>1;
		ll st = v[0].first, cu = v[0].second;
		ll su = (cu-st+1)*(cu-st+1);
		ll cn = 1;
		for(int i = 0; i < n; ++i){
			if(v[i].second <= cu)continue;
			if((v[i].second-v[i].first+1)*(v[i].second-v[i].first+1)+m < (v[i].second-st+1)*(v[i].second-st+1)-(cu-st+1)*(cu-st+1)){
				cn++;
				su+=(v[i].second-v[i].first+1)*(v[i].second-v[i].first+1);
				st = v[i].first;
				cu = v[i].second;
			}
			else{
				su+=(v[i].second-st+1)*(v[i].second-st+1)-(cu-st+1)*(cu-st+1);
				cu = v[i].second;
			}
		}
		if(cn <= k){
			ans = min(ans,su);
			ri = m-1;
		}
		else{
			l = m+1;
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...