結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2015-09-04 23:37:31 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 585 ms / 3,000 ms |
コード長 | 3,203 bytes |
コンパイル時間 | 3,485 ms |
コンパイル使用メモリ | 109,056 KB |
実行使用メモリ | 45,304 KB |
最終ジャッジ日時 | 2024-07-19 02:24:27 |
合計ジャッジ時間 | 10,955 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
コンパイルメッセージ
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.Collections.Generic;using System.Diagnostics;using System.Numerics;using Enu = System.Linq.Enumerable;class Program{List<int>[] G;List<int> Leaf = new List<int>();public void Solve(){int N = Reader.Int();G = Enu.Range(0, N).Select(i => new List<int>()).ToArray();for (int i = 0; i < N - 1; i++){int a = Reader.Int() - 1, b = Reader.Int() - 1;G[a].Add(b);G[b].Add(a);}DFS(0, -1);int[] minDist = Enu.Repeat(N, N).ToArray();var que = new Queue<int>();que.Enqueue(0);minDist[0] = 0;foreach (var v in Leaf){que.Enqueue(v);minDist[v] = 0;}while (que.Count > 0){int at = que.Dequeue();foreach (int next in G[at])if (minDist[next] == N){minDist[next] = minDist[at] + 1;que.Enqueue(next);}}for (int i = 0; i < N; i++)Console.WriteLine(minDist[i]);}private void DFS(int at, int prev){bool any = false;foreach (int child in G[at])if (child != prev){any = true;DFS(child, at);}if (!any) Leaf.Add(at);}}class Entry { static void Main() { new Program().Solve(); } }class Reader{private static TextReader reader = Console.In;private static readonly char[] separator = { ' ' };private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;private static string[] A = new string[0];private static int i;private 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 Enu.Range(0, N).Select(i => Int()).ToArray(); }public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Next()).ToArray(); }public static string Line() { return reader.ReadLine().Trim(); }private static string[] Split(string s) { return s.Split(separator, op); }private static string Next() { CheckNext(); return A[i++]; }private 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;}}