oj.uz

Submission #956720

# Submission time Handle Problem Language Result Execution time Memory
956720 2024-04-02T11:34:44 Z thangdz2k7 Magic Tree (CEOI19_magictree) C++17
100 / 100
 118 ms 41744 KB 
// author : HuuHung
// 25.3.2024


#include <bits/stdc++.h>
#define ii pair <int, int>
#define F first
#define S second
#define ll long long
#define lb long double
#define pb push_back
#define vi vector <int>
#define vll vector <ll>
#define Bit(x, i) ((x) >> (i) & 1)
#define Mask(i) (1ll << (i))
#define All(v) (v).begin(), (v).end()

using namespace std;

void maxzi(int &a, int b){
    a = max(a, b);
}

void minzi(int &a, int b){
    a = min(a, b);
}

const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int LG = 20;

void add(int &a, int b){
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int Pow(int a, int b){
    if (b == 0) return 1;
    if (b % 2) return 1ll * a * Pow(a, b - 1) % mod;
    int c = Pow(a, b / 2);
    return 1ll * c * c % mod;
}

// * end

int n, m, k;
int d[N], w[N];
vector <int> adj[N];
map <int, ll> dp[N];

void dfs(int u){
    for (int v : adj[u]){
        dfs(v);
        if (dp[u].size() < dp[v].size()) swap(dp[u], dp[v]);
        for (auto x : dp[v]) dp[u][x.F] += x.S;
    }

    if (d[u]){
        dp[u][d[u]] += w[u];
        while (true){
            auto t = dp[u].upper_bound(d[u]);
            if (t == dp[u].end()) break;
            if (t -> S > w[u]){
                t -> S -= w[u];
                break;
            }
            w[u] -= t -> S;
            dp[u].erase(t);
        }
    }
}

void solve(){
    cin >> n >> m >> k;
    for (int i = 2, p; i <= n; ++ i){
        cin >> p;
        adj[p].pb(i);
    }

    for (int i = 1, v; i <= m; ++ i){
        cin >> v;
        cin >> d[v] >> w[v];
    }

    dfs(1);
    ll ans = 0;
    for (auto v : dp[1]) ans += v.S;
    cout << ans;
}


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t --) solve();

    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14968 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14776 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 24404 KB Output is correct
2 Correct 31 ms 26200 KB Output is correct
3 Correct 103 ms 41744 KB Output is correct
4 Correct 57 ms 24936 KB Output is correct
5 Correct 77 ms 26704 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 4 ms 15196 KB Output is correct
4 Correct 40 ms 32592 KB Output is correct
5 Correct 57 ms 36436 KB Output is correct
6 Correct 56 ms 32600 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 20564 KB Output is correct
2 Correct 45 ms 19700 KB Output is correct
3 Correct 39 ms 24560 KB Output is correct
4 Correct 30 ms 21216 KB Output is correct
5 Correct 38 ms 32592 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14968 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14776 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 57 ms 23388 KB Output is correct
11 Correct 60 ms 22484 KB Output is correct
12 Correct 42 ms 24400 KB Output is correct
13 Correct 28 ms 21288 KB Output is correct
14 Correct 37 ms 32512 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15448 KB Output is correct
2 Correct 19 ms 16996 KB Output is correct
3 Correct 22 ms 16988 KB Output is correct
4 Correct 23 ms 17044 KB Output is correct
5 Correct 10 ms 15832 KB Output is correct
6 Correct 21 ms 19548 KB Output is correct
7 Correct 21 ms 23388 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14968 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14776 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 4 ms 15196 KB Output is correct
13 Correct 40 ms 32592 KB Output is correct
14 Correct 57 ms 36436 KB Output is correct
15 Correct 56 ms 32600 KB Output is correct
16 Correct 57 ms 23388 KB Output is correct
17 Correct 60 ms 22484 KB Output is correct
18 Correct 42 ms 24400 KB Output is correct
19 Correct 28 ms 21288 KB Output is correct
20 Correct 37 ms 32512 KB Output is correct
21 Correct 17 ms 17756 KB Output is correct
22 Correct 52 ms 24692 KB Output is correct
23 Correct 58 ms 27984 KB Output is correct
24 Correct 102 ms 35812 KB Output is correct
25 Correct 50 ms 25044 KB Output is correct
26 Correct 71 ms 26708 KB Output is correct
27 Correct 60 ms 26192 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 4 ms 14968 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 14776 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 43 ms 24404 KB Output is correct
11 Correct 31 ms 26200 KB Output is correct
12 Correct 103 ms 41744 KB Output is correct
13 Correct 57 ms 24936 KB Output is correct
14 Correct 77 ms 26704 KB Output is correct
15 Correct 4 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 4 ms 15196 KB Output is correct
18 Correct 40 ms 32592 KB Output is correct
19 Correct 57 ms 36436 KB Output is correct
20 Correct 56 ms 32600 KB Output is correct
21 Correct 47 ms 20564 KB Output is correct
22 Correct 45 ms 19700 KB Output is correct
23 Correct 39 ms 24560 KB Output is correct
24 Correct 30 ms 21216 KB Output is correct
25 Correct 38 ms 32592 KB Output is correct
26 Correct 57 ms 23388 KB Output is correct
27 Correct 60 ms 22484 KB Output is correct
28 Correct 42 ms 24400 KB Output is correct
29 Correct 28 ms 21288 KB Output is correct
30 Correct 37 ms 32512 KB Output is correct
31 Correct 7 ms 15448 KB Output is correct
32 Correct 19 ms 16996 KB Output is correct
33 Correct 22 ms 16988 KB Output is correct
34 Correct 23 ms 17044 KB Output is correct
35 Correct 10 ms 15832 KB Output is correct
36 Correct 21 ms 19548 KB Output is correct
37 Correct 21 ms 23388 KB Output is correct
38 Correct 17 ms 17756 KB Output is correct
39 Correct 52 ms 24692 KB Output is correct
40 Correct 58 ms 27984 KB Output is correct
41 Correct 102 ms 35812 KB Output is correct
42 Correct 50 ms 25044 KB Output is correct
43 Correct 71 ms 26708 KB Output is correct
44 Correct 60 ms 26192 KB Output is correct
45 Correct 17 ms 18268 KB Output is correct
46 Correct 58 ms 25560 KB Output is correct
47 Correct 64 ms 28752 KB Output is correct
48 Correct 118 ms 37968 KB Output is correct
49 Correct 56 ms 25044 KB Output is correct
50 Correct 77 ms 26988 KB Output is correct
51 Correct 72 ms 26708 KB Output is correct