結果
問題 | No.1103 Directed Length Sum |
ユーザー | eSeF |
提出日時 | 2020-07-04 00:04:30 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 8,903 bytes |
コンパイル時間 | 1,333 ms |
コンパイル使用メモリ | 121,600 KB |
実行使用メモリ | 155,768 KB |
最終ジャッジ日時 | 2024-09-17 05:11:00 |
合計ジャッジ時間 | 30,377 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
27,840 KB |
testcase_01 | AC | 35 ms
25,672 KB |
testcase_02 | AC | 1,872 ms
155,768 KB |
testcase_03 | AC | 1,534 ms
120,104 KB |
testcase_04 | AC | 1,891 ms
94,656 KB |
testcase_05 | TLE | - |
testcase_06 | AC | 1,210 ms
73,452 KB |
testcase_07 | AC | 242 ms
44,588 KB |
testcase_08 | AC | 397 ms
49,308 KB |
testcase_09 | AC | 159 ms
36,460 KB |
testcase_10 | AC | 568 ms
55,936 KB |
testcase_11 | AC | 2,096 ms
96,700 KB |
testcase_12 | AC | 1,207 ms
71,140 KB |
testcase_13 | AC | 590 ms
54,192 KB |
testcase_14 | AC | 126 ms
39,288 KB |
testcase_15 | AC | 887 ms
63,448 KB |
testcase_16 | AC | 2,426 ms
106,368 KB |
testcase_17 | AC | 2,534 ms
109,276 KB |
testcase_18 | AC | 545 ms
53,584 KB |
testcase_19 | AC | 2,125 ms
101,340 KB |
testcase_20 | AC | 188 ms
42,504 KB |
testcase_21 | AC | 341 ms
45,596 KB |
testcase_22 | AC | 1,666 ms
85,044 KB |
testcase_23 | AC | 990 ms
67,076 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.Collections.Generic; using System.Linq; using System.IO; using System.Text; using System.Numerics; using System.Threading; using System.Runtime.CompilerServices; using static System.Math; using static System.Array; using static AtCoder.Sc_out; using static AtCoder.Tool; using static AtCoder.ModInt; namespace AtCoder { class AC { const int MOD = 1000000007; //const int MOD = 998244353; const int INF = int.MaxValue / 2; const long SINF = long.MaxValue / 2; const double EPS = 1e-8; static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 }; static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 }; //static List<List<int>> G = new List<List<int>>(); //static List<List<Edge>> G = new List<List<Edge>>(); //static List<Edge> E = new List<Edge>(); static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; Console.SetOut(sw); var th = new Thread(Run, 1 << 26); th.Start(); th.Join(); //Run(); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] static void Run() { int Testcase = 1; for (var _ = 0; _ < Testcase; _++) Solve(); } static void Solve() { int N = Cin.Int; var G = new List<List<int>>(); for (var i = 0; i < N; i++) G.Add(new List<int>()); for(var i = 0; i < N - 1; i++) { Cin.Input(out int a, out int b); a--;b--; G[a].Add(b); } long ans = 0; var depth = new long[N]; var ord = Topological_Sort(G); foreach(var v in ord) { foreach (var nx in G[v]) depth[nx] = depth[v] + 1; } ord.Reverse(); var dp = new long[N]; foreach(var v in ord) { dp[v] = 1; foreach(var nx in G[v]) { dp[v] += dp[nx]; ans += dp[nx] * (depth[v] + 1); ans %= MOD; } } OutL(ans); } static public List<int> Topological_Sort(List<List<int>> G) { var ret = new List<int>(); var Nodes = new Queue<int>(); int N = G.Count(); var Link = new int[N]; for (var i = 0; i < N; i++) { Link[i] = 0; } for (var i = 0; i < N; i++) { foreach (var nx in G[i]) { Link[nx]++; } } for (var i = 0; i < N; i++) { if (Link[i] == 0) { Nodes.Enqueue(i); } } while (Nodes.Any()) { var nd = Nodes.Dequeue(); ret.Add(nd); foreach (var nx in G[nd]) { Link[nx]--; if (Link[nx] == 0) { Nodes.Enqueue(nx); } } } return ret; } public struct Edge { public int from; public int to; public long dist; public Edge(int t, long c) { from = -1; to = t; dist = c; } public Edge(int f, int t, long c) { from = f; to = t; dist = c; } } } struct ModInt { public long value; private const int MOD = 1000000007; //private const int MOD = 998244353; public ModInt(long value) { this.value = value; } public static implicit operator ModInt(long a) { var ret = a % MOD; return new ModInt(ret < 0 ? (ret + MOD) : ret); } public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value); public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value); public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value); public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2); public static ModInt operator <<(ModInt a, int n) => (a.value << n); public static ModInt operator >>(ModInt a, int n) => (a.value >> n); public static ModInt operator ++(ModInt a) => a.value + 1; public static ModInt operator --(ModInt a) => a.value - 1; public static ModInt Modpow(ModInt a, long n) { var k = a; ModInt ret = 1; while (n > 0) { if ((n & 1) != 0) ret *= k; k *= k; n >>= 1; } return ret; } private static readonly List<long> Factorials = new List<long>() { 1 }; public static ModInt Fac(long n) { for (var i = Factorials.Count(); i <= n; i++) { Factorials.Add((Factorials[i - 1] * i) % MOD); } return Factorials[(int)n]; } public static ModInt nCr(long n, long r) { return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r)); } public static explicit operator int(ModInt a) => (int)a.value; } static class Cin { public static string[] ReadSplit => Console.ReadLine().Split(); public static int[] ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse); public static long[] ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse); public static double[] ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse); public static string Str => Console.ReadLine(); public static int Int => int.Parse(Console.ReadLine()); public static long Long => long.Parse(Console.ReadLine()); public static double Double => double.Parse(Console.ReadLine()); public static T Conv<T>(string input) { if (typeof(T).Equals(typeof(ModInt))) { return (T)(dynamic)(long.Parse(input)); } return (T)Convert.ChangeType(input, typeof(T)); } public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine()); public static void Input<T, U>(out T a, out U b) { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); } public static void Input<T, U, V>(out T a, out U b, out V c) { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); } public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d) { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); } public static void Input<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) { var q = ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]); d = Conv<W>(q[3]); e = Conv<X>(q[4]); } } static class Sc_out { public static void OutL(object s) => Console.WriteLine(s); public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s)); public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s)); public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s)); public static void Out_One(object s) => Console.Write($"{s} "); public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}"); public static void Endl() => Console.WriteLine(); } public static class Tool { static public void Initialize<T>(ref T[] array, T initialvalue) { array = ConvertAll(array, x => initialvalue); } static public void Swap<T>(ref T a, ref T b) { T keep = a; a = b; b = keep; } static public void Display<T>(T[,] array2d, int n, int m) { for (var i = 0; i < n; i++) { for (var j = 0; j < m; j++) { Console.Write($"{array2d[i, j]} "); } Console.WriteLine(); } } static public long Gcd(long a, long b) { if (a == 0 || b == 0) return Max(a, b); return a % b == 0 ? b : Gcd(b, a % b); } static public long LPow(int a, int b) => (long)Pow(a, b); static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0; static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a)); } }