Submission #941058

#	Time	Username	Problem	Language	Result	Execution time	Memory
941058		GrindMachine	Fireworks (APIO16_fireworks)	C++17	7 / 100	1 ms	1012 KiB

fireworks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 5e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

ll n,m;
vector<pll> adj[N];
vector<ll> depth(N);

void dfs1(ll u){
    for(auto [v,w] : adj[u]){
        depth[v] = depth[u]+w;
        dfs1(v);
    }
}

vector<ll> dp[N];
vector<ll> leaves[N];

void dfs2(ll u){
    if(adj[u].empty()){
        leaves[u].pb(u);
        dp[u].pb(0);
        return;
    }

    for(auto [v,w] : adj[u]){
        dfs2(v);
    }

    for(auto [v1,w1] : adj[u]){
        ll ptr1 = 0;
        trav(leaf1,leaves[v1]){
            leaves[u].pb(leaf1);
            dp[u].pb(dp[v1][ptr1++]);

            for(auto [v2,w2] : adj[u]){
                if(v2 == v1) conts;
                ll mn = inf2;
                ll ptr2 = 0;
                
                trav(leaf2,leaves[v2]){
                    ll have = depth[leaf2]-depth[u];
                    ll want = depth[leaf1]-depth[u];
                    ll cost = dp[v2][ptr2++]+abs(have-want);
                    amin(mn,cost);
                }

                dp[u].back() += mn;
            }
        }
    }
}

void solve(int test_case)
{
    cin >> n >> m;
    for(int i = 2; i <= n+m; ++i){
        ll p,w; cin >> p >> w;
        adj[p].pb({i,w});
    }

    dfs1(1);
    dfs2(1);

    ll ans = *min_element(all(dp[1]));
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 19
• Subtask 3: 0 / 29
• Subtask 4: 0 / 45