Submission #1114891

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114891		vladilius	Road Closures (APIO21_roads)	C++17	100 / 100	704 ms	89200 KiB

roads

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
#define pb push_back
#define ff first
#define ss second
#define arr3 array<ll, 3>
 
struct DS{
    struct node{
        int l, r, c;
        ll s;
        node(){
            l = r = 0;
            c = s = 0;
        }
    };
    vector<node> t;
    ll n;
    int cc;
    void init(){
        n = 1e14;
        t.pb(node());
        t.pb(node());
        cc = 1;
    }
    int nw(){
        t.pb(node());
        return ++cc;
    }
    void add(int v, ll tl, ll tr, ll& p){
        if (tl == tr){
            t[v].c++;
            t[v].s += p;
            return;
        }
        ll tm = (tl + tr) / 2;
        if (p <= tm){
            if (!t[v].l) t[v].l = nw();
            add(t[v].l, tl, tm, p);
        }
        else {
            if (!t[v].r) t[v].r = nw();
            add(t[v].r, tm + 1, tr, p);
        }
        t[v].c = 0;
        if (t[v].l) t[v].c += t[t[v].l].c;
        if (t[v].r) t[v].c += t[t[v].r].c;
        t[v].s = 0;
        if (t[v].l) t[v].s += t[t[v].l].s;
        if (t[v].r) t[v].s += t[t[v].r].s;
    }
    void add(ll x){
        add(1, 1, n, x);
    }
    void rem(int v, ll tl, ll tr, ll& p){
        if (tl == tr){
            t[v].c--;
            t[v].s -= p;
            return;
        }
        ll tm = (tl + tr) / 2;
        if (p <= tm){
            rem(t[v].l, tl, tm, p);
        }
        else {
            rem(t[v].r, tm + 1, tr, p);
        }
        t[v].c = 0;
        if (t[v].l) t[v].c += t[t[v].l].c;
        if (t[v].r) t[v].c += t[t[v].r].c;
        t[v].s = 0;
        if (t[v].l) t[v].s += t[t[v].l].s;
        if (t[v].r) t[v].s += t[t[v].r].s;
    }
    void rem(ll x){
        rem(1, 1, n, x);
    }
    int sz(){
        if (t.size() == 1) return 0;
        return t[1].c;
    }
    ll fn(int v, ll tl, ll tr, int k){
        if (tl == tr) return tl;
        ll tm = (tl + tr) / 2;
        if (t[v].r && (t[t[v].r].c >= k)){
            return fn(t[v].r, tm + 1, tr, k);
        }
        int S = t[v].r ? t[t[v].r].c : 0;
        return fn(t[v].l, tl, tm, k - S);
    }
    pil sum(int v, ll tl, ll tr, ll l, ll r){
        if (l > tr || r < tl) return {0, 0};
        if (l <= tl && tr <= r) return {t[v].c, t[v].s};
        ll tm = (tl + tr) / 2;
        pil out;
        if (t[v].l){
            auto [c, s] = sum(t[v].l, tl, tm, l, r);
            out.ff += c; out.ss += s;
        }
        if (t[v].r){
            auto [c, s] = sum(t[v].r, tm + 1, tr, l, r);
            out.ff += c; out.ss += s;
        }
        return out;
    }
    ll get(int k){
        k = min(k, sz());
        if (!k) return 0;
        ll p = fn(1, 1, n, k);
        if (p == n) return n * k;
        auto [c, s] = sum(1, 1, n, p + 1, n);
        return s + p * (k - c);
    }
    void clear(){
        t.clear();
        t.pb(node());
        t.pb(node());
        cc = 1;
    }
};
 
vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W){
    vector<pii> g[n + 1];
    ll tot = 0;
    for (int i = 0; i < n - 1; i++){
        int u = U[i] + 1, v = V[i] + 1, w = W[i];
        g[u].pb({v, w});
        g[v].pb({u, w});
        tot += w;
    }
    
    vector<pil> ch1[n + 1], ch2[n + 1];
    vector<pll> p(n + 1);
    vector<ll> W1(n + 1);
    DS T; T.init();
    function<void(int, int)> dfs = [&](int v, int pr){
        if ((g[v].size() + !pr) == 1){
            ch1[v] = {{0, 0}};
            ch2[v] = {{0, 0}};
            return;
        }
        for (auto [i, w]: g[v]){
            if (i == pr) continue;
            dfs(i, v);
        }
        
        vector<arr3> t;
        T.clear();
        for (auto [i, w]: g[v]){
            if (i == pr) continue;
            p[i].ff = p[i].ss = 0;
            T.add(w);
            W1[i] = w;
            for (auto [j, x]: ch1[i]){
                t.pb({j, i, x});
            }
            for (auto [j, x]: ch2[i]){
                t.pb({j, -i, x});
            }
        }
        
        sort(t.begin(), t.end());
        int p1 = 0; ll sum = 0;
        while (p1 < t.size()){
            int p2 = p1;
            while (p2 < t.size() && t[p1][0] == t[p2][0]){
                auto [j, i, x] = t[p2];
                if (i > 0){
                    ll f = p[i].ff + W1[i] - p[i].ss;
                    if (f > 0) T.rem(f);
                    p[i].ff = x;
                    f = p[i].ff + W1[i] - p[i].ss;
                    if (f > 0) T.add(f);
                }
                else {
                    i = -i;
                    sum -= p[i].ss;
                    ll f = p[i].ff + W1[i] - p[i].ss;
                    if (f > 0) T.rem(f);
                    p[i].ss = x;
                    f = p[i].ff + W1[i] - p[i].ss;
                    if (f > 0) T.add(f);
                    sum += p[i].ss;
                }
                p2++;
            }
            
            ch2[v].pb({t[p1][0], sum + T.get((int) t[p1][0])});
            if (!t[p1][0]) ch1[v].pb({0, sum});
            else ch1[v].pb({t[p1][0], sum + T.get((int) t[p1][0] - 1)});
 
            int R = (int)((p2 == (int) t.size()) ? n : t[p2][0]);
            for (int j = (int) t[p1][0] + 1; j <= min(R - 1, T.sz()); j++){
                ch2[v].pb({j, sum + T.get(j)});
            }
            for (int j = (int) t[p1][0] + 1; j <= min(R - 1, T.sz() + 1); j++){
                if (!j) ch1[v].pb({0, sum});
                else ch1[v].pb({j, sum + T.get(j - 1)});
            }
            p1 = p2;
        }
    };
    dfs(1, 0);
    
    vector<ll> dp(n);
    for (int i = 0; i < ch2[1].size(); i++){
        int R = (i == (ch2[1].size() - 1)) ? n : ch2[1][i + 1].ff;
        for (int j = ch2[1][i].ff; j < R; j++){
            dp[j] = ch2[1][i].ss;
        }
    }
    
    vector<ll> out;
    for (int i = 0; i < n; i++){
        out.pb(tot - dp[i]);
    }
    return out;
}

Compilation message (stderr)

roads.cpp: In lambda function:
roads.cpp:168:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         while (p1 < t.size()){
      |                ~~~^~~~~~~~~~
roads.cpp:170:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |             while (p2 < t.size() && t[p1][0] == t[p2][0]){
      |                    ~~~^~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:210:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  210 |     for (int i = 0; i < ch2[1].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~
roads.cpp:211:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  211 |         int R = (i == (ch2[1].size() - 1)) ? n : ch2[1][i + 1].ff;
      |                  ~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 17 / 17
• Subtask 6: 25 / 25
• Subtask 7: 22 / 22