Submission #546313

#	Time	Username	Problem	Language	Result	Execution time	Memory
546313		zaneyu	Fireworks (APIO16_fireworks)	C++14	100 / 100	206 ms	69760 KiB

fireworks

/*input
4 6
1 5
2 5
2 8
3 3
3 2
3 3
2 9
4 4
4 3
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int par[maxn];
int n;
vector<int> v[maxn];
void dfs(int u,priority_queue<ll> &pq){
    if(u<n){
        for(int x:v[u]){
            priority_queue<ll> p;
            dfs(x,p);
            if(sz(p)>sz(pq)) p.swap(pq);
            while(sz(p)) pq.push(p.top()),p.pop();
        }
        REP(j,sz(v[u])-1) pq.pop();
        ll x=pq.top()+par[u];
        pq.pop();
        ll y=pq.top()+par[u];
        pq.pop();
        pq.push(x),pq.push(y);
    }
    else pq.push(par[u]),pq.push(par[u]);
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int m;
    cin>>n>>m;
    ll s=0;
    REP1(i,n+m-1){
        int a,b;
        cin>>a>>b;
        --a;
        v[a].pb(i);
        par[i]=b;
        s+=b;
    }
    priority_queue<ll> pq;
    dfs(0,pq);
    int k=0;
    ll pv=pq.top();
    pq.pop();
    while(sz(pq)){
        s-=(pv-pq.top())*k;
        pv=pq.top();
        pq.pop();
        ++k;
    }
    cout<<s-k*pv<<'\n';
}

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