Submission #282332

#	Time	Username	Problem	Language	Result	Execution time	Memory
282332		infinite_iq	Magic Tree (CEOI19_magictree)	C++14	61 / 100	1016 ms	793328 KiB

magictree

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll mod=998244353;
const ld Pi=acos(-1) ;
ll n , m , k ;
vll v [100009] ;
pll fruit [100009] ;
ll dp [100009][1000] ;
unordered_map < int , int > id ;
void dfs ( int node ) {
        for ( auto u : v [node] ) {
                dfs ( u ) ;
                for ( int i = 0 ; i < k ; i ++ ) {
                        dp [node][i] += dp [u][i] ;
                }
        }
        dp [node][fruit[node] .se] += fruit[node] .fi ;
        for ( int i = 1 ; i < k ; i ++ ) {
                dp [node][i] = max ( dp [node][i] , dp [node][i-1] ) ;
        }
}
ll tree [400009] , lzy [400009] ;
void lzyUpd ( int node , int l , int r ) {
        tree [node] = max ( tree [node] , lzy [node] ) ;
        if ( l != r ) {
                lzy [le] = max ( lzy [le] , lzy [node] ) ;
                lzy [ri] = max ( lzy [ri] , lzy [node] ) ;
        }
        lzy [node] = 0 ;
}
void upd ( int node , int l , int r , int s , int e , ll x ) {
        lzyUpd ( node , l , r ) ;
        if ( s > r || e < l ) return ;
        if ( s <= l && e >= r ) {
                lzy [node] = x ;
                lzyUpd ( node , l , r ) ;
                return ;
        }
        upd ( le , l , mid , s , e , x ) ;
        upd ( ri , mid + 1 , r , s , e , x ) ;
        tree [node] = max ( tree [le] , tree [ri] ) ;
}
ll query ( int node , int l , int r , int id ) {
        lzyUpd ( node , l , r );
        if ( l == r ) return tree [node] ;
        if ( id <= mid ) return query ( le , l , mid , id ) ;
        else return query ( ri , mid +1 , r , id ) ;
}
void solve () {
        for ( int i = n -1 ; i >= 0 ; i -- ) {
                if ( ! fruit [i] .fi ) C ;
                int day = fruit [i].se , w = fruit [i].fi ;
                ll val = query ( 1 , 0 , k-1 , day ) + w ;
                upd ( 1 , 0 , k-1 , day , k -1 , val ) ;
        }
        lzyUpd ( 1 , 0 , k-1 ) ;
        cout << tree [1] << endl ;
        exit (0) ;
}
int main () {
        cin >> n >> m >> k ;
        int sub3 = 1 ;
        for ( int i = 2 ; i <= n ; i ++ ) {
                int a , b = i ;
                cin >> a ;
                a -- , b -- ;
                v [a] .pb ( b ) ;
                sub3 &= ( a == b-1 ) ;
        }
        set < int > s ;
        ll sum = 0 , z = 1;
        for ( int i = 0 ; i < m ; i ++ ) {
                int node , day , w ;
                cin >> node >> day >> w ;
                node -- , day -- ;
                fruit [node] = { w , day } ;
                s .ins ( day ) ;
                sum += w ;
                z &= ( v [node] .size () == 0 ) ;
        }
        if ( sub3 ) solve () ;
        if (z) {
                cout << sum << endl ;
                exit (0) ;
        }
        int N = 0 ;
        for ( auto u : s ) {
                id [u] = N ++ ;
        }
        for ( int i = 0 ; i < n ; i ++ ) {
                if ( fruit [i] .fi ) {
                        fruit [i] .se = id [fruit[i].se] ;
                }
        }
        k = N ;
        dfs ( 0 ) ;
        cout << dp [0][k-1] << endl ;
}

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