Submission #259900

#	Time	Username	Problem	Language	Result	Execution time	Memory
259900		MarcoMeijer	Magic Tree (CEOI19_magictree)	C++14	0 / 100	2147 ms	941236 KiB

magictree

#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 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()

// 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 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 OUTL(const T&... t) {OUT(t..., "\n"); }

//===================//
//  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 = 2e5;
int n, m, k;
int p[MX];
int v[MX], d[MX], w[MX];
int D[MX], W[MX];
vi chl[MX];
map<ll,ll> dp[MX];

void add(map<ll,ll>& mp, ll d, ll w) {
    auto it = mp.upper_bound(d);

    if(it == mp.begin()) {
        mp[d] = w;
        return;
    }

    it--;
    ll val = mp[d] = it->se+w;
    it = mp.upper_bound(d);
    while(it != mp.end() && it->se <= val) {
        it = mp.erase(it);
    }
}
void combine(map<ll,ll>& a, map<ll,ll>& b) {
    FOR(p,b) a[p.fi] += p.se;
}

void program() {
    IN(n,m,k);
    REI(i,2,n) IN(p[i]);
    RE(i,m) IN(v[i],d[i],w[i]);
    RE1(i,n) D[i]=k, W[i]=0;
    RE(i,m) D[v[i]]=d[i], W[v[i]]=w[i];

    REI(i,2,n) chl[p[i]].pb(i);

    REV(i,2,n+1) {
        if(W[i]) add(dp[i], D[i], W[i]);
        combine(dp[p[i]], dp[i]);
    }

    ll ans=0;
    FOR(p,dp[1]) ans+=p.se;
    OUTL(ans);
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17