#include <iostream>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node {
int p, s; // prep, speed
};
int32_t main() {
//freopen("harbingers.in", "r", stdin);
//freopen("harbingers.out", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<vector<pair<int, int>>> g(n);
vector<node> nodes(n + 1);
vector<pair<int, int>> pr(n); // parent
for (int i = 0; i < n - 1; i++) {
int a, b, c; cin >> a >> b >> c, a--, b--;
if (a > b) swap(a, b);
g[a].emplace_back(b, c);
g[b].emplace_back(a, c);
pr[b] = {a, c};
}
for (int i = 1; i <= n - 1; i++) {
int p, s; cin >> p >> s;
nodes[i] = node{p, s};
}
function<int(int, int)> f = [&](int node, int har) {
if (node == 0) return 0ll;
int st = nodes[node].p + pr[node].second * nodes[node].s;
int nd = nodes[har].s * pr[node].second;
if (node == har) {
return st + f(pr[node].first, node);
}
if (st < nd) {
return st + f(pr[node].first, node);
} else {
return nd + f(pr[node].first, har);
}
};
for (int i = 1; i <= n - 1; i++) {
cout << f(i, i) << " ";
}
cout << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
| 2 |
Incorrect |
3 ms |
588 KB |
Output isn't correct |
| 3 |
Incorrect |
38 ms |
6368 KB |
Output isn't correct |
| 4 |
Incorrect |
54 ms |
8776 KB |
Output isn't correct |
| 5 |
Incorrect |
73 ms |
11724 KB |
Output isn't correct |
| 6 |
Incorrect |
102 ms |
14144 KB |
Output isn't correct |
| 7 |
Incorrect |
60 ms |
9756 KB |
Output isn't correct |
| 8 |
Incorrect |
95 ms |
14060 KB |
Output isn't correct |
| 9 |
Incorrect |
88 ms |
13960 KB |
Output isn't correct |
| 10 |
Incorrect |
81 ms |
13244 KB |
Output isn't correct |
