結果

問題 No.1221 木 *= 3
ユーザー heno239heno239
提出日時 2020-09-04 21:37:29
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 96 ms / 2,000 ms
コード長 3,726 bytes
コンパイル時間 1,121 ms
コンパイル使用メモリ 121,432 KB
実行使用メモリ 35,512 KB
最終ジャッジ日時 2023-08-17 15:10:13
合計ジャッジ時間 3,946 ms
ジャッジサーバーID
(参考情報)
judge11 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
11,784 KB
testcase_01 AC 5 ms
11,828 KB
testcase_02 AC 4 ms
11,568 KB
testcase_03 AC 5 ms
11,616 KB
testcase_04 AC 4 ms
11,564 KB
testcase_05 AC 4 ms
11,580 KB
testcase_06 AC 5 ms
11,716 KB
testcase_07 AC 85 ms
35,512 KB
testcase_08 AC 84 ms
34,824 KB
testcase_09 AC 86 ms
35,452 KB
testcase_10 AC 95 ms
34,868 KB
testcase_11 AC 89 ms
34,908 KB
testcase_12 AC 70 ms
21,504 KB
testcase_13 AC 66 ms
21,364 KB
testcase_14 AC 69 ms
21,608 KB
testcase_15 AC 67 ms
21,368 KB
testcase_16 AC 67 ms
21,420 KB
testcase_17 AC 77 ms
18,504 KB
testcase_18 AC 87 ms
18,596 KB
testcase_19 AC 96 ms
18,384 KB
testcase_20 AC 80 ms
18,364 KB
testcase_21 AC 91 ms
18,428 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}


void solve() {
	int n; cin >> n;
	vector<ll> a(n);
	vector<ll> b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	vector<vector<int>> G(n);
	rep(i, n - 1) {
		int x, y; cin >> x >> y; x--; y--;
		G[x].push_back(y);
		G[y].push_back(x);
	}
	function<LP(int, int)> dfs = [&](int id, int fr)->LP {
		vector<LP> nex;
		vector<int> tos;
		for (int to : G[id])if (to != fr) {
			LP p = dfs(to, id);
			tos.push_back(to);
			nex.push_back(p);
		}
		LP res;
		//res.first..erased
		ll sum = a[id];
		for (LP p : nex) {
			sum += max(p.first, p.second);
		}
		res.first = sum;
		//res.second..remain
		sum = 0;
		rep(j, tos.size()) {
			ll val1, val2;
			//erased
			val1 = nex[j].first;
			val2 = nex[j].second + b[tos[j]] + b[id];
			sum += max(val1, val2);
		}
		res.second = sum;
		return res;

	};
	LP p = dfs(0, -1);
	ll ans = max(p.first, p.second);
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0