T546526 吃鸡之旅 题解

bilibili_daogu · 2025-01-24 18:31:35 · 题解

c++:

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 100005;

int n, m, k;
int a[MAXN], h[MAXN];
vector<int> adj[MAXN];
bool visited[MAXN];

int dfs(int u) {
    visited[u] = true;
    int ans = 0;
    if (k > a[u] * h[u]) {
        ans += a[u];
        for (int v : adj[u]) {
            if (!visited[v]) {
                ans += dfs(v);
            }
        }
    }
    return ans;
}

int main() {
    cin >> n >> m >> k;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> h[i];
    }
    cout << dfs(1) << endl;
    return 0;
}