#386827 (D) No.900 aδδitivee

• 問題: No.900 aδδitivee
• ユーザー: daut-dlang
• 提出日時: 2019-10-04 22:46:01
• 言語: D (dmd 2.106.1)
• 結果: TLE
• 実行時間: -
• コード長: 2,041 bytes
• コンパイル時間: 829 ms
• コンパイル使用メモリ: 109,808 KB
• 実行使用メモリ: 19,188 KB
• 最終ジャッジ日時: 2024-06-22 02:41:28
• 合計ジャッジ時間: 8,871 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 13,888 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,940 KB
testcase_05	AC	1 ms; 6,944 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	162 ms; 14,168 KB
testcase_08	AC	160 ms; 13,236 KB
testcase_09	AC	160 ms; 13,232 KB
testcase_10	AC	158 ms; 6,944 KB
testcase_11	AC	163 ms; 13,476 KB
testcase_12	AC	161 ms; 13,732 KB
testcase_13	AC	153 ms; 6,940 KB
testcase_14	AC	164 ms; 13,372 KB
testcase_15	AC	162 ms; 13,232 KB
testcase_16	AC	161 ms; 13,308 KB
testcase_17	AC	158 ms; 6,944 KB
testcase_18	AC	154 ms; 6,948 KB
testcase_19	AC	160 ms; 6,944 KB
testcase_20	AC	155 ms; 6,940 KB
testcase_21	AC	153 ms; 6,940 KB
testcase_22	TLE	-
testcase_23	--	-
testcase_24	--	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`

ソースコード

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

string FMT_F = "%.10f";

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; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
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; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto edges = new long[2][](N);
	foreach (i; 0..N-1)
	{
		auto u = RD;
		auto v = RD;
		auto w = RD;
		edges[v] = [u, w];
	}
	auto w = new long[](N);

	auto Q = RD;
	long[] ans;
	foreach (i; 0..Q)
	{
		auto num = RD;
		if (num == 1)
		{
			auto a = RD;
			auto x = RD;
			w[a] += x;
		}
		else
		{
			auto b = RD;
			ans ~= 0;
			void dfs(long pos, long cnt)
			{
				auto par  = edges[pos][0];
				auto c    = edges[pos][1];
				ans[$-1] += c;
				ans[$-1] += w[pos] * cnt;
				if (pos == 0) return;
				dfs(par, cnt+1);
			}
			dfs(b, 0);
		}
	}

	foreach (e; ans)
		writeln(e);
	stdout.flush();
	debug readln();
}