Submission #614340

#	Time	Username	Problem	Language	Result	Execution time	Memory
614340		rrrr10000	Fireworks (APIO16_fireworks)	C++14	7 / 100	1 ms	304 KiB

fireworks

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define popcnt __builtin_popcountll
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}

int main(){
    ll n,m;cin>>n>>m;
    n+=m;
    vvp g(n);
    REP(i,1,n){
        ll a,b;cin>>a>>b;a--;
        g[a].pb(i,b);
    }
    vector<pair<P,ll>> dp(n);
    function<void(ll)> dfs=[&](ll i){
        if(g[i].size()==0)return;
        vp al;
        for(auto x:g[i]){
            dfs(x.fi);
            al.pb(dp[x.fi].fi.fi+x.se,dp[x.fi].fi.se+x.se);
            dp[i].se+=dp[x.fi].se;
        }
        vi srt;
        for(auto x:al){
            srt.pb(x.fi);srt.pb(x.se);
        }
        sort(all(srt));
        dp[i].fi=P(srt[srt.size()/2-1],srt[srt.size()/2]);
        for(auto x:al)dp[i].se+=max({0ll,dp[i].fi.fi-x.se,x.fi-dp[i].fi.fi});
    };dfs(0);
    out(dp[0].se);
}

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