제출 #966443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966443		shadow_sami	Magic Tree (CEOI19_magictree)	C++17	13 / 100	88 ms	90964 KiB

magictree

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mxn = 1e3+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vi adj[mx];
vi adj2[mx];
ll d[mx];
ll w[mx];
ll sr;
ll id[mx];
ll dp[mxn][mxn];
ll timer = 0;
vi lis;
ll l,r,mid,pt;

ll get(ll x){
    l = 0;
    r = lis.size()-1;
    pt = r+1;
    while(l<=r){
        mid = l + (r-l) / 2;
        if(lis[mid]>=x){
            pt = mid;
            r = mid - 1;
        }else
            l = mid + 1;
    }
    return pt+1;
}

void dfs(ll u,ll par){
    fx(adj2[u])
        if(x!=par)
            dfs(x,u);
    fx(adj2[u]){
        if(x!=par){
            fjp(1,1001)
                dp[id[u]][j] += dp[id[x]][j];        
        }
    }    
    fjp(2,1001)
        dp[id[u]][j] = max(dp[id[u]][j-1],dp[id[u]][j]);
    fjn(1000,d[u])
        dp[id[u]][j] = max(dp[id[u]][j],dp[id[u]][d[u]]+w[u]);
    fjp(1,1001)
        ans = max(ans,dp[id[u]][j]);
    // debug(u);
    // fjp(1,10)
    //     cerr<<dp[u][j]<<" ";
    // cerr<<nli;
    return;
}

vi dfss(ll u,ll par){
    vi v,v2;
    fx(adj[u]){
        v2 = dfss(x,u);
        fx(v2)
            v.push_back(x);
    }
    if(d[u] < 0 && u!=1)
        return v;
    fx(v)
        adj2[u].push_back(x);
    v.clear();
    v.push_back(u);
    return v;
}

void dfs2(ll u,ll par){
    // debug(u);
    id[u] = timer;
    timer++;
    fx(adj2[u])
        dfs2(x,u);
    return;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m>>tp;
        fip(0,n+2){
        	adj[i].clear();
        	d[i] = -1;
        }
        fip(2,n+1){
        	cin>>sr;
        	adj[sr].push_back(i);
        }
        // fip()
        ans = 0;
        set<ll>st;
        fip(0,m){
        	cin>>res>>tp2>>tptp;
        	d[res] = tp2;
        	w[res] = tptp;
            st.insert(d[res]);
        }   
        fx(st)     
            lis.push_back(x);
        fip(1,n+1){
            if(d[i]>0){
                d[i] = get(d[i]);
            }
        }        
        ans = 0;
        fip(0,mxn)
            fjp(0,mxn)
                dp[i][j] = 0;
        dfss(1,-1);
        dfs2(1,-1);
        // fip(1,n+1){
        //     cout<<id[i]<<" ";
        // }
        // cout<<nli;
        dfs(1,-1);
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

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