oj.uz

답안 #336836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336836 2020-12-17T01:22:06 Z 12tqian Magic Tree (CEOI19_magictree) C++17
100 / 100
 170 ms 37484 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define sz(x) (int) (x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define resz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define f1r(i, a, b) for (int i = (a); i < (b); ++i)
#define f0r(i, a) f1r(i, 0, a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i,0,a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define trav(a, x) for (auto& a : x)

mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> using V = vector<T>;

#ifdef LOCAL
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define dbg(...) 17;
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) { bool f = true; os << "{"; for (const auto &x : c) { if (!f) os << ", "; f = false; os << x; } return os << "}"; }
template<typename T> void debug(string s, T x) { cerr << s << " = " << x << "\n"; }
template<typename T, typename... Args> void debug(string s, T x, Args... args) { cerr << s.substr(0, s.find(',')) << " = " << x << " | "; debug(s.substr(s.find(',') + 2), args...); }

constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1, T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, int SZ> void re(array<T, SZ>& a);
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) {
        re(t); re(ts...); }
    template<class T> void re(complex<T>& x) { T a, b; re(a, b); x = cd(a, b); }
    template<class T1, class T2> void re(pair<T1, T2>& p) { re(p.f, p.s); }
    template<class T> void re(vector<T>& a) { F0R(i, sz(a)) re(a[i]); }
    template<class T, int SZ> void re(array<T, SZ>& a) { F0R(i, SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    template<class T> void pr(const complex<T>& x) { cout << x; }
    template<class T1, class T2> void pr(const pair<T1, T2>& x);
    template<class T> void pr(const T& x);
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
        pr(t); pr(ts...); }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{", x.f, ", ", x.s, "}"); }
    template<class T> void pr(const T& x) {
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst ? ", " : "", a), fst = 0;
        pr("}"); }
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); }
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(), "r", stdin); }
    void setOut(string s) { freopen(s.c_str(), "w", stdout); }
    void setIO(string s = "") {
        cin.sync_with_stdio(0); cin.tie(0);
        if (sz(s)) { setIn(s + ".in"), setOut(s + ".out"); }
    }
}

using namespace io;

const int MOD = 1e9 + 7; // 998244353;
const ld PI = acos((ld) -1);

typedef std::decay <decltype(MOD)>::type mod_t;
struct mi {
    mod_t val;
    explicit operator mod_t() const { return val; }
    mi() { val = 0; }
    mi(const long long& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD; }
    friend std::istream& operator >> (std::istream& in, mi& a) { 
        long long x; std::cin >> x; a = mi(x); return in; }
    friend std::ostream& operator << (std::ostream& os, const mi& a) { return os << a.val; }
    friend void pr(const mi& a) { pr(a.val); }
    friend void re(mi& a) { long long x; cin >> x; a = mi(x); }
    friend bool operator == (const mi& a, const mi& b) { return a.val == b.val; }
    friend bool operator != (const mi& a, const mi& b) { return !(a == b); }    
    friend bool operator < (const mi& a, const mi& b) { return a.val < b.val; }
    friend bool operator > (const mi& a, const mi& b) { return a.val > b.val; }
    friend bool operator <= (const mi& a, const mi& b) { return a.val <= b.val; }
    friend bool operator >= (const mi& a, const mi& b) { return a.val >= b.val; }
    mi operator - () const { return mi(-val); }
    mi& operator += (const mi& m) {
        if ((val += m.val) >= MOD) val -= MOD;
        return *this; }
    mi& operator -= (const mi& m) {
        if ((val -= m.val) < 0) val += MOD;
        return *this; }
    mi& operator *= (const mi& m) { val = (long long) val * m.val % MOD;
        return *this; }
    friend mi pow(mi a, long long p) {
        mi ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p & 1) ans *= a;
        return ans; }
    friend mi inv(const mi& a) { assert(a != 0); return pow(a, MOD - 2); }
    mi& operator /= (const mi& m) { return (*this) *= inv(m); }
    friend mi operator + (mi a, const mi& b) { return a += b; }
    friend mi operator - (mi a, const mi& b) { return a -= b; }
    friend mi operator * (mi a, const mi& b) { return a *= b; }
    friend mi operator / (mi a, const mi& b) { return a /= b; }
};
typedef pair<mi, mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int main() {
    setIO("");
    int n, m, k; re(n, m, k);
    vector<vi> adj(n);
    vector<map<int,ll>> dp(n);
    vpi vals(n);
    f1r(i, 1, n) {
        int p; re(p); p--;
        adj[i].eb(p);
        adj[p].eb(i);
    }
    f0r(i, m) {
        int v, d, w; re(v, d, w);
        v--;
        vals[v] = {d, w};
    }
    auto comb = [&](map<int, ll>& a, map<int, ll>& b) {
        if (sz(a) < sz(b)) swap(a, b);
        for (auto& x : b) {
            a[x.f] += x.s;
        }
    };
    auto root = [&](int src, int d, int w) {
        auto& st = dp[src];
        st[d] += w;
        auto it = st.ub(d);
        while (it != st.end() && w) {
            int rem = min((ll) w, (*it).s);
            (*it).s -= rem;
            w -= rem;
            if ((*it).s == 0) {
                it = next(it);
                st.erase(prev(it));
            }
        }
    };
    function<void(int, int)> dfs = [&](int src, int par) {
        for (int nxt : adj[src]) {
            if (nxt == par) continue;
            dfs(nxt, src);
            comb(dp[src], dp[nxt]);
        }
        if (vals[src].f) {
            root(src, vals[src].f, vals[src].s);
        }
    };
    dfs(0, -1);
    ll ans = 0;
    for (auto& x : dp[0]) {
        ans += x.s;
    }
    ps(ans);
    return 0;
}

Compilation message

magictree.cpp: In function 'void io::setIn(std::string)':
magictree.cpp:153:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  153 |     void setIn(string s) { freopen(s.c_str(), "r", stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
magictree.cpp: In function 'void io::setOut(std::string)':
magictree.cpp:154:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  154 |     void setOut(string s) { freopen(s.c_str(), "w", stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 19180 KB Output is correct
2 Correct 59 ms 20588 KB Output is correct
3 Correct 170 ms 37484 KB Output is correct
4 Correct 103 ms 21092 KB Output is correct
5 Correct 146 ms 22636 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 620 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 67 ms 26988 KB Output is correct
5 Correct 89 ms 30956 KB Output is correct
6 Correct 80 ms 26988 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 15084 KB Output is correct
2 Correct 90 ms 14280 KB Output is correct
3 Correct 75 ms 18668 KB Output is correct
4 Correct 54 ms 17380 KB Output is correct
5 Correct 62 ms 26988 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 98 ms 17900 KB Output is correct
11 Correct 102 ms 17004 KB Output is correct
12 Correct 75 ms 18668 KB Output is correct
13 Correct 51 ms 17380 KB Output is correct
14 Correct 68 ms 26988 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2796 KB Output is correct
2 Correct 50 ms 11628 KB Output is correct
3 Correct 48 ms 11628 KB Output is correct
4 Correct 51 ms 11628 KB Output is correct
5 Correct 21 ms 11876 KB Output is correct
6 Correct 43 ms 14700 KB Output is correct
7 Correct 41 ms 17644 KB Output is correct

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 67 ms 26988 KB Output is correct
14 Correct 89 ms 30956 KB Output is correct
15 Correct 80 ms 26988 KB Output is correct
16 Correct 98 ms 17900 KB Output is correct
17 Correct 102 ms 17004 KB Output is correct
18 Correct 75 ms 18668 KB Output is correct
19 Correct 51 ms 17380 KB Output is correct
20 Correct 68 ms 26988 KB Output is correct
21 Correct 20 ms 5100 KB Output is correct
22 Correct 98 ms 19436 KB Output is correct
23 Correct 110 ms 22612 KB Output is correct
24 Correct 146 ms 30208 KB Output is correct
25 Correct 99 ms 21092 KB Output is correct
26 Correct 124 ms 22028 KB Output is correct
27 Correct 100 ms 20204 KB Output is correct

Subtask #8
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 86 ms 19180 KB Output is correct
11 Correct 59 ms 20588 KB Output is correct
12 Correct 170 ms 37484 KB Output is correct
13 Correct 103 ms 21092 KB Output is correct
14 Correct 146 ms 22636 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 1 ms 620 KB Output is correct
18 Correct 67 ms 26988 KB Output is correct
19 Correct 89 ms 30956 KB Output is correct
20 Correct 80 ms 26988 KB Output is correct
21 Correct 93 ms 15084 KB Output is correct
22 Correct 90 ms 14280 KB Output is correct
23 Correct 75 ms 18668 KB Output is correct
24 Correct 54 ms 17380 KB Output is correct
25 Correct 62 ms 26988 KB Output is correct
26 Correct 98 ms 17900 KB Output is correct
27 Correct 102 ms 17004 KB Output is correct
28 Correct 75 ms 18668 KB Output is correct
29 Correct 51 ms 17380 KB Output is correct
30 Correct 68 ms 26988 KB Output is correct
31 Correct 8 ms 2796 KB Output is correct
32 Correct 50 ms 11628 KB Output is correct
33 Correct 48 ms 11628 KB Output is correct
34 Correct 51 ms 11628 KB Output is correct
35 Correct 21 ms 11876 KB Output is correct
36 Correct 43 ms 14700 KB Output is correct
37 Correct 41 ms 17644 KB Output is correct
38 Correct 20 ms 5100 KB Output is correct
39 Correct 98 ms 19436 KB Output is correct
40 Correct 110 ms 22612 KB Output is correct
41 Correct 146 ms 30208 KB Output is correct
42 Correct 99 ms 21092 KB Output is correct
43 Correct 124 ms 22028 KB Output is correct
44 Correct 100 ms 20204 KB Output is correct
45 Correct 26 ms 5484 KB Output is correct
46 Correct 101 ms 20096 KB Output is correct
47 Correct 115 ms 23404 KB Output is correct
48 Correct 170 ms 32492 KB Output is correct
49 Correct 128 ms 21092 KB Output is correct
50 Correct 138 ms 22252 KB Output is correct
51 Correct 118 ms 20588 KB Output is correct