Submission #75814210

---

Source Code Expand

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; int N, M; cin >> N >> M;
    vector<int> w(N+1), p(N+1), cnt(N+1), cv(N+1);
    for (int i = 1; i <= N; i++) cin >> w[i];
    for (int i = 2; i <= N; i++) {
        cin >> p[i];
        cnt[p[i]]++; cv[p[i]]++;
    }
    queue<int> q; int ans = 0, s = 0;
    for (int i = 1; i <= N; i++) {
        if (cnt[i] == 0) {
            q.push(i);
            s += w[i];
        }
    }
    ans = max(ans, s);
    while (!q.empty()) {
        int i = q.front(); q.pop();
        cnt[p[i]]--;
        if (cnt[p[i]] == 0) {
            q.push(p[i]); s++;
            ans = max(ans, s);
            s -= cv[p[i]];
        }
    }
    if (ans <= M) cout << ans << "\n";
    else cout << "OOM\n";
    return 0;
}

Submission Info

Judge Result