結果
問題 | No.763 Noelちゃんと木遊び |
ユーザー |
![]() |
提出日時 | 2019-02-02 05:35:53 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 242 ms / 2,000 ms |
コード長 | 2,842 bytes |
コンパイル時間 | 1,638 ms |
コンパイル使用メモリ | 114,732 KB |
実行使用メモリ | 51,692 KB |
最終ジャッジ日時 | 2024-11-25 00:22:26 |
合計ジャッジ時間 | 6,836 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
コンパイルメッセージ
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.Collections.Generic;namespace No763{public class Program{class Node{public List<int> Children = new List<int>();public int MaxDel = 0;public int MaxLev = 1;}void Solve(StreamScanner ss, StreamWriter sw){//---------------------------------var N = ss.Next(int.Parse);var nodes = new Node[N + 1];for (var i = 1; i <= N; i++){nodes[i] = new Node();}for (var i = 0; i < N - 1; i++){var u = ss.Next(int.Parse);var v = ss.Next(int.Parse);nodes[u].Children.Add(v);nodes[v].Children.Add(u);}void DFS(int i){var p = nodes[i];foreach (var ci in p.Children){var c = nodes[ci];c.Children.Remove(i);DFS(ci);p.MaxDel += Math.Max(c.MaxDel, c.MaxLev);p.MaxLev += Math.Max(c.MaxDel, c.MaxLev - 1);}}DFS(1);var root = nodes[1];sw.WriteLine(Math.Max(root.MaxDel, root.MaxLev));//---------------------------------}static void Main(){var ss = new StreamScanner(new StreamReader(Console.OpenStandardInput()));var sw = new StreamWriter(Console.OpenStandardOutput()) {AutoFlush = false};new Program().Solve(ss, sw);sw.Flush();}static readonly Func<string, string> String = s => s;}public class StreamScanner{static readonly char[] Sep = {' '};readonly Queue<string> buffer = new Queue<string>();readonly TextReader textReader;public StreamScanner(TextReader textReader){this.textReader = textReader;}public T Next<T>(Func<string, T> parser){if (buffer.Count != 0) return parser(buffer.Dequeue());var nextStrings = textReader.ReadLine().Split(Sep, StringSplitOptions.RemoveEmptyEntries);foreach (var nextString in nextStrings) buffer.Enqueue(nextString);return Next(parser);}public T[] Next<T>(Func<string, T> parser, int x){var ret = new T[x];for (var i = 0; i < x; ++i) ret[i] = Next(parser);return ret;}public T[][] Next<T>(Func<string, T> parser, int x, int y){var ret = new T[y][];for (var i = 0; i < y; ++i) ret[i] = Next(parser, x);return ret;}}}