結果
問題 | No.1221 木 *= 3 |
ユーザー | yupiteru_kun |
提出日時 | 2020-09-04 22:10:04 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 195 ms / 2,000 ms |
コード長 | 10,174 bytes |
コンパイル時間 | 3,234 ms |
コンパイル使用メモリ | 117,072 KB |
実行使用メモリ | 55,960 KB |
最終ジャッジ日時 | 2023-08-17 15:45:16 |
合計ジャッジ時間 | 7,840 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
21,816 KB |
testcase_01 | AC | 60 ms
21,712 KB |
testcase_02 | AC | 60 ms
23,772 KB |
testcase_03 | AC | 60 ms
21,808 KB |
testcase_04 | AC | 60 ms
21,600 KB |
testcase_05 | AC | 61 ms
23,612 KB |
testcase_06 | AC | 62 ms
21,736 KB |
testcase_07 | AC | 180 ms
50,356 KB |
testcase_08 | AC | 176 ms
50,280 KB |
testcase_09 | AC | 179 ms
50,188 KB |
testcase_10 | AC | 179 ms
48,124 KB |
testcase_11 | AC | 178 ms
48,180 KB |
testcase_12 | AC | 184 ms
51,884 KB |
testcase_13 | AC | 178 ms
54,516 KB |
testcase_14 | AC | 176 ms
49,856 KB |
testcase_15 | AC | 176 ms
55,960 KB |
testcase_16 | AC | 195 ms
53,932 KB |
testcase_17 | AC | 187 ms
52,672 KB |
testcase_18 | AC | 184 ms
50,540 KB |
testcase_19 | AC | 187 ms
52,712 KB |
testcase_20 | AC | 187 ms
50,592 KB |
testcase_21 | AC | 189 ms
50,380 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.Collections.Generic; using System.IO; using System.Linq; using static System.Math; using System.Text; using System.Threading; using System.Globalization; using System.Runtime.CompilerServices; using Library; namespace Program { public static class ProblemE { static bool SAIKI = false; static public int numberOfRandomCases = 0; static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker) { } static public void Solve() { var N = NN; var aList = NNList(N); var bList = NNList(N); var uvList = Repeat(0, N - 1).Select(_ => new { u = NN - 1, v = NN - 1 }).ToArray(); var tree = new LIB_Tree(N); foreach (var item in uvList) tree.AddPath(item.u, item.v); var dp = new long[N, 2]; foreach (var item in tree.BFSFromLeaf(0)) { dp[item.node, 0] = aList[item.node]; foreach (var child in tree.GetSurround(item.node)) { if (child == item.parent) continue; dp[item.node, 0] += Max(dp[child, 0], dp[child, 1]); dp[item.node, 1] += Max(dp[child, 0], dp[child, 1] + bList[item.node] + bList[child]); } } Console.WriteLine(Max(dp[0, 0], dp[0, 1])); } class Printer : StreamWriter { public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; } public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; } } static LIB_FastIO fastio = new LIB_FastIODebug(); static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); } static long NN => fastio.Long(); static double ND => fastio.Double(); static string NS => fastio.Scan(); static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray(); static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray(); static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray(); static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred); static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n); static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c); static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift); static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e); static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector); static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e); static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector); static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase); static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x); static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } } static IEnumerator<uint> _xsi = _xsc(); static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } } } } namespace Library { partial class LIB_Tree { int N; List<int>[] path; [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_Tree(long n) { N = (int)n; path = Enumerable.Repeat(0, N).Select(_ => new List<int>()).ToArray(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void AddPath(long u, long v) { if (u >= N || v >= N) throw new Exception(); path[u].Add((int)v); path[v].Add((int)u); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int[] GetSurround(long u) => path[u].ToArray(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public List<(long node, long parent)> BFSFromRoot(long root) { var bfsList = new List<(long node, long parent)>(); var q = new Queue<int>(); var done = new bool[N]; bfsList.Add((root, -1)); done[root] = true; q.Enqueue((int)root); while (q.Count > 0) { var w = q.Dequeue(); foreach (var i in path[w]) { if (done[i]) continue; done[i] = true; q.Enqueue(i); bfsList.Add((i, w)); } } return bfsList; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public List<(long node, long parent)> BFSFromLeaf(long root) => BFSFromRoot(root).ToArray().Reverse().ToList(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public List<(long node, long parent, long direction)> EulerTour(long root) { var eulerList = new List<(long node, long parent, long direction)>(); var s = new Stack<Tuple<int, int>>(); var done = new bool[N]; done[root] = true; s.Push(Tuple.Create((int)root, -1)); while (s.Count > 0) { var w = s.Peek(); var ad = true; foreach (var i in path[w.Item1]) { if (done[i]) continue; done[i] = true; ad = false; s.Push(Tuple.Create(i, w.Item1)); } if (!ad || path[w.Item1].Count == 1) eulerList.Add((w.Item1, w.Item2, 1)); if (ad) { s.Pop(); eulerList.Add((w.Item1, w.Item2, -1)); } } return eulerList; } } class LIB_FastIO { [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_FastIO() { str = Console.OpenStandardInput(); } readonly Stream str; readonly byte[] buf = new byte[1024]; int len, ptr; public bool isEof = false; public bool IsEndOfStream { [MethodImpl(MethodImplOptions.AggressiveInlining)] get { return isEof; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] byte read() { if (isEof) throw new EndOfStreamException(); if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public long Long() { long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); 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'; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } } class LIB_FastIODebug : LIB_FastIO { Queue<string> param = new Queue<string>(); [MethodImpl(MethodImplOptions.AggressiveInlining)] string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_FastIODebug() { } [MethodImpl(MethodImplOptions.AggressiveInlining)] public override string Scan() => NextString(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override long Long() => long.Parse(NextString()); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override double Double() => double.Parse(NextString()); } }