結果
問題 | No.768 Tapris and Noel play the game on Treeone |
ユーザー | りあん |
提出日時 | 2018-12-16 15:00:33 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 6,605 bytes |
コンパイル時間 | 1,136 ms |
コンパイル使用メモリ | 112,896 KB |
実行使用メモリ | 61,676 KB |
最終ジャッジ日時 | 2024-09-25 06:31:03 |
合計ジャッジ時間 | 10,177 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
23,808 KB |
testcase_01 | AC | 29 ms
18,048 KB |
testcase_02 | AC | 29 ms
18,048 KB |
testcase_03 | AC | 32 ms
19,328 KB |
testcase_04 | AC | 32 ms
19,584 KB |
testcase_05 | AC | 31 ms
19,072 KB |
testcase_06 | AC | 30 ms
19,200 KB |
testcase_07 | AC | 327 ms
46,064 KB |
testcase_08 | AC | 165 ms
34,172 KB |
testcase_09 | AC | 206 ms
36,852 KB |
testcase_10 | AC | 148 ms
33,652 KB |
testcase_11 | AC | 538 ms
59,100 KB |
testcase_12 | AC | 551 ms
59,368 KB |
testcase_13 | AC | 527 ms
57,972 KB |
testcase_14 | AC | 522 ms
57,960 KB |
testcase_15 | AC | 569 ms
60,660 KB |
testcase_16 | AC | 576 ms
60,620 KB |
testcase_17 | AC | 592 ms
61,676 KB |
testcase_18 | TLE | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
20evil_special_uni1.txt | -- | - |
20evil_special_uni2.txt | -- | - |
コンパイルメッセージ
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.Linq.Expressions;using System.IO;using static util;using P = pair<int, int>;using Binary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.ParameterExpression,System.Linq.Expressions.BinaryExpression>;using Unary = System.Func<System.Linq.Expressions.ParameterExpression, System.Linq.Expressions.UnaryExpression>;class Program{static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };static Scan sc = new Scan();const int M = 1000000007;const int M2 = 998244353;const long LM = (long)1e18;const double eps = 1e-11;static readonly int[] dd = { 0, 1, 0, -1, 0 };const string dstring = "RDLU";static void Main(){n = sc.Int;edge = new List<int>[n];dic = new Dictionary<int, bool>[n];for (int i = 0; i < n; i++){edge[i] = new List<int>();dic[i] = new Dictionary<int, bool>();}for (int i = 0; i < n - 1; i++){int a, b;sc.Multi(out a, out b);--a;--b;edge[a].Add(b);edge[b].Add(a);}var ans = new List<int>();for (int i = 0; i < n; i++)if (iswin(i, -1))ans.Add(i + 1);Prt(ans.Count);foreach (var item in ans)Prt(item);sw.Flush();}static int n;static List<int>[] edge;static Dictionary<int, bool>[] dic;static bool iswin(int p, int par) {if (dic[p].ContainsKey(par)) return dic[p][par];bool win = true;foreach (var item in edge[p]){if (item == par) continue;win &= !iswin(item, p);}return dic[p][par] = win;}static void DBG(string a) => Console.WriteLine(a);static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));static void DBG(params object[] a) => DBG(string.Join(" ", a));static void Prt(string a) => sw.WriteLine(a);static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));static void Prt(params object[] a) => Prt(string.Join(" ", a));}class pair<T, U> : IComparable<pair<T, U>>{public T v1;public U v2;public pair(T v1, U v2) {this.v1 = v1;this.v2 = v2;}public int CompareTo(pair<T, U> a) {int c = Comparer<T>.Default.Compare(v1, a.v1);return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);}public override string ToString() => v1 + " " + v2;public void Deconstruct(out T a, out U b) {a = v1; b = v2;}}static class util{public static pair<T, T> make_pair<T>(this IList<T> l) => make_pair(l[0], l[1]);public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);public static T sq<T>(T a) => Operator<T>.Multiply(a, a);public static T Max<T>(params T[] a) => a.Max();public static T Min<T>(params T[] a) => a.Min();public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }public static T[] copy<T>(this IList<T> a) {var ret = new T[a.Count];for (int i = 0; i < a.Count; i++) ret[i] = a[i];return ret;}}static class Operator<T>{static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");public static readonly Func<T, T, T> Add = Lambda(Expression.Add);public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);public static readonly Func<T, T> Negate = Lambda(Expression.Negate);public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();}class Scan{public int Int => int.Parse(Str);public long Long => long.Parse(Str);public double Double => double.Parse(Str);public string Str => Console.ReadLine().Trim();public pair<T, U> Pair<T, U>() where T : IComparable<T> where U : IComparable<U> {T a; U b;Multi(out a, out b);return new pair<T, U>(a, b);}public P P {get {int a, b;Multi(out a, out b);return new P(a, b);}}public int[] IntArr => StrArr.Select(int.Parse).ToArray();public long[] LongArr => StrArr.Select(long.Parse).ToArray();public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);bool eq<T, U>() => typeof(T).Equals(typeof(U));T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s)): eq<T, long>() ? ct<T, long>(long.Parse(s)): eq<T, double>() ? ct<T, double>(double.Parse(s)): eq<T, char>() ? ct<T, char>(s[0]): ct<T, string>(s);public void Multi<T>(out T a) => a = cv<T>(Str);public void Multi<T, U>(out T a, out U b){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }public void Multi<T, U, V>(out T a, out U b, out V c){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]); }}