제출 #307033

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307033		MarcoMeijer	Fireworks (APIO16_fireworks)	C++14	0 / 100	9 ms	12032 KiB

fireworks

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;

int n, m;
int p[MX];
ll c[MX];
vi chl[MX];

ll tot = 0;

lll dfsCost(ll u, ll depth) {
    if(chl[u].size() == 0) {
        return {tot-depth, 0};
    }

    vlll f;
    FOR(v,chl[u])
        f.pb(dfsCost(v, depth+c[v]));

    lll res;
    sort(all(f));
    int x=f.size();
    res.fi = f[x/2].fi;
    RE(i,x) {
        res.se += f[i].se;
        res.se += abs(f[i].fi-res.fi);
    }
    return res;
}
ll getCost(ll Tot) {
    tot = Tot;
    lll res = dfsCost(1, 0);
    return abs(res.fi) + res.se;
}

void program() {
    IN(n,m); n += m;
    p[1] = -1;
    REP(i,2,n+1) IN(p[i],c[i]);
    REP(i,2,n+1) chl[p[i]].pb(i);

    ll lb=0, ub=1e18;
    while(lb != ub) {
        ll mid = (lb+ub)/2;
        if(getCost(mid) <= getCost(mid+1)) ub=mid;
        else lb=mid+1;
    }
    ll ans = INF;
    RE(i,500) ans = min(ans,getCost(i));
    OUTL(ans);
}

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