Submission #51405938

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int n, m; cin >> n >> m;

    vector<pii> edges;
    for (int i = 0; i < m; ++i) {
        int u, v; cin >> u >> v;
        --u; --v;

        edges.pb({u, v});
    }

    vi w(n), a(n);
    for (int i = 0; i < n; ++i) {
        cin >> w[i];
    }
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<vi> g(n), r(n);
    for (auto [u, v] : edges) {
        if (w[u] > w[v]) {
            g[u].pb(v);
            r[v].pb(u);
        }
        if (w[v] > w[u]) {
            g[v].pb(u);
            r[u].pb(v);
        }
    }

    vector<int> deg(n);
    queue<int> q;
    for (int i = 0; i < n; ++i) {
        deg[i] = sz(g[i]);
        if (deg[i] == 0) q.push(i);
    }

    vi ops(n);
    while (!q.empty()) {
        int v = q.front(); q.pop();

        ll best = 0;
        vi dp(w[v], -1);
        dp[0] = 0;
        for (int u : g[v]) {
            for (int i = w[v] - w[u] - 1; i >= 0; --i) {
                if (dp[i] >= 0) {
                    dp[i + w[u]] = max(dp[i + w[u]], dp[i] + ops[u]);
                    best = max(best, dp[i + w[u]]);
                }
            }
        }
        
        ops[v] = ++best;

        for (int u : r[v]) {
            if (--deg[u] == 0) {
                q.push(u);
            }
        }
    }

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += a[i] * ops[i];
    }

    cout << ans;
}

Submission Info

Judge Result