結果

問題 No.1524 Upward Mobility
ユーザー rniyarniya
提出日時 2021-05-29 15:53:01
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 149 ms / 6,000 ms
コード長 5,030 bytes
コンパイル時間 2,403 ms
コンパイル使用メモリ 211,632 KB
実行使用メモリ 37,268 KB
最終ジャッジ日時 2023-08-07 18:38:08
合計ジャッジ時間 7,132 ms
ジャッジサーバーID
(参考情報)
judge11 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 137 ms
16,232 KB
testcase_01 AC 106 ms
13,436 KB
testcase_02 AC 138 ms
13,924 KB
testcase_03 AC 95 ms
22,044 KB
testcase_04 AC 133 ms
14,124 KB
testcase_05 AC 132 ms
12,984 KB
testcase_06 AC 125 ms
13,004 KB
testcase_07 AC 125 ms
12,700 KB
testcase_08 AC 122 ms
13,256 KB
testcase_09 AC 126 ms
13,860 KB
testcase_10 AC 149 ms
15,628 KB
testcase_11 AC 102 ms
37,268 KB
testcase_12 AC 63 ms
31,340 KB
testcase_13 AC 81 ms
31,280 KB
testcase_14 AC 77 ms
22,204 KB
testcase_15 AC 95 ms
22,464 KB
testcase_16 AC 126 ms
13,004 KB
testcase_17 AC 104 ms
11,140 KB
testcase_18 AC 25 ms
5,468 KB
testcase_19 AC 91 ms
11,508 KB
testcase_20 AC 32 ms
6,004 KB
testcase_21 AC 38 ms
7,112 KB
testcase_22 AC 1 ms
4,380 KB
testcase_23 AC 1 ms
4,380 KB
testcase_24 AC 1 ms
4,388 KB
testcase_25 AC 1 ms
4,388 KB
testcase_26 AC 2 ms
4,384 KB
testcase_27 AC 2 ms
4,384 KB
testcase_28 AC 2 ms
4,380 KB
testcase_29 AC 61 ms
12,696 KB
testcase_30 AC 63 ms
12,676 KB
testcase_31 AC 75 ms
12,692 KB
testcase_32 AC 137 ms
13,776 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    for (int i = 1; i < N; i++) {
        int p;
        cin >> p;
        G[--p].emplace_back(i);
    }
    vector<int> a(N), b(N);
    for (int& x : a) cin >> x;
    for (int& x : b) cin >> x;

    auto dfs = [&](auto self, int v) -> map<int, ll, greater<int>> {
        map<int, ll, greater<int>> res;
        for (int& u : G[v]) {
            auto ch = self(self, u);
            if (res.size() < ch.size()) swap(res, ch);
            for (auto p : ch) res[p.first] += p.second;
        }
        res[a[v]] += b[v];
        ll sum = b[v];
        for (auto itr = res.upper_bound(a[v]); itr != res.end(); itr = res.erase(itr)) {
            if (sum < itr->second) {
                itr->second -= sum;
                break;
            }
            sum -= itr->second;
        }
        return res;
    };

    auto root = dfs(dfs, 0);
    ll ans = 0;
    for (auto p : root) ans += p.second;
    cout << ans << '\n';
    return 0;
}
0