結果
問題 | No.417 チューリップバブル |
ユーザー | eitaho |
提出日時 | 2016-09-13 12:39:53 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 850 ms / 2,000 ms |
コード長 | 3,344 bytes |
コンパイル時間 | 4,029 ms |
コンパイル使用メモリ | 115,080 KB |
実行使用メモリ | 20,992 KB |
最終ジャッジ日時 | 2024-04-28 13:01:36 |
合計ジャッジ時間 | 12,376 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
19,072 KB |
testcase_01 | AC | 34 ms
19,072 KB |
testcase_02 | AC | 34 ms
19,328 KB |
testcase_03 | AC | 33 ms
19,200 KB |
testcase_04 | AC | 33 ms
19,200 KB |
testcase_05 | AC | 32 ms
19,072 KB |
testcase_06 | AC | 33 ms
19,200 KB |
testcase_07 | AC | 32 ms
19,072 KB |
testcase_08 | AC | 37 ms
19,200 KB |
testcase_09 | AC | 45 ms
19,200 KB |
testcase_10 | AC | 49 ms
19,328 KB |
testcase_11 | AC | 134 ms
19,328 KB |
testcase_12 | AC | 123 ms
19,584 KB |
testcase_13 | AC | 46 ms
19,584 KB |
testcase_14 | AC | 187 ms
19,456 KB |
testcase_15 | AC | 44 ms
19,200 KB |
testcase_16 | AC | 42 ms
19,328 KB |
testcase_17 | AC | 120 ms
19,328 KB |
testcase_18 | AC | 126 ms
19,456 KB |
testcase_19 | AC | 126 ms
19,584 KB |
testcase_20 | AC | 411 ms
19,968 KB |
testcase_21 | AC | 387 ms
19,968 KB |
testcase_22 | AC | 348 ms
19,968 KB |
testcase_23 | AC | 413 ms
19,968 KB |
testcase_24 | AC | 34 ms
19,328 KB |
testcase_25 | AC | 311 ms
20,096 KB |
testcase_26 | AC | 63 ms
19,328 KB |
testcase_27 | AC | 303 ms
19,584 KB |
testcase_28 | AC | 379 ms
20,096 KB |
testcase_29 | AC | 400 ms
19,840 KB |
testcase_30 | AC | 387 ms
19,968 KB |
testcase_31 | AC | 323 ms
19,968 KB |
testcase_32 | AC | 34 ms
19,328 KB |
testcase_33 | AC | 43 ms
19,072 KB |
testcase_34 | AC | 61 ms
19,328 KB |
testcase_35 | AC | 790 ms
20,736 KB |
testcase_36 | AC | 807 ms
20,736 KB |
testcase_37 | AC | 744 ms
20,736 KB |
testcase_38 | AC | 795 ms
20,736 KB |
testcase_39 | AC | 850 ms
20,992 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Text; using System.Text.RegularExpressions; using System.Collections.Generic; using System.Diagnostics; using Enu = System.Linq.Enumerable; public class Program { int N, T; int[] A; List<Edge>[] E; public void Solve() { N = Reader.Int(); T = Reader.Int() / 2; A = Reader.IntArray(N); E = Enu.Range(0, N).Select(i => new List<Edge>()).ToArray(); for (int i = 0; i < N - 1; i++) { int a = Reader.Int(), b = Reader.Int(), c = Reader.Int(); E[a].Add(new Edge(b, c)); E[b].Add(new Edge(a, c)); } Console.WriteLine(Rec(0, -1, T).Max()); } private long[] Rec(int a, int parent, int maxT) { if (maxT < 0) return new long[0]; var dp = new long[maxT + 1]; dp[0] = A[a]; foreach (var e in E[a]) if (e.to != parent) { var child = Rec(e.to, a, maxT - e.cost); for (int t = maxT; t >= 0; t--) for (int use = 0; use < child.Length; use++) if (t + e.cost + use <= maxT) CheckMax(ref dp[t + e.cost + use], dp[t] + child[use]); } return dp; } bool CheckMax(ref long a, long b) { if (b > a) { a = b; return true; } return false; } struct Edge { public int to; public int cost; public Edge(int to, int c) { this.to = to; this.cost = c; } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { static TextReader reader = Console.In; static readonly char[] separator = { ' ' }; static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; static string[] A = new string[0]; static int i; static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Range(N, Int); } public static int[][] IntTable(int H) { return Range(H, IntLine); } public static string[] StringArray(int N) { return Range(N, Next); } public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); } public static string Line() { return reader.ReadLine().Trim(); } static string[] Split(string s) { return s.Split(separator, op); } static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; } static string Next() { CheckNext(); return A[i++]; } static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }