Submission #928236

#	Time	Username	Problem	Language	Result	Execution time	Memory
928236		vjudge1	Magic Tree (CEOI19_magictree)	C++17	100 / 100	114 ms	38236 KiB

magictree

// #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 (stderr)

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

• Subtask 1: 6 / 6
• Subtask 2: 3 / 3
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 13 / 13
• Subtask 7: 22 / 22
• Subtask 8: 17 / 17