#503541 (D) No.1098 LCAs

• 問題: No.1098 LCAs
• ユーザー: daut-dlang
• 提出日時: 2020-06-26 22:45:44
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 2,372 bytes
• コンパイル時間: 711 ms
• コンパイル使用メモリ: 117,316 KB
• 実行使用メモリ: 51,736 KB
• 最終ジャッジ日時: 2024-06-22 07:33:10
• 合計ジャッジ時間: 5,865 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	1 ms; 6,940 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	241 ms; 21,952 KB
testcase_26	AC	242 ms; 26,480 KB
testcase_27	AC	246 ms; 26,636 KB
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-

ソースコード

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 edges = new long[][](N);
	edges[0] ~= -1;
	foreach (i; 0..N-1)
	{
		auto u = RD-1;
		auto v = RD-1;
		edges[u] ~= v;
		edges[v] ~= u;
	}

	auto cnt = new long[][](N);
	long dfs(long pos, long last)
	{
		foreach (v; edges[pos])
		{
			if (v == last) continue;
			cnt[pos] ~= dfs(v, pos);
		}
		return cnt[pos].sum + 1;
	}
	dfs(0, -1);

	foreach (i; 0..N)
	{
		long tot = cnt[i].sum;
		long ans = 1 + tot * 2;
		foreach (e; cnt[i])
		{
			ans += tot - e;
		}
		writeln(ans);
	}
	stdout.flush;
	debug readln;
}