Submission #4024717

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctype.h>
using namespace std;
#define dump(a) cout << (a) << '\n';
typedef long long Int;
Int mod = 1e9+7;
Int MOD = 998244353;

vector<Int> p[1001];
Int b[1001];
Int cost[1001];
Int res;

Int dfs(Int x) {
    if (b[x] > 0 && b[x] != 1e9) return b[x];
    for (Int i = 0; i < (Int)p[x].size(); i++) {
        b[x] = min(b[x], dfs(p[x][i]));
    }
    for (Int i = 0; i < (Int)p[x].size(); i++) {
        b[p[x][i]] -= b[x];
    }
}

int main() {
    ios::sync_with_stdio(false);
    Int n, m;
    cin >> n >> m;
    for (Int i = 1; i <= n - 1; i++) {
        Int a;
        cin >> a;
        p[a].push_back(i);
    }
    for (Int i = 0; i < n; i++) b[i] = 1e9;
    b[0] = 0;
    for (Int i = 0; i < m; i++) {
        Int s, t;
        cin >> s >> t;
        b[s] = t;
    }
    Int tmp = dfs(0);
    Int res = 0;
    dump(res);
    return 0;  
}    

Submission Info

Judge Result