제출 #424559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424559		jainbot27	Aliens (IOI16_aliens)	C++17	12 / 100	3 ms	2688 KiB

aliens

#include <bits/stdc++.h>
#include "aliens.h"
using namespace std;
 
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int) x.size()
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define FOR(i, a, b) for(auto i=(a); i<(b); i++)
#define ROF(i, a, b) for(auto i=(b)-1; i>=(a); i--)
#define F0R(i, n) FOR(i, 0, n)
#define R0F(i, n) ROF(i, 0, n)
 
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using pll=pair<ll, ll>;
using vi=vector<int>;
using vl=vector<ll>;
using vpii=vector<pii>;
 
template<class T> bool ckmin(T&a, const T&b) {return b<a?a=b,1:0;}
template<class T> bool ckmax(T&a, const T&b) {return b>a?a=b,1:0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int mxN=1e5+10;
const int MOD=1e9+7; 
const ll infLL=1e18;
const ld eps=1e-6;
 
ll n, m, k; 
vi r, c; 
vector<pair<ll, ll>> pts, pts2;
 
struct line{
	ll M, B; int idx;
	ll operator()(ll q)const{
		assert(idx!=-1);
		return M*q+B;
	}
	line(){M=-1, B=-1, idx=-1;}
	line(ll m, ll b, int IDX):M(m), B(b), idx(IDX){}
};
 
int L, R;
 
// we can do convex hull in linear cause we only have x is decreasing order
 
line A[mxN];
 
void add(line V){
	while(R-L>1&&pair<ll, ll>((A[R-1].B-A[R-2].B)*(A[R-1].M-V.M), A[R-1].idx)>pair<ll, ll>((V.B-A[R-1].B)*(A[R-2].M-A[R-1].M), V.idx)) R--; 
	A[R]=V; R++;
}
 
pair<ll, ll> qry(ll X){
	while(R-L>1&&pair<ll, ll>{A[L+1](X), A[L+1].idx}<pair<ll, ll>{A[L](X), A[L].idx}) L++; 
	assert(L!=R);
	return {A[L](X), A[L].idx};
}
 
pair<ll, ll> solve(ll x){
	pair<ll, ll> dp={0, 0};
	L=0, R=0; 
	F0R(i, n){
		ll A=max(i?pts[i-1].f-pts[i].s+1:0LL, 0LL), B=pts[i].s; 
		add(line(-2*B, dp.f-A*A+B*B, dp.s));;
		A=pts[i].f+1; 
		dp=qry(A);
		dp.s++; dp.f+=A*A+x; 
	}
	return dp;
}
 
ll take_photos(int N, int M, int K, vi R, vi C){
	n=N, m=M, k=K, r=R, c=C; 
	pts2.clear(); pts.clear();
	F0R(i, n){
		pts.pb({r[i], c[i]});
		if(pts[i].s>pts[i].f) swap(pts[i].s, pts[i].f);
	}
	sort(all(pts));
	F0R(i, n){
		if(!pts2.empty()&&pts[i].s<=pts2.back().s)
			pts2.pop_back(); 
		pts2.pb(pts[i]);
	}
	swap(pts, pts2); 
	n=siz(pts);
	ll lo=0, hi=(ll)1e12; ll ans=0;
	ckmin(k, n);
	while(lo<=hi){
		ll m=(lo+hi)/2; 
		auto cur=solve(m);
		if(cur.s<=k) 
			ans=cur.f, hi=m-1;
		else 
			lo=m+1;
	}
	return ans-lo*k;
}

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