#547875 (D) No.1221 木 *= 3

• 問題: No.1221 木 *= 3
• ユーザー: daut-dlang
• 提出日時: 2020-09-04 22:32:35
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 183 ms / 2,000 ms
• コード長: 2,398 bytes
• コンパイル時間: 1,067 ms
• コンパイル使用メモリ: 109,468 KB
• 実行使用メモリ: 31,976 KB
• 最終ジャッジ日時: 2023-09-04 09:48:21
• 合計ジャッジ時間: 4,684 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,380 KB
testcase_01	AC	2 ms; 4,380 KB
testcase_02	AC	1 ms; 4,376 KB
testcase_03	AC	1 ms; 4,376 KB
testcase_04	AC	1 ms; 4,376 KB
testcase_05	AC	1 ms; 4,376 KB
testcase_06	AC	1 ms; 4,380 KB
testcase_07	AC	168 ms; 31,976 KB
testcase_08	AC	163 ms; 30,520 KB
testcase_09	AC	166 ms; 31,560 KB
testcase_10	AC	166 ms; 31,188 KB
testcase_11	AC	168 ms; 31,204 KB
testcase_12	AC	164 ms; 21,980 KB
testcase_13	AC	160 ms; 21,132 KB
testcase_14	AC	163 ms; 21,200 KB
testcase_15	AC	163 ms; 21,496 KB
testcase_16	AC	164 ms; 21,184 KB
testcase_17	AC	181 ms; 20,960 KB
testcase_18	AC	175 ms; 21,456 KB
testcase_19	AC	183 ms; 21,424 KB
testcase_20	AC	181 ms; 21,220 KB
testcase_21	AC	181 ms; 21,292 KB

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto a = RDA;
	auto b = RDA;
	auto edges = new int[][](N);
	foreach (i; 0..N-1)
	{
		auto u = RD!int-1;
		auto v = RD!int-1;
		edges[u] ~= v;
		edges[v] ~= u;
	}

	long[] dfs(int pos, int last)
	{
		long ss1 = a[pos];
		long ss21, ss22;
		if (last != -1)
			ss22 += b[last] + b[pos];

		foreach (v; edges[pos])
		{
			if (v == last) continue;
			auto r = dfs(v, pos);
			ss1 += r[0];
			ss21 += r[1];
			ss22 += r[1];
		}
		return [max(ss1, ss21), max(ss1, ss22)];
	}
	auto r = dfs(0, -1);

	writeln(r[0]);
	stdout.flush;
	debug readln;
}