結果
問題 | No.1221 木 *= 3 |
ユーザー |
![]() |
提出日時 | 2020-09-04 22:03:31 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 187 ms / 2,000 ms |
コード長 | 3,361 bytes |
コンパイル時間 | 1,884 ms |
コンパイル使用メモリ | 177,048 KB |
実行使用メモリ | 14,976 KB |
最終ジャッジ日時 | 2024-11-26 12:52:56 |
合計ジャッジ時間 | 5,698 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long#define rep(i, n) for (int i = 0; i < (int) (n); i++)#define reps(i, n) for (int i = 1; i <= (int) (n); i++)#define all(x) (x).begin(), (x).end()#define uniq(x) (x).erase(unique(all(x)), (x).end())#define bit(n) (1LL << (n))#define dump(x) cerr << #x " = " << (x) << endlusing vint = vector<int>;using vvint = vector<vint>;using pint = pair<int, int>;using vpint = vector<pint>;template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;constexpr double PI = 3.1415926535897932384626433832795028;constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};int sign(int x) { return (x > 0) - (x < 0); }int gcd(int a, int b) {while (b) { swap(a %= b, b); }return a;}int lcm(int a, int b) { return a / gcd(a, b) * b; }int cdiv(int a, int b) { return (a - 1 + b) / b; }template<typename T> void fin(T mes) {cout << mes << endl;exit(0);}template<typename T, typename U> bool chmax(T &a, const U &b) {if (a < b) {a = b;return true;}return false;}template<typename T, typename U> bool chmin(T &a, const U &b) {if (b < a) {a = b;return true;}return false;}template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {os << "(" << rhs.first << ", " << rhs.second << ")";return os;}template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}struct setup {static constexpr int PREC = 20;setup() {cout << fixed << setprecision(PREC);cerr << fixed << setprecision(PREC);};} setup;signed main() {int N;cin >> N;vint a(N), b(N);vvint adj(N);rep(i, N) { cin >> a[i]; }rep(i, N) { cin >> b[i]; }rep(i, N - 1) {int u, v;cin >> u >> v, u--, v--;adj[u].emplace_back(v), adj[v].emplace_back(u);}auto dfs = [&](auto &&dfs, int cur, int par) -> pint {int x = a[cur], y = 0;for (int to:adj[cur]) {if (to == par) { continue; }auto nxt = dfs(dfs, to, cur);x += max(nxt.first, nxt.second);y += max(nxt.first, nxt.second + b[cur] + b[to]);}return {x, y};};auto ans = dfs(dfs, 0, -1);cout << max(ans.first, ans.second) << endl;}