結果
問題 | No.417 チューリップバブル |
ユーザー | 紙ぺーぱー |
提出日時 | 2016-08-26 22:54:03 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 145 ms / 2,000 ms |
コード長 | 5,938 bytes |
コンパイル時間 | 3,818 ms |
コンパイル使用メモリ | 111,616 KB |
実行使用メモリ | 21,120 KB |
最終ジャッジ日時 | 2024-11-08 09:41:22 |
合計ジャッジ時間 | 4,922 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 27 ms
18,432 KB |
testcase_01 | AC | 27 ms
18,560 KB |
testcase_02 | AC | 27 ms
18,560 KB |
testcase_03 | AC | 27 ms
18,560 KB |
testcase_04 | AC | 26 ms
18,560 KB |
testcase_05 | AC | 27 ms
18,560 KB |
testcase_06 | AC | 27 ms
18,560 KB |
testcase_07 | AC | 26 ms
18,432 KB |
testcase_08 | AC | 27 ms
18,688 KB |
testcase_09 | AC | 28 ms
18,676 KB |
testcase_10 | AC | 32 ms
18,428 KB |
testcase_11 | AC | 57 ms
18,424 KB |
testcase_12 | AC | 43 ms
18,808 KB |
testcase_13 | AC | 35 ms
18,688 KB |
testcase_14 | AC | 49 ms
18,688 KB |
testcase_15 | AC | 29 ms
18,688 KB |
testcase_16 | AC | 29 ms
18,944 KB |
testcase_17 | AC | 43 ms
18,568 KB |
testcase_18 | AC | 50 ms
18,444 KB |
testcase_19 | AC | 42 ms
18,564 KB |
testcase_20 | AC | 87 ms
19,328 KB |
testcase_21 | AC | 81 ms
19,456 KB |
testcase_22 | AC | 79 ms
19,456 KB |
testcase_23 | AC | 90 ms
19,200 KB |
testcase_24 | AC | 26 ms
18,688 KB |
testcase_25 | AC | 68 ms
19,328 KB |
testcase_26 | AC | 32 ms
19,072 KB |
testcase_27 | AC | 83 ms
18,816 KB |
testcase_28 | AC | 88 ms
19,200 KB |
testcase_29 | AC | 86 ms
19,200 KB |
testcase_30 | AC | 126 ms
19,328 KB |
testcase_31 | AC | 105 ms
19,328 KB |
testcase_32 | AC | 27 ms
18,432 KB |
testcase_33 | AC | 27 ms
18,432 KB |
testcase_34 | AC | 29 ms
18,564 KB |
testcase_35 | AC | 145 ms
21,120 KB |
testcase_36 | AC | 126 ms
21,120 KB |
testcase_37 | AC | 100 ms
20,992 KB |
testcase_38 | AC | 84 ms
20,992 KB |
testcase_39 | AC | 61 ms
20,736 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.Linq; using System.Linq.Expressions; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using Number = System.Int64; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var m = sc.Integer(); var v = sc.Integer(n); var G = Enumerate(n, x => new List<KeyValuePair<int, int>>()); for (int i = 0; i < n - 1; i++) { var f = sc.Integer(); var t = sc.Integer(); var c = sc.Integer(); G[f].Add(new KeyValuePair<int, int>(t, c)); G[t].Add(new KeyValuePair<int, int>(f, c)); } var dp = Enumerate(n, x => new long[m + 1]); for (int i = 0; i < n; i++) for (int j = 0; j <= m; j++) dp[i][j] = -1145141919;//this is magic number! don't change!!! Action<int, int> dfs = null; dfs = (prev, cur) => { dp[cur][0] = v[cur]; foreach (var e in G[cur]) { if (e.Key == prev) continue; dfs(cur, e.Key); for (int i = m; i >= 0; i--) { if (dp[cur][i] < 0) continue; for (int j = 0; j <= m; j++) { if (dp[e.Key][j] < 0) continue; if (i + j + 2 * e.Value <= m) dp[cur][i + j + 2 * e.Value] = Math.Max(dp[cur][i + j + 2 * e.Value], dp[cur][i] + dp[e.Key][j]); } } } }; dfs(-1, 0); IO.Printer.Out.WriteLine(dp[0].Max()); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer: StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b)); if (b == 0) return long.MinValue; if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion