# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
680486 | ngrace | Aliens (IOI16_aliens) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define ll long long
#define ii pair<long long,long long>
#define fi first
#define se second
v<ii> ph;
ll C(int i, int j){ // i>j, j is exclusive.
ll len = ph[i].se - ph[j+1].fi + 1;
ll intersect = max(0LL, ph[j].se - ph[j+1].fi + 1);
return len*len - intersect*intersect;
}
v<ll> dplast, dpcur;
void comp(int l, int r, int optl, int optr){
if(l>r) return;
int m=(l+r)/2;
dpcur[m] = 1e18;
int opt;
for(int i=optl; i<=min(m-1, optr); i++){
ll cur = dplast[i] + C(m,i);
if(cur<dpcur[m]){
dpcur[m]=cur;
opt=i;
}
}