제출 #347655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
347655		Kerim	Aliens (IOI16_aliens)	C++17	25 / 100	2063 ms	620 KiB

aliens

#include "aliens.h"
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
bool cmp(PII x,PII y){
	if(x.ff!=y.ff)
		return (x.ff<y.ff);
	return (x.ss>y.ss);	
}
ll sqr(int x){
	return x*1LL*x;	
}
const ll B=1e18;
ll dp[MAXN];
vector<ll>m,b;
int sz;
double inter(int l1,int l2){
	return (b[l2]-b[l1])/(m[l1]-m[l2]);	
}
bool bad(int l1,int l2,int l3){
	return inter(l1,l3)<inter(l1,l2);	
}
void upd(ll x,ll y){
	m.pb(x);b.pb(y);sz++;
	while(sz>=3 and bad(sz-3,sz-2,sz-1)){
		m.erase(m.end()-2);
		b.erase(b.end()-2);
		sz--;
	}
}
ll get(ll x){
	ll ans=B;
	for(int i=0;i<sz;i++)
		umin(ans,m[i]*x+b[i]);
	return ans;		
}
ll take_photos(int n, int M, int k, vector<int> r, vector<int> c) {
	vector<PII>arr,v;
	for(int i=0;i<n;i++)
		v.pb(mp(min(r[i],c[i]),max(r[i],c[i])));
	sort(all(v),cmp);arr.pb(mp(-1,-1));
	for(int i=0;i<int(v.size());i++)
		if(arr.back().ss<v[i].ss)
			arr.pb(v[i]);
	n=int(arr.size())-1;
	for(int i=1;i<=n;i++)
		dp[i]=B;
	ll ans=B;
	for(int i=1;i<=k;i++){
		m.clear();b.clear();sz=0;
		for(int j=0,h;j<=n;j++){
			ll old=dp[j];
			dp[j]=min(B,get(2*arr[j].ss)+sqr(arr[j].ss));
			if(j<n)
				h=j,upd(-(arr[h+1].ff-1),sqr(arr[h+1].ff-1)+old-sqr(max(0,arr[h].ss-arr[h+1].ff+1)));	
		}
		/*
		for(int j=n;j>=0;j--){
			dp[j]=B;
			for(int h=0;h<j;h++)
				umin(dp[j],dp[h]+sqr(arr[j].ss-(arr[h+1].ff-1))-sqr(max(0,arr[h].ss-arr[h+1].ff+1)));
		}*/
		umin(ans,dp[n]);
	}
    return ans;
}
//(x-y)(x-y)=x^2-2*x*y+y^2

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