oj.uz

답안 #282332

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282332 2020-08-24T10:12:42 Z infinite_iq Magic Tree (CEOI19_magictree) C++14
61 / 100
 1016 ms 793328 KB 
#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.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2816 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 7032 KB Output is correct
2 Correct 110 ms 6520 KB Output is correct
3 Correct 270 ms 8272 KB Output is correct
4 Correct 248 ms 7864 KB Output is correct
5 Correct 268 ms 8312 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2816 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 3 ms 2816 KB Output is correct
4 Correct 268 ms 14456 KB Output is correct
5 Correct 271 ms 16376 KB Output is correct
6 Correct 320 ms 16376 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 449 ms 407680 KB Output is correct
2 Correct 467 ms 407800 KB Output is correct
3 Correct 445 ms 411456 KB Output is correct
4 Correct 366 ms 406760 KB Output is correct
5 Correct 212 ms 7416 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2816 KB Output is correct
10 Correct 427 ms 420112 KB Output is correct
11 Correct 405 ms 413816 KB Output is correct
12 Correct 392 ms 424184 KB Output is correct
13 Correct 342 ms 419176 KB Output is correct
14 Correct 181 ms 7416 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 159992 KB Output is correct
2 Correct 878 ms 788668 KB Output is correct
3 Correct 883 ms 789288 KB Output is correct
4 Correct 1000 ms 789432 KB Output is correct
5 Correct 1002 ms 787980 KB Output is correct
6 Correct 1016 ms 790908 KB Output is correct
7 Correct 916 ms 793328 KB Output is correct

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2816 KB Output is correct
10 Correct 3 ms 2816 KB Output is correct
11 Correct 4 ms 2816 KB Output is correct
12 Correct 3 ms 2816 KB Output is correct
13 Correct 268 ms 14456 KB Output is correct
14 Correct 271 ms 16376 KB Output is correct
15 Correct 320 ms 16376 KB Output is correct
16 Correct 427 ms 420112 KB Output is correct
17 Correct 405 ms 413816 KB Output is correct
18 Correct 392 ms 424184 KB Output is correct
19 Correct 342 ms 419176 KB Output is correct
20 Correct 181 ms 7416 KB Output is correct
21 Incorrect 326 ms 160372 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2816 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2816 KB Output is correct
9 Correct 2 ms 2816 KB Output is correct
10 Correct 124 ms 7032 KB Output is correct
11 Correct 110 ms 6520 KB Output is correct
12 Correct 270 ms 8272 KB Output is correct
13 Correct 248 ms 7864 KB Output is correct
14 Correct 268 ms 8312 KB Output is correct
15 Correct 3 ms 2816 KB Output is correct
16 Correct 4 ms 2816 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 268 ms 14456 KB Output is correct
19 Correct 271 ms 16376 KB Output is correct
20 Correct 320 ms 16376 KB Output is correct
21 Correct 449 ms 407680 KB Output is correct
22 Correct 467 ms 407800 KB Output is correct
23 Correct 445 ms 411456 KB Output is correct
24 Correct 366 ms 406760 KB Output is correct
25 Correct 212 ms 7416 KB Output is correct
26 Correct 427 ms 420112 KB Output is correct
27 Correct 405 ms 413816 KB Output is correct
28 Correct 392 ms 424184 KB Output is correct
29 Correct 342 ms 419176 KB Output is correct
30 Correct 181 ms 7416 KB Output is correct
31 Correct 170 ms 159992 KB Output is correct
32 Correct 878 ms 788668 KB Output is correct
33 Correct 883 ms 789288 KB Output is correct
34 Correct 1000 ms 789432 KB Output is correct
35 Correct 1002 ms 787980 KB Output is correct
36 Correct 1016 ms 790908 KB Output is correct
37 Correct 916 ms 793328 KB Output is correct
38 Incorrect 326 ms 160372 KB Output isn't correct
39 Halted 0 ms 0 KB -