oj.uz

답안 #928236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928236 2024-02-16T05:42:11 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
100 / 100
 114 ms 38236 KB 
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
    template <typename T1, typename T2>
    std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
    {
        in >> x.first >> x.second;
        return in;
    }

    template <typename T1, typename T2>
    std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
    {
        out << x.first << " " << x.second;
        return out;
    }

    template <typename T1>
    std::istream &operator>>(std::istream &in, std::vector<T1> &x)
    {
        for (auto &i : x)
            in >> i;
        return in;
    }

    template <typename T1>
    std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
    {
        for (auto &i : x)
            out << i << " ";
        return out;
    }

    template <typename T1>
    std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
    {
        for (auto &i : x)
            out << i << " ";
        return out;
    }
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
    ios_base ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

#define int ll

struct test
{
    vector<vector<int>> tree;
    vector<pii> vals;
    vector<map<int, int>> els;

    void dfs(int v)
    {
        for (auto tov : tree[v])
        {
            dfs(tov);
            if (els[v].size() < els[tov].size())
                swap(els[tov], els[v]);
            for (auto el : els[tov])
                els[v][el.f] += el.s;
        }

        if (vals[v].f)
        {
            auto [d, S] = vals[v];
            els[v][d] += S;
            auto it = els[v].upper_bound(d);
            int sum = 0;
            while (it != els[v].end())
            {
                sum += it->s;
                if (sum >= S)
                {
                    it->s = sum - S;
                    break;
                }
                els[v].erase(it);
                it = els[v].upper_bound(d);
            }
        }
        // cout << v << ": "
        //      << "\n";
        // for (auto el : els[v])
        //     cout << el << "\n";
        // cout << "\n";
    }

    void solve(int testcase)
    {
        boost();

        int n, m, k;
        cin >> n >> m >> k;
        tree.resize(n);
        vals.resize(n);
        els.resize(n);

        for (int i = 1; i < n; ++i)
        {
            int p;
            cin >> p;
            --p;
            tree[p].pb(i);
        }
        for (int i = 0; i < m; ++i)
        {
            int v, d, w;
            cin >> v >> d >> w;
            --v;
            vals[v] = {d, w};
        }

        dfs(0);

        int res = 0;
        for (auto el : els[0])
            res += el.s;
        cout << res << "\n";
    }
};

main()
{
    boost();
    int q = 1;
    // cin >> q;
    for (int i = 0; i < q; i++)
    {
        test t;
        t.solve(i);
    }
    return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
//                                                                                    //
//                               Coded by Der_Vlἀpos                                  //
//                                                                                    //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message

magictree.cpp:171:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  171 | main()
      | ^~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 19500 KB Output is correct
2 Correct 32 ms 20508 KB Output is correct
3 Correct 106 ms 38236 KB Output is correct
4 Correct 52 ms 21248 KB Output is correct
5 Correct 79 ms 23120 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 42 ms 26704 KB Output is correct
5 Correct 63 ms 30544 KB Output is correct
6 Correct 58 ms 26700 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 16556 KB Output is correct
2 Correct 39 ms 15816 KB Output is correct
3 Correct 39 ms 19812 KB Output is correct
4 Correct 34 ms 17104 KB Output is correct
5 Correct 37 ms 26772 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 74 ms 20012 KB Output is correct
11 Correct 54 ms 18800 KB Output is correct
12 Correct 40 ms 19236 KB Output is correct
13 Correct 28 ms 16600 KB Output is correct
14 Correct 37 ms 26192 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 20 ms 11612 KB Output is correct
3 Correct 22 ms 11604 KB Output is correct
4 Correct 19 ms 11608 KB Output is correct
5 Correct 9 ms 10460 KB Output is correct
6 Correct 19 ms 13884 KB Output is correct
7 Correct 20 ms 17244 KB Output is correct

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 42 ms 26704 KB Output is correct
14 Correct 63 ms 30544 KB Output is correct
15 Correct 58 ms 26700 KB Output is correct
16 Correct 74 ms 20012 KB Output is correct
17 Correct 54 ms 18800 KB Output is correct
18 Correct 40 ms 19236 KB Output is correct
19 Correct 28 ms 16600 KB Output is correct
20 Correct 37 ms 26192 KB Output is correct
21 Correct 14 ms 5980 KB Output is correct
22 Correct 54 ms 21348 KB Output is correct
23 Correct 76 ms 26156 KB Output is correct
24 Correct 114 ms 37324 KB Output is correct
25 Correct 50 ms 20428 KB Output is correct
26 Correct 84 ms 23120 KB Output is correct
27 Correct 82 ms 21840 KB Output is correct

Subtask #8
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 47 ms 19500 KB Output is correct
11 Correct 32 ms 20508 KB Output is correct
12 Correct 106 ms 38236 KB Output is correct
13 Correct 52 ms 21248 KB Output is correct
14 Correct 79 ms 23120 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 42 ms 26704 KB Output is correct
19 Correct 63 ms 30544 KB Output is correct
20 Correct 58 ms 26700 KB Output is correct
21 Correct 56 ms 16556 KB Output is correct
22 Correct 39 ms 15816 KB Output is correct
23 Correct 39 ms 19812 KB Output is correct
24 Correct 34 ms 17104 KB Output is correct
25 Correct 37 ms 26772 KB Output is correct
26 Correct 74 ms 20012 KB Output is correct
27 Correct 54 ms 18800 KB Output is correct
28 Correct 40 ms 19236 KB Output is correct
29 Correct 28 ms 16600 KB Output is correct
30 Correct 37 ms 26192 KB Output is correct
31 Correct 4 ms 2652 KB Output is correct
32 Correct 20 ms 11612 KB Output is correct
33 Correct 22 ms 11604 KB Output is correct
34 Correct 19 ms 11608 KB Output is correct
35 Correct 9 ms 10460 KB Output is correct
36 Correct 19 ms 13884 KB Output is correct
37 Correct 20 ms 17244 KB Output is correct
38 Correct 14 ms 5980 KB Output is correct
39 Correct 54 ms 21348 KB Output is correct
40 Correct 76 ms 26156 KB Output is correct
41 Correct 114 ms 37324 KB Output is correct
42 Correct 50 ms 20428 KB Output is correct
43 Correct 84 ms 23120 KB Output is correct
44 Correct 82 ms 21840 KB Output is correct
45 Correct 15 ms 5724 KB Output is correct
46 Correct 55 ms 20820 KB Output is correct
47 Correct 64 ms 24400 KB Output is correct
48 Correct 98 ms 34384 KB Output is correct
49 Correct 53 ms 21200 KB Output is correct
50 Correct 79 ms 23120 KB Output is correct
51 Correct 67 ms 21976 KB Output is correct