이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 500;
int n;
ll a[N];
vector <pair <int, ll> > g[N];
ll dfs(int v, int pr, ll d) {
if (d < 0)
return 0;
ll res = (pr != -1);
for (auto to : g[v]) {
if (to.first == pr)
continue;
res += dfs(to.first, v, d + a[v] - to.second);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie();
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n - 1; ++i) {
int x, y, z;
cin >> x >> y >> z;
--x, --y;
g[x].push_back(make_pair(y, z));
g[y].push_back(make_pair(x, z));
}
ll ans = 0;
for (int i = 0; i < n; ++i)
ans += dfs(i, -1, 0);
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |