| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 531256 | David_M | Aliens (IOI16_aliens) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
deque<pair<pii, int> > dq;
int o;
bool check (int k, int b){
auto [k0,b0]=dq[0].F;
auto [k1,b1]=dq[1].F;
//k1 * x + b1 = k0 * x + b0
//(b0 - b1) / (k1 - k0)
//k1 * x + b1 = k * x + b
//(b - b1) / (k1 - k)
//k < k0 < k1
//(b - b1) / (k1 - k) > (b0 - b1) / (k1 - k0)
//(b - b1) * (k1 - k0) - (b0 - b1) * (k1 - k) > 0
return (b - b1) * (k1 - k0) - (b0 - b1) * (k1 - k) > 0;
}
void add(int k, int b, int cnt){
while(dq.size()>1 && check(k, b))dq.pop_front(),o=max(o-1,(ll)0);
dq.push_front({{k,b},cnt});
}
pii get(int i, ll x, ll C){
auto [k,b]=dq[i].F;
//cout<<"[i, k, b, x]: "<<i<<" "<<k<<" "<<b<<" "<<x<<endl;
return {k*x+b, dq[i].S};
}
ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
ll Ans=0;
vector<pii> v, V(n);
for (int i=0; i<n; i++){
if(c[i]<r[i])swap(r[i], c[i]);
V[i]={r[i], -c[i]};
}
sort(all(V));
int rr=0;
for (auto [l,r]:V){
r*=-1;
////cout<<r<<endl;
if(r>rr)v.pb({l,r+1});
rr=max(r, rr);
}
V.clear();
n=v.size();
for (auto [l,r]:v){
//cout<<"[l, r]: "<<l<<" "<<r<<endl;
}
ll L=0, R=1e18;
while(L<=R){
ll C=(L+R)>>1;
vector<pii> dp(n+1);
dp[0]={0,0};
for (int i=1; i<=n; i++){
auto &[ans, cnt]=dp[i];
int r=v[i-1].S;
ans=r*r+C;
//cout<<"[ans]: "<<ans<<endl;
cnt=1;
int x=r;
while(i>1 && get(o,x,C)>get(o+1,x,C))o++;
if(i>1){
auto [ans0, cnt0]=get(o,x,C);
//cout<<"[o]: "<<o<<" "<<dq.size()<<endl;
ans+=ans0;
cnt+=cnt0;
}
if(i==n)continue;
int l=v[i].F;
add(-2*l, ans + l*l - max((ll)0, r-l)*max((ll)0, r-l), cnt);
}
for (auto [x, y]:dp){
//cout<<"[dp]: "<<x<<" "<<y<<endl;
}
if(dp[n].S>k){
L=C+1;
}else{
Ans=dp[n].F-dp[n].S*C;
//cout<<"[C, Ans]: "<<C<<" "<<Ans<<endl;
R=C-1;
}
dq.clear();
o=0;
}
//dp + (r1-l)^2 - (r2-l)^2
//dp + r1*r1 + l*l - 2*r1*l - (r2-l)^2
//(-2*l) * r1 + (dp - r2*r2 + 2*r2*l)
return Ans;
}
main() {
int n, m, k;
assert(3 == scanf("%d %d %d", &n, &m, &k));
std::vector<int> r(n), c(n);
for (int i = 0; i < n; i++) {
assert(2 == scanf("%d %d", &r[i], &c[i]));
}
long long ans = take_photos(n, m, k, r, c);
printf("%lld\n", ans);
return 0;
}
/*
5 7 2
0 3
4 4
4 6
4 5
4 6
*/