結果

問題 No.1103 Directed Length Sum
ユーザー terry_u16terry_u16
提出日時 2020-07-04 00:19:21
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 2,214 ms / 3,000 ms
コード長 19,524 bytes
コンパイル時間 3,895 ms
コンパイル使用メモリ 125,788 KB
実行使用メモリ 439,152 KB
最終ジャッジ日時 2024-09-17 05:16:09
合計ジャッジ時間 20,210 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
25,216 KB
testcase_01 AC 33 ms
23,476 KB
testcase_02 AC 1,636 ms
439,152 KB
testcase_03 AC 1,141 ms
102,808 KB
testcase_04 AC 1,239 ms
78,704 KB
testcase_05 AC 2,214 ms
122,996 KB
testcase_06 AC 721 ms
58,436 KB
testcase_07 AC 153 ms
36,532 KB
testcase_08 AC 232 ms
42,596 KB
testcase_09 AC 110 ms
35,736 KB
testcase_10 AC 322 ms
44,124 KB
testcase_11 AC 1,282 ms
81,116 KB
testcase_12 AC 713 ms
60,960 KB
testcase_13 AC 356 ms
45,016 KB
testcase_14 AC 98 ms
34,348 KB
testcase_15 AC 531 ms
55,880 KB
testcase_16 AC 1,500 ms
97,184 KB
testcase_17 AC 1,554 ms
95,560 KB
testcase_18 AC 315 ms
44,380 KB
testcase_19 AC 1,247 ms
82,784 KB
testcase_20 AC 116 ms
34,836 KB
testcase_21 AC 194 ms
39,548 KB
testcase_22 AC 1,063 ms
75,752 KB
testcase_23 AC 595 ms
57,256 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using YukicoderContest255.Extensions;
using YukicoderContest255.Questions;

namespace YukicoderContest255.Questions
{
    public class QuestionC : AtCoderQuestionBase
    {
        BasicGraph tree;

        public override IEnumerable<object> Solve(TextReader inputStream)
        {
            var nodes = inputStream.ReadInt();
            tree = new BasicGraph(nodes);
            var isRoot = Enumerable.Repeat(true, nodes).ToArray();

            for (int i = 0; i < nodes - 1; i++)
            {
                var (a, b) = inputStream.ReadValue<int, int>();
                a--;
                b--;
                tree.AddEdge(new BasicEdge(a, b));
                isRoot[b] = false;
            }

            var root = -1;
            for (int i = 0; i < isRoot.Length; i++)
            {
                if (isRoot[i])
                {
                    root = i;
                    break;
                }
            }

            yield return Dfs(root, 0, Modular.Zero).Value;
        }

        Modular Dfs(int node, int parents, Modular sum)
        {
            sum += parents;
            var childrenSum = Modular.Zero;
            foreach (var edge in tree[node])
            {
                childrenSum += Dfs(edge.To.Index, parents + 1, sum);
            }
            return sum + childrenSum;
        }

        public readonly struct Modular : IEquatable<Modular>, IComparable<Modular>
        {
            private const int DefaultMod = 1000000007;
            public int Value { get; }
            public static int Mod { get; set; } = DefaultMod;

            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            public Modular(long value)
            {
                if (unchecked((ulong)value) < unchecked((ulong)Mod))
                {
                    Value = (int)value;
                }
                else
                {
                    Value = (int)(value % Mod);
                    if (Value < 0)
                    {
                        Value += Mod;
                    }
                }
            }

            private Modular(int value) => Value = value;
            public static Modular Zero => new Modular(0);
            public static Modular One => new Modular(1);

            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            public static Modular operator +(Modular a, Modular b)
            {
                var result = a.Value + b.Value;
                if (result >= Mod)
                {
                    result -= Mod;    // 剰余演算を避ける
                }
                return new Modular(result);
            }

            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            public static Modular operator -(Modular a, Modular b)
            {
                var result = a.Value - b.Value;
                if (result < 0)
                {
                    result += Mod;    // 剰余演算を避ける
                }
                return new Modular(result);
            }

            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            public static Modular operator *(Modular a, Modular b) => new Modular((long)a.Value * b.Value);

            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            public static Modular operator /(Modular a, Modular b) => a * Pow(b.Value, Mod - 2);

            // 需要は不明だけど一応
            public static bool operator ==(Modular left, Modular right) => left.Equals(right);
            public static bool operator !=(Modular left, Modular right) => !(left == right);
            public static bool operator <(Modular left, Modular right) => left.CompareTo(right) < 0;
            public static bool operator <=(Modular left, Modular right) => left.CompareTo(right) <= 0;
            public static bool operator >(Modular left, Modular right) => left.CompareTo(right) > 0;
            public static bool operator >=(Modular left, Modular right) => left.CompareTo(right) >= 0;

            public static implicit operator Modular(long a) => new Modular(a);
            public static explicit operator int(Modular a) => a.Value;
            public static explicit operator long(Modular a) => a.Value;

            public static Modular Pow(int a, int n)
            {
                switch (n)
                {
                    case 0:
                        return Modular.One;
                    case 1:
                        return a;
                    case int m when m >= 0: // ジャンプテーブル化はできなくなる
                        var p = Pow(a, m >> 1);             // m / 2
                        return p * p * Pow(a, m & 0x01);    // m % 2
                    default:
                        throw new ArgumentOutOfRangeException(nameof(n), $"べき指数{nameof(n)}は0以上の整数でなければなりません。");
                }
            }

            private static List<int> _factorialCache;
            private static List<int> FactorialCache => _factorialCache ??= new List<int>() { 1 };
            private static int[] FactorialInverseCache { get; set; }
            const int defaultMaxFactorial = 1000000;

            public static Modular Factorial(int n)
            {
                if (n < 0)
                {
                    throw new ArgumentOutOfRangeException(nameof(n), $"{nameof(n)}は0以上の整数でなければなりません。");
                }

                for (int i = FactorialCache.Count; i <= n; i++)  // Countが1（0!までキャッシュ済み）のとき1!～n!まで計算
                {
                    FactorialCache.Add((int)((long)FactorialCache[i - 1] * i % Mod));
                }
                return new Modular(FactorialCache[n]);
            }

            public static Modular Permutation(int n, int r)
            {
                CheckNR(n, r);
                return Factorial(n) / Factorial(n - r);
            }

            public static Modular Combination(int n, int r)
            {
                CheckNR(n, r);
                r = Math.Min(r, n - r);
                try
                {
                    return new Modular(FactorialCache[n]) * new Modular(FactorialInverseCache[r]) * new Modular(FactorialInverseCache[n - r]);
                }
                catch (Exception ex) when (ex is NullReferenceException || ex is ArgumentOutOfRangeException)
                {
                    throw new InvalidOperationException($"{nameof(Combination)}を呼び出す前に{nameof(InitializeCombinationTable)}により前計算を行う必要があります。", ex);
                }
            }

            public static void InitializeCombinationTable(int max = defaultMaxFactorial)
            {
                Factorial(max);
                FactorialInverseCache = new int[max + 1];

                var fInv = (Modular.One / Factorial(max)).Value;
                FactorialInverseCache[max] = fInv;
                for (int i = max - 1; i >= 0; i--)
                {
                    fInv = (int)((long)fInv * (i + 1) % Mod);
                    FactorialInverseCache[i] = fInv;
                }
            }

            public static Modular CombinationWithRepetition(int n, int r) => Combination(n + r - 1, r);

            private static void CheckNR(int n, int r)
            {
                if (n < 0)
                {
                    throw new ArgumentOutOfRangeException(nameof(n), $"{nameof(n)}は0以上の整数でなければなりません。");
                }
                if (r < 0)
                {
                    throw new ArgumentOutOfRangeException(nameof(r), $"{nameof(r)}は0以上の整数でなければなりません。");
                }
                if (n < r)
                {
                    throw new ArgumentOutOfRangeException($"{nameof(n)},{nameof(r)}", $"{nameof(r)}は{nameof(n)}以下でなければなりません。");
                }
            }

            public override string ToString() => $"{Value} (mod {Mod})";
            public override bool Equals(object obj) => obj is Modular m ? Equals(m) : false;
            public bool Equals([System.Diagnostics.CodeAnalysis.AllowNull] Modular other) => Value == other.Value;
            public int CompareTo([System.Diagnostics.CodeAnalysis.AllowNull] Modular other) => Value.CompareTo(other.Value);
            public override int GetHashCode() => Value.GetHashCode();
        }

        public interface INode
        {
            public int Index { get; }
        }

        public interface IEdge<TNode> where TNode : INode
        {
            TNode From { get; }
            TNode To { get; }
        }

        public interface IWeightedEdge<TNode> : IEdge<TNode> where TNode : INode
        {
            long Weight { get; }
        }

        public interface IGraph<TNode, TEdge> where TEdge : IEdge<TNode> where TNode : INode
        {
            List<TEdge> this[TNode node] { get; }
            IEnumerable<TEdge> Edges { get; }
            IEnumerable<TNode> Nodes { get; }
            int NodeCount { get; }
        }

        public interface IWeightedGraph<TNode, TEdge> : IGraph<TNode, TEdge> where TEdge : IWeightedEdge<TNode> where TNode : INode { }

        [StructLayout(LayoutKind.Auto)]
        public readonly struct BasicNode : INode, IEquatable<BasicNode>
        {
            public int Index { get; }

            public BasicNode(int index)
            {
                Index = index;
            }

            public override string ToString() => Index.ToString();
            public override bool Equals(object obj) => obj is BasicNode node && Equals(node);
            public bool Equals(BasicNode other) => Index == other.Index;
            public override int GetHashCode() => HashCode.Combine(Index);
            public static bool operator ==(BasicNode left, BasicNode right) => left.Equals(right);
            public static bool operator !=(BasicNode left, BasicNode right) => !(left == right);
            public static implicit operator BasicNode(int value) => new BasicNode(value);
        }

        [StructLayout(LayoutKind.Auto)]
        public readonly struct BasicEdge : IEdge<BasicNode>
        {
            public BasicNode From { get; }
            public BasicNode To { get; }

            public BasicEdge(int from, int to)
            {
                From = from;
                To = to;
            }

            public override string ToString() => $"{From}-->{To}";
        }

        [StructLayout(LayoutKind.Auto)]
        public readonly struct WeightedEdge : IWeightedEdge<BasicNode>
        {
            public BasicNode From { get; }
            public BasicNode To { get; }
            public long Weight { get; }

            public WeightedEdge(int from, int to) : this(from, to, 1) { }

            public WeightedEdge(int from, int to, long weight)
            {
                From = from;
                To = to;
                Weight = weight;
            }

            public override string ToString() => $"{From}--[{Weight}]-->{To}";
        }

        public class BasicGraph : IGraph<BasicNode, BasicEdge>
        {
            private readonly List<BasicEdge>[] _edges;
            public List<BasicEdge> this[BasicNode node] => _edges[node.Index];
            public IEnumerable<BasicEdge> Edges => Nodes.SelectMany(node => this[node]);
            public IEnumerable<BasicNode> Nodes => Enumerable.Range(0, NodeCount).Select(i => new BasicNode(i));
            public int NodeCount { get; }

            public BasicGraph(int nodeCount) : this(nodeCount, Enumerable.Empty<BasicEdge>()) { }

            public BasicGraph(int nodeCount, IEnumerable<BasicEdge> edges)
            {
                _edges = Enumerable.Repeat(0, nodeCount).Select(_ => new List<BasicEdge>()).ToArray();
                NodeCount = nodeCount;
                foreach (var edge in edges)
                {
                    AddEdge(edge);
                }
            }

            public BasicGraph(int nodeCount, IEnumerable<IEnumerable<int>> distances)
            {
                _edges = new List<BasicEdge>[nodeCount];

                int i = 0;
                foreach (var row in distances)
                {
                    _edges[i] = new List<BasicEdge>(nodeCount);
                    int j = 0;
                    foreach (var distance in row)
                    {
                        if (distance == 1)
                        {
                            _edges[i].Add(new BasicEdge(i, j++));
                        }
                    }
                    i++;
                }
            }

            public void AddEdge(BasicEdge edge) => _edges[edge.From.Index].Add(edge);
        }

    }
}

namespace YukicoderContest255
{
    class Program
    {
        static void Main(string[] args)
        {
            IAtCoderQuestion question = new QuestionC();
            var answers = question.Solve(Console.In);

            var writer = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            Console.SetOut(writer);
            foreach (var answer in answers)
            {
                Console.WriteLine(answer);
            }
            Console.Out.Flush();
        }
    }
}

#region Base Class

namespace YukicoderContest255.Questions
{

    public interface IAtCoderQuestion
    {
        IEnumerable<object> Solve(string input);
        IEnumerable<object> Solve(TextReader inputStream);
    }

    public abstract class AtCoderQuestionBase : IAtCoderQuestion
    {
        public IEnumerable<object> Solve(string input)
        {
            var stream = new MemoryStream(Encoding.Unicode.GetBytes(input));
            var reader = new StreamReader(stream, Encoding.Unicode);

            return Solve(reader);
        }

        public abstract IEnumerable<object> Solve(TextReader inputStream);
    }
}

#endregion

#region Extensions

namespace YukicoderContest255.Extensions
{
    public static class TextReaderExtensions
    {
        public static int ReadInt(this TextReader reader) => int.Parse(ReadString(reader));
        public static long ReadLong(this TextReader reader) => long.Parse(ReadString(reader));
        public static double ReadDouble(this TextReader reader) => double.Parse(ReadString(reader));
        public static string ReadString(this TextReader reader) => reader.ReadLine();

        public static int[] ReadIntArray(this TextReader reader, char separator = ' ') => ReadStringArray(reader, separator).Select(int.Parse).ToArray();
        public static long[] ReadLongArray(this TextReader reader, char separator = ' ') => ReadStringArray(reader, separator).Select(long.Parse).ToArray();
        public static double[] ReadDoubleArray(this TextReader reader, char separator = ' ') => ReadStringArray(reader, separator).Select(double.Parse).ToArray();
        public static string[] ReadStringArray(this TextReader reader, char separator = ' ') => reader.ReadLine().Split(separator);

        // Supports primitive type only.
        public static T1 ReadValue<T1>(this TextReader reader) => (T1)Convert.ChangeType(reader.ReadLine(), typeof(T1));

        public static (T1, T2) ReadValue<T1, T2>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            return (v1, v2);
        }

        public static (T1, T2, T3) ReadValue<T1, T2, T3>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
            return (v1, v2, v3);
        }

        public static (T1, T2, T3, T4) ReadValue<T1, T2, T3, T4>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
            var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
            return (v1, v2, v3, v4);
        }

        public static (T1, T2, T3, T4, T5) ReadValue<T1, T2, T3, T4, T5>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
            var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
            var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
            return (v1, v2, v3, v4, v5);
        }

        public static (T1, T2, T3, T4, T5, T6) ReadValue<T1, T2, T3, T4, T5, T6>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
            var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
            var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
            var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
            return (v1, v2, v3, v4, v5, v6);
        }

        public static (T1, T2, T3, T4, T5, T6, T7) ReadValue<T1, T2, T3, T4, T5, T6, T7>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
            var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
            var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
            var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
            var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
            return (v1, v2, v3, v4, v5, v6, v7);
        }

        public static (T1, T2, T3, T4, T5, T6, T7, T8) ReadValue<T1, T2, T3, T4, T5, T6, T7, T8>(this TextReader reader, char separator = ' ')
        {
            var inputs = ReadStringArray(reader, separator);
            var v1 = (T1)Convert.ChangeType(inputs[0], typeof(T1));
            var v2 = (T2)Convert.ChangeType(inputs[1], typeof(T2));
            var v3 = (T3)Convert.ChangeType(inputs[2], typeof(T3));
            var v4 = (T4)Convert.ChangeType(inputs[3], typeof(T4));
            var v5 = (T5)Convert.ChangeType(inputs[4], typeof(T5));
            var v6 = (T6)Convert.ChangeType(inputs[5], typeof(T6));
            var v7 = (T7)Convert.ChangeType(inputs[6], typeof(T7));
            var v8 = (T8)Convert.ChangeType(inputs[7], typeof(T8));
            return (v1, v2, v3, v4, v5, v6, v7, v8);
        }
    }
}

#endregion
0