oj.uz

Submission #477740

# Submission time Handle Problem Language Result Execution time Memory
477740 2021-10-03T11:00:54 Z Lam_lai_cuoc_doi Magic Tree (CEOI19_magictree) C++17
100 / 100
 152 ms 17116 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T>
void read(T &x)
{
    x = 0;
    register int c;
    while ((c = getchar()) && (c > '9' || c < '0'))
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
}

constexpr bool typetest = 0;

// https : //codeforces.com/blog/entry/68748
// ki thuat "dao ham": thay vi tinh dp[x], ta tinh dp[x] - dp[x - 1]

constexpr int N = 1e5 + 5;
int n, m, k;
map<int, ll> dp[N];
int d[N], w[N];
vector<int> adj[N];

void Read()
{
    cin >> n >> m >> k;
    for (int i = 2; i <= n; ++i)
    {
        int p;
        cin >> p;
        adj[p].emplace_back(i);
    }
    for (int i = 1; i <= m; ++i)
    {
        int v;
        cin >> v;
        cin >> d[v] >> w[v];
    }
}

void Solve()
{
    for (int v = n; v; --v)
    {
        for (auto i : adj[v])
        {
            if (dp[v].size() < dp[i].size())
                swap(dp[i], dp[v]);

            for (auto j : dp[i])
                dp[v][j.first] += j.second;
            dp[i].clear();
        }

        if (d[v])
        {
            ll juice = w[v];
            while (true)
            {
                auto i = dp[v].upper_bound(d[v]);
                if (i == dp[v].end())
                    break;

                if (i->second <= juice)
                {
                    juice -= i->second;
                    dp[v].erase(i);
                }
                else
                {
                    i->second -= juice;
                    break;
                }
            }

            dp[v][d[v]] += w[v];
        }
    }

    ll ans(0);
    for (auto i : dp[1])
        ans += i.second;

    cout << ans;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        //cout << "Case #" << _ << ":\n";
        Read();
        Solve();
    }
    //cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

Compilation message

magictree.cpp: In function 'void read(T&)':
magictree.cpp:12:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   12 |     register int c;
      |                  ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7244 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7360 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 4 ms 7244 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7244 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 12616 KB Output is correct
2 Correct 41 ms 12612 KB Output is correct
3 Correct 152 ms 17116 KB Output is correct
4 Correct 74 ms 16260 KB Output is correct
5 Correct 103 ms 16836 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 63 ms 13128 KB Output is correct
5 Correct 80 ms 17028 KB Output is correct
6 Correct 73 ms 13164 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 14536 KB Output is correct
2 Correct 64 ms 13952 KB Output is correct
3 Correct 55 ms 13056 KB Output is correct
4 Correct 56 ms 15936 KB Output is correct
5 Correct 52 ms 13388 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7244 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7360 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 4 ms 7244 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7244 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 78 ms 14728 KB Output is correct
11 Correct 71 ms 14200 KB Output is correct
12 Correct 52 ms 12484 KB Output is correct
13 Correct 43 ms 15168 KB Output is correct
14 Correct 47 ms 12740 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8012 KB Output is correct
2 Correct 30 ms 10284 KB Output is correct
3 Correct 30 ms 10316 KB Output is correct
4 Correct 29 ms 10332 KB Output is correct
5 Correct 13 ms 8884 KB Output is correct
6 Correct 25 ms 10004 KB Output is correct
7 Correct 36 ms 11128 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7244 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7360 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 4 ms 7244 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7244 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 5 ms 7500 KB Output is correct
11 Correct 5 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 63 ms 13128 KB Output is correct
14 Correct 80 ms 17028 KB Output is correct
15 Correct 73 ms 13164 KB Output is correct
16 Correct 78 ms 14728 KB Output is correct
17 Correct 71 ms 14200 KB Output is correct
18 Correct 52 ms 12484 KB Output is correct
19 Correct 43 ms 15168 KB Output is correct
20 Correct 47 ms 12740 KB Output is correct
21 Correct 21 ms 9036 KB Output is correct
22 Correct 64 ms 12964 KB Output is correct
23 Correct 84 ms 13340 KB Output is correct
24 Correct 122 ms 15608 KB Output is correct
25 Correct 73 ms 15564 KB Output is correct
26 Correct 93 ms 15228 KB Output is correct
27 Correct 78 ms 14020 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 6 ms 7244 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 5 ms 7360 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 4 ms 7244 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7244 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 57 ms 12616 KB Output is correct
11 Correct 41 ms 12612 KB Output is correct
12 Correct 152 ms 17116 KB Output is correct
13 Correct 74 ms 16260 KB Output is correct
14 Correct 103 ms 16836 KB Output is correct
15 Correct 5 ms 7500 KB Output is correct
16 Correct 5 ms 7372 KB Output is correct
17 Correct 5 ms 7372 KB Output is correct
18 Correct 63 ms 13128 KB Output is correct
19 Correct 80 ms 17028 KB Output is correct
20 Correct 73 ms 13164 KB Output is correct
21 Correct 75 ms 14536 KB Output is correct
22 Correct 64 ms 13952 KB Output is correct
23 Correct 55 ms 13056 KB Output is correct
24 Correct 56 ms 15936 KB Output is correct
25 Correct 52 ms 13388 KB Output is correct
26 Correct 78 ms 14728 KB Output is correct
27 Correct 71 ms 14200 KB Output is correct
28 Correct 52 ms 12484 KB Output is correct
29 Correct 43 ms 15168 KB Output is correct
30 Correct 47 ms 12740 KB Output is correct
31 Correct 9 ms 8012 KB Output is correct
32 Correct 30 ms 10284 KB Output is correct
33 Correct 30 ms 10316 KB Output is correct
34 Correct 29 ms 10332 KB Output is correct
35 Correct 13 ms 8884 KB Output is correct
36 Correct 25 ms 10004 KB Output is correct
37 Correct 36 ms 11128 KB Output is correct
38 Correct 21 ms 9036 KB Output is correct
39 Correct 64 ms 12964 KB Output is correct
40 Correct 84 ms 13340 KB Output is correct
41 Correct 122 ms 15608 KB Output is correct
42 Correct 73 ms 15564 KB Output is correct
43 Correct 93 ms 15228 KB Output is correct
44 Correct 78 ms 14020 KB Output is correct
45 Correct 31 ms 9164 KB Output is correct
46 Correct 79 ms 13764 KB Output is correct
47 Correct 87 ms 14068 KB Output is correct
48 Correct 128 ms 16844 KB Output is correct
49 Correct 72 ms 16140 KB Output is correct
50 Correct 103 ms 16196 KB Output is correct
51 Correct 97 ms 14796 KB Output is correct