Submission #778610

#	Time	Username	Problem	Language	Result	Execution time	Memory
778610		doowey	Aliens (IOI16_aliens)	C++17	0 / 100	1 ms	308 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;

#define fi first
#define se second
#define mp make_pair

const ld inf = (ld)1e18;


struct line{
    ll ai;
    ll bi;
    int cn;
    ld lim;
};

vector<line> hull;

ld inter(line aa, line bb){
    return (ld)(aa.bi - bb.bi) / (ld)(bb.ai - aa.ai);
}

void put_line(ll aa, ll bb, int c){
    aa=-aa;
    bb=-bb; // assume a is increasing
    line nw = {aa, bb, c, inf};
    line l1, l2;
    while(hull.size() >= 2){
        l1 = hull[hull.size() - 2];
        l2 = hull[hull.size() - 1];
        if(inter(l1, l2) >= inter(l2, nw)) {
            hull.pop_back();
        }
        else{
            break;
        }
    }
    if(!hull.empty()) hull.back().lim=inter(hull.back(), nw);
    hull.push_back(nw);
}

pair<ll, int> query(ll xi){
    int l = 0;
    int r = (int)hull.size();
    int mid;
    while(l + 1 < r){
        mid = (l + r) / 2;
        if(xi <= hull[mid].lim){
            l=mid;
        }
        else{
            r=mid;
        }
    }
    return mp(-xi * 1ll * hull[l].ai - hull[l].bi, hull[l].cn);
}

const int N = (int)1e5 + 10;
vector<pii> T;
ll dp[N];
int cnt[N];

ll sq(ll x){
    return x * 1ll * x;
}

void compute(int n, int k, ll penalty){
    dp[0]=cnt[0]=0;
    hull.clear();
    for(int i = 1; i < n; i ++ ){
        dp[i]=inf;
    }
    ll B;
    pair<ll, int> ndp;
    for(int i = 1 ; i < n; i ++ ){
        B = sq(max(T[i - 1].se - T[i].fi, 0));
        put_line(-2ll * T[i].fi, sq(T[i].fi) + dp[i - 1] + B + penalty, cnt[i - 1]);
        ndp = query(T[i].se);
        ndp.fi += sq(T[i].se);
        ndp.se ++ ;
        dp[i] = ndp.fi;
        cnt[i] = ndp.se;
    }
}


ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) {
    vector<pii> segt;
    for(int i = 0 ; i < n ; i ++ ){
        segt.push_back(mp(min(r[i], c[i]), max(r[i],c[i])));
    }
    sort(segt.begin(), segt.end(), [&](pii i, pii j){
        if(i.fi == j.fi){
            return i.se > j.se;
        }
        else{
            return i.fi < j.fi;
        }
    });
    T.push_back(mp(-1,-1));
    for(auto x : segt){
        if(x.se > T.back().se){
            T.push_back(x);
        }
    }
    for(int i = 1; i < n; i ++ ) T[i].fi -- ;
    n=T.size();
    k = min(k, n - 1);
    compute(n, k, 0);
    ll lef = 0, rig = (ll)1e18;
    ll mid;
    while(lef + 1 < rig){
        mid = (lef + rig) / 2;
        compute(n, k, mid);
        if(cnt[n - 1] <= k)
            lef = mid;
        else
            rig = mid;
    }
    compute(n, k, lef);
    return dp[n - 1] - k * 1ll * lef;
}

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