結果

問題 No.1103 Directed Length Sum
ユーザー terry_u16terry_u16
提出日時 2020-07-03 23:44:27
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 2,301 ms / 3,000 ms
コード長 12,357 bytes
コンパイル時間 1,236 ms
コンパイル使用メモリ 121,892 KB
実行使用メモリ 321,068 KB
最終ジャッジ日時 2024-09-17 05:06:11
合計ジャッジ時間 20,907 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 30 ms
23,472 KB
testcase_01 AC 33 ms
25,348 KB
testcase_02 AC 2,301 ms
321,068 KB
testcase_03 AC 1,138 ms
94,096 KB
testcase_04 AC 1,142 ms
70,868 KB
testcase_05 AC 2,172 ms
122,912 KB
testcase_06 AC 717 ms
62,316 KB
testcase_07 AC 169 ms
38,468 KB
testcase_08 AC 238 ms
42,216 KB
testcase_09 AC 113 ms
35,724 KB
testcase_10 AC 346 ms
46,692 KB
testcase_11 AC 1,230 ms
83,600 KB
testcase_12 AC 670 ms
62,744 KB
testcase_13 AC 321 ms
49,884 KB
testcase_14 AC 83 ms
32,572 KB
testcase_15 AC 551 ms
53,848 KB
testcase_16 AC 1,518 ms
95,280 KB
testcase_17 AC 1,530 ms
95,832 KB
testcase_18 AC 313 ms
44,904 KB
testcase_19 AC 1,312 ms
82,932 KB
testcase_20 AC 128 ms
36,884 KB
testcase_21 AC 206 ms
41,468 KB
testcase_22 AC 1,056 ms
75,736 KB
testcase_23 AC 629 ms
57,700 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, 0) % 1000000007;
        }

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

        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
        {
            IEnumerable<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 IEnumerable<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