結果
| 問題 | No.277 根掘り葉掘り |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-09-05 00:46:53 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 470 ms / 3,000 ms |
| コード長 | 5,394 bytes |
| コンパイル時間 | 2,318 ms |
| コンパイル使用メモリ | 111,872 KB |
| 実行使用メモリ | 35,456 KB |
| 最終ジャッジ日時 | 2024-07-19 02:52:32 |
| 合計ジャッジ時間 | 8,540 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 23 ms
18,048 KB |
| testcase_01 | AC | 22 ms
18,176 KB |
| testcase_02 | AC | 22 ms
18,176 KB |
| testcase_03 | AC | 23 ms
18,176 KB |
| testcase_04 | AC | 23 ms
18,176 KB |
| testcase_05 | AC | 25 ms
18,304 KB |
| testcase_06 | AC | 24 ms
18,432 KB |
| testcase_07 | AC | 24 ms
18,304 KB |
| testcase_08 | AC | 23 ms
18,048 KB |
| testcase_09 | AC | 467 ms
32,508 KB |
| testcase_10 | AC | 443 ms
35,456 KB |
| testcase_11 | AC | 461 ms
33,404 KB |
| testcase_12 | AC | 455 ms
33,528 KB |
| testcase_13 | AC | 470 ms
33,788 KB |
| testcase_14 | AC | 460 ms
33,908 KB |
| testcase_15 | AC | 459 ms
33,532 KB |
| testcase_16 | AC | 457 ms
33,536 KB |
| testcase_17 | AC | 453 ms
33,788 KB |
| testcase_18 | AC | 452 ms
33,400 KB |
| testcase_19 | AC | 470 ms
33,656 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.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var G = Enumerate(n, x => new List<int>());
for (int i = 0; i < n - 1; i++)
{
var x = sc.Integer() - 1;
var y = sc.Integer() - 1;
G[x].Add(y);
G[y].Add(x);
}
var dist = Enumerate(n, x => long.MaxValue);
for (int i = 0; i < n; i++)
{
if (G[i].Count == 1)
dist[i] = 0;
}
dist[0] = 0;
var q = new Queue<KeyValuePair<int, int>>();
for (int i = 0; i < n; i++)
if (dist[i] == 0) q.Enqueue(new KeyValuePair<int, int>(-1, i));
while (q.Any())
{
var p = q.Dequeue();
foreach (var x in G[p.Value])
{
if(dist[x]>dist[p.Value]+1)
{
dist[x] = dist[p.Value] + 1;
q.Enqueue(new KeyValuePair<int, int>(p.Value, x));
}
}
}
foreach(var x in dist)
Console.WriteLine(x);
}
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 != '-' && (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';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
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