結果
問題 | No.806 木を道に |
ユーザー |
![]() |
提出日時 | 2019-12-13 20:14:20 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 194 ms / 2,000 ms |
コード長 | 5,181 bytes |
コンパイル時間 | 1,388 ms |
コンパイル使用メモリ | 113,792 KB |
実行使用メモリ | 33,272 KB |
最終ジャッジ日時 | 2024-06-27 14:33:11 |
合計ジャッジ時間 | 5,333 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 27 |
コンパイルメッセージ
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.Linq;using System.IO;using System.Runtime.CompilerServices;using System.Text;using static Template;using static System.Console;using static System.Convert;using static System.Math;using Pi = Pair<int, int>;using tpDijkstra = System.Int64;class Solver{Scanner sc = new Scanner();//List<int>[] edge;public void Solve(){var N = sc.Int;edge = Create(N, () => new List<int>());for (var i = 0; i < N-1; i++){int a, b;sc.Make(out a, out b);a--; b--;edge[a].Add(b);edge[b].Add(a);}WriteLine(edge.Sum(v=>Max(0,v.Count-2)));}}#region Templatepublic class Template{static void Main(string[] args){Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });new Solver().Solve();Console.Out.Flush();}[MethodImpl(MethodImplOptions.AggressiveInlining)]public static bool chmin<T>(ref T num, T val) where T : IComparable<T>{ if (num.CompareTo(val) == 1) { num = val; return true; } return false; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static bool chmax<T>(ref T num, T val) where T : IComparable<T>{ if (num.CompareTo(val) == -1) { num = val; return true; } return false; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static void swap<T>(ref T v1, ref T v2){ var t = v2; v2 = v1; v1 = t; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public static T[] Create<T>(int n, Func<T> f){var rt = new T[n];for (var i = 0; i < rt.Length; ++i)rt[i] = f();return rt;}[MethodImpl(MethodImplOptions.AggressiveInlining)]public static T[] Create<T>(int n, Func<int, T> f){var rt = new T[n];for (var i = 0; i < rt.Length; ++i)rt[i] = f(i);return rt;}public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }}public class Scanner{public string Str => ReadLine().Trim();public int Int => int.Parse(Str);public long Long => long.Parse(Str);public double Double => double.Parse(Str);public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());public int[] ArrInt1D(int n) => Create(n, () => Int);public long[] ArrLong1D(int n) => Create(n, () => Long);public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>());public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>());private Queue<string> q = new Queue<string>();[MethodImpl(MethodImplOptions.AggressiveInlining)]public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }public void Make<T1>(out T1 v1) => v1 = Next<T1>();public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4,out v5); v6 = Next<T6>(); }}public class Pair<T1, T2> : IComparable<Pair<T1, T2>>{public T1 v1;public T2 v2;public Pair() { }public Pair(T1 v1, T2 v2){ this.v1 = v1; this.v2 = v2; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public int CompareTo(Pair<T1, T2> p){var c = Comparer<T1>.Default.Compare(v1, p.v1);if (c == 0)c = Comparer<T2>.Default.Compare(v2, p.v2);return c;}public override string ToString()=> $"{v1.ToString()} {v2.ToString()}";public void Tie(out T1 a, out T2 b) { a = v1; b = v2; }}public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>{public T3 v3;public Pair() : base() { }public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2){ this.v3 = v3; }[MethodImpl(MethodImplOptions.AggressiveInlining)]public int CompareTo(Pair<T1, T2, T3> p){var c = base.CompareTo(p);if (c == 0)c = Comparer<T3>.Default.Compare(v3, p.v3);return c;}public override string ToString()=> $"{base.ToString()} {v3.ToString()}";public void Tie(out T1 a, out T2 b, out T3 c) { Tie(out a, out b); c = v3; }}#endregion