oj.uz

답안 #853235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853235 2023-09-23T17:02:44 Z wakandaaa Magic Tree (CEOI19_magictree) C++17
100 / 100
 122 ms 108112 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, m, k;
vector<int> adj[N];
map<int, int> f[N];
int val[N], moment[N];

void dfs(int u) {
    for (int v : adj[u]) {
        dfs(v);
        if ((int) f[v].size() > (int) f[u].size()) swap(f[u], f[v]);
        for (auto i : f[v]) f[u][i.fi] += i.se;
    }
    f[u][moment[u]] += val[u];
    auto it = f[u].upper_bound(moment[u]);
    int rem = val[u];
    while (rem && it != f[u].end()) {
        if (rem >= it->se) {
            rem -= it->se;
            it = f[u].erase(it);
        } else {
            it->se -= rem;
            rem = 0;
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

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

    for (int i = 1; i <= m; ++i) {
        int u, d, c;
        cin >> u >> d >> c;
        val[u] = c;
        moment[u] = d;
    }

    dfs(1);

    int res = 0;
    for (auto i : f[1]) res += i.se;
    cout << res;

    return 0;
}

/*

*/

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74080 KB Output is correct
2 Correct 15 ms 74076 KB Output is correct
3 Correct 16 ms 74076 KB Output is correct
4 Correct 15 ms 74076 KB Output is correct
5 Correct 15 ms 74080 KB Output is correct
6 Correct 15 ms 74076 KB Output is correct
7 Correct 15 ms 74040 KB Output is correct
8 Correct 15 ms 74072 KB Output is correct
9 Correct 17 ms 74076 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 91476 KB Output is correct
2 Correct 50 ms 88292 KB Output is correct
3 Correct 120 ms 108112 KB Output is correct
4 Correct 71 ms 91092 KB Output is correct
5 Correct 99 ms 92468 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 74076 KB Output is correct
2 Correct 17 ms 74080 KB Output is correct
3 Correct 19 ms 74332 KB Output is correct
4 Correct 55 ms 97388 KB Output is correct
5 Correct 77 ms 101204 KB Output is correct
6 Correct 67 ms 97316 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 86716 KB Output is correct
2 Correct 59 ms 85844 KB Output is correct
3 Correct 54 ms 89680 KB Output is correct
4 Correct 44 ms 86988 KB Output is correct
5 Correct 54 ms 97588 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74080 KB Output is correct
2 Correct 15 ms 74076 KB Output is correct
3 Correct 16 ms 74076 KB Output is correct
4 Correct 15 ms 74076 KB Output is correct
5 Correct 15 ms 74080 KB Output is correct
6 Correct 15 ms 74076 KB Output is correct
7 Correct 15 ms 74040 KB Output is correct
8 Correct 15 ms 74072 KB Output is correct
9 Correct 17 ms 74076 KB Output is correct
10 Correct 70 ms 88784 KB Output is correct
11 Correct 65 ms 87888 KB Output is correct
12 Correct 59 ms 89348 KB Output is correct
13 Correct 47 ms 86272 KB Output is correct
14 Correct 53 ms 96852 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 75356 KB Output is correct
2 Correct 50 ms 84068 KB Output is correct
3 Correct 43 ms 84052 KB Output is correct
4 Correct 51 ms 84052 KB Output is correct
5 Correct 29 ms 85464 KB Output is correct
6 Correct 45 ms 87088 KB Output is correct
7 Correct 40 ms 88400 KB Output is correct

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74080 KB Output is correct
2 Correct 15 ms 74076 KB Output is correct
3 Correct 16 ms 74076 KB Output is correct
4 Correct 15 ms 74076 KB Output is correct
5 Correct 15 ms 74080 KB Output is correct
6 Correct 15 ms 74076 KB Output is correct
7 Correct 15 ms 74040 KB Output is correct
8 Correct 15 ms 74072 KB Output is correct
9 Correct 17 ms 74076 KB Output is correct
10 Correct 16 ms 74076 KB Output is correct
11 Correct 17 ms 74080 KB Output is correct
12 Correct 19 ms 74332 KB Output is correct
13 Correct 55 ms 97388 KB Output is correct
14 Correct 77 ms 101204 KB Output is correct
15 Correct 67 ms 97316 KB Output is correct
16 Correct 70 ms 88784 KB Output is correct
17 Correct 65 ms 87888 KB Output is correct
18 Correct 59 ms 89348 KB Output is correct
19 Correct 47 ms 86272 KB Output is correct
20 Correct 53 ms 96852 KB Output is correct
21 Correct 29 ms 77404 KB Output is correct
22 Correct 73 ms 91412 KB Output is correct
23 Correct 86 ms 94548 KB Output is correct
24 Correct 118 ms 101512 KB Output is correct
25 Correct 69 ms 90272 KB Output is correct
26 Correct 86 ms 92236 KB Output is correct
27 Correct 76 ms 90964 KB Output is correct

Subtask #8
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 74080 KB Output is correct
2 Correct 15 ms 74076 KB Output is correct
3 Correct 16 ms 74076 KB Output is correct
4 Correct 15 ms 74076 KB Output is correct
5 Correct 15 ms 74080 KB Output is correct
6 Correct 15 ms 74076 KB Output is correct
7 Correct 15 ms 74040 KB Output is correct
8 Correct 15 ms 74072 KB Output is correct
9 Correct 17 ms 74076 KB Output is correct
10 Correct 70 ms 91476 KB Output is correct
11 Correct 50 ms 88292 KB Output is correct
12 Correct 120 ms 108112 KB Output is correct
13 Correct 71 ms 91092 KB Output is correct
14 Correct 99 ms 92468 KB Output is correct
15 Correct 16 ms 74076 KB Output is correct
16 Correct 17 ms 74080 KB Output is correct
17 Correct 19 ms 74332 KB Output is correct
18 Correct 55 ms 97388 KB Output is correct
19 Correct 77 ms 101204 KB Output is correct
20 Correct 67 ms 97316 KB Output is correct
21 Correct 61 ms 86716 KB Output is correct
22 Correct 59 ms 85844 KB Output is correct
23 Correct 54 ms 89680 KB Output is correct
24 Correct 44 ms 86988 KB Output is correct
25 Correct 54 ms 97588 KB Output is correct
26 Correct 70 ms 88784 KB Output is correct
27 Correct 65 ms 87888 KB Output is correct
28 Correct 59 ms 89348 KB Output is correct
29 Correct 47 ms 86272 KB Output is correct
30 Correct 53 ms 96852 KB Output is correct
31 Correct 21 ms 75356 KB Output is correct
32 Correct 50 ms 84068 KB Output is correct
33 Correct 43 ms 84052 KB Output is correct
34 Correct 51 ms 84052 KB Output is correct
35 Correct 29 ms 85464 KB Output is correct
36 Correct 45 ms 87088 KB Output is correct
37 Correct 40 ms 88400 KB Output is correct
38 Correct 29 ms 77404 KB Output is correct
39 Correct 73 ms 91412 KB Output is correct
40 Correct 86 ms 94548 KB Output is correct
41 Correct 118 ms 101512 KB Output is correct
42 Correct 69 ms 90272 KB Output is correct
43 Correct 86 ms 92236 KB Output is correct
44 Correct 76 ms 90964 KB Output is correct
45 Correct 32 ms 78288 KB Output is correct
46 Correct 83 ms 92500 KB Output is correct
47 Correct 100 ms 96088 KB Output is correct
48 Correct 122 ms 104560 KB Output is correct
49 Correct 71 ms 91168 KB Output is correct
50 Correct 105 ms 93264 KB Output is correct
51 Correct 80 ms 91884 KB Output is correct