結果
問題 | No.1221 木 *= 3 |
ユーザー |
![]() |
提出日時 | 2020-09-04 23:24:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 152 ms / 2,000 ms |
コード長 | 3,152 bytes |
コンパイル時間 | 2,934 ms |
コンパイル使用メモリ | 199,720 KB |
最終ジャッジ日時 | 2025-01-14 06:27:24 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define REP(i,n) for(ll i=0;i<(ll)n;i++)#define dump(x) cerr << "Line " << __LINE__ << ": \n" << #x << " = " << (x) << "\n";#define spa << " " <<#define fi first#define se second#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()using ld = long double;using ll = long long;using ull = unsigned long long;using pii = pair<int, int>;using pll = pair<long, long>;using pdd = pair<ld, ld>;template<typename T> using V = vector<T>;template<typename T> using P = pair<T, T>;template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }void fail() { cout << -1 << '\n'; exit(0); }inline int popcount(const int x) { return __builtin_popcount(x); }inline int popcount(const ll x) { return __builtin_popcountll(x); }template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];for(ll i=1;i<n;i++)cerr spa v[i];cerr<<"\n";};const ll INF = (1ll<<62);// const ld EPS = 1e-10;// const ld PI = acos(-1.0);const ll mod = (int)1e9 + 7;//const ll mod = 998244353;int main(){ll N;cin >> N;V<ll> a(N), b(N);REP(i, N) cin >> a[i];REP(i, N) cin >> b[i];V<V<ll>> G(N);REP(i, N-1){ll u, v;cin >> u >> v;u--, v--;G[u].push_back(v);G[v].push_back(u);}auto dfs = [&](auto self, ll now, ll par)->pll{V<ll> x, y, z;for(auto next: G[now]){if(next == par) continue;pll val = self(self, next, now);x.push_back(val.first);y.push_back(val.second);z.push_back(b[now]+b[next]);}ll toru = -a[now];ll sz = x.size();REP(i, sz){toru += max(x[i]+z[i], y[i]);}ll toranai = 0;REP(i, sz){toranai += max(x[i], y[i]);}return {toru, toranai};};ll res = 0;REP(i, N) res += a[i];pll val = dfs(dfs, 0, -1);res += max(val.first, val.second);cout << res << endl;return 0;}