結果

問題 No.2638 Initial fare
ユーザー tobisatistobisatis
提出日時 2024-02-19 22:57:23
言語 C#
(.NET 8.0.203)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,682 bytes
コンパイル時間 7,942 ms
コンパイル使用メモリ 166,404 KB
実行使用メモリ 396,804 KB
最終ジャッジ日時 2024-04-16 20:37:47
合計ジャッジ時間 36,054 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
30,464 KB
testcase_01 AC 59 ms
30,300 KB
testcase_02 AC 58 ms
30,464 KB
testcase_03 AC 57 ms
30,336 KB
testcase_04 AC 1,073 ms
128,208 KB
testcase_05 AC 1,132 ms
132,292 KB
testcase_06 AC 61 ms
30,364 KB
testcase_07 AC 1,156 ms
139,628 KB
testcase_08 AC 921 ms
148,284 KB
testcase_09 AC 1,052 ms
155,236 KB
testcase_10 AC 1,028 ms
159,508 KB
testcase_11 AC 59 ms
30,208 KB
testcase_12 AC 1,113 ms
136,912 KB
testcase_13 AC 899 ms
146,504 KB
testcase_14 AC 1,056 ms
151,692 KB
testcase_15 AC 1,044 ms
152,260 KB
testcase_16 AC 59 ms
30,336 KB
testcase_17 AC 1,066 ms
143,560 KB
testcase_18 AC 990 ms
146,876 KB
testcase_19 AC 1,307 ms
174,784 KB
testcase_20 AC 1,195 ms
148,760 KB
testcase_21 AC 1,398 ms
180,972 KB
testcase_22 AC 58 ms
30,336 KB
testcase_23 AC 1,926 ms
261,420 KB
testcase_24 TLE -
testcase_25 AC 58 ms
30,196 KB
testcase_26 AC 1,819 ms
230,644 KB
testcase_27 TLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (94 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

namespace AtCoder;

#nullable enable

using System.Numerics;

static class Extensions
{
    public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();
}

class Graph<T>
{
    public struct Edge
    {
        public int Ab { get; set; }
        public int Ad { get; set; }
        public T Distance { get; set; }
    }

    public int N { get; private init; }
    public bool Directed { get; private init; }
    public List<List<(int next, int edgeIndex)>> AdjacencyList { get; private init; }
    public List<Edge> Edges { get; private init; }

    public Graph(int verticals, IReadOnlyList<Edge> edges, bool directed)
    {
        N = verticals;
        Directed = directed;
        AdjacencyList = new List<List<(int, int)>>();
        for (var i = 0; i < N; i++) AdjacencyList.Add(new List<(int, int)>());
        Edges = new List<Edge>();
        for (var i = 0; i < edges.Count; i++)
        {
            var edge = edges[i];
            Edges.Add(edge);
            AdjacencyList[edge.Ab].Add((edge.Ad, i));
            if (!Directed) AdjacencyList[edge.Ad].Add((edge.Ab, i));
        }
    }
}

class GraphBuilder
{
    public static Graph<int> SimpleGraph(int verticals, (int ab, int ad)[] edges, bool directed)
    {
        var e = edges.Select(e => new Graph<int>.Edge { Ab = e.ab, Ad = e.ad, Distance = 1 }).ToList();
        return new(verticals, e, directed);
    }

    public static Graph<T> Graph<T>(int verticals, (int ab, int ad, T edge)[] edges, bool directed)
    {
        var e = edges.Select(e => new Graph<T>.Edge { Ab = e.ab, Ad = e.ad, Distance = e.edge }).ToList();
        return new(verticals, e, directed);
    }
}

class GraphBase<T> { public required Graph<T> Graph { get; init; } }

class Tree<T> : GraphBase<T>
{
    public static Tree<T>? TryConstruct(Graph<T> graph)
    {
        if (graph.Directed || graph.Edges.Count + 1 != graph.N) return null;
        var visited = new bool[graph.N];
        int S(int v, int prev)
        {
            visited[v] = true;
            var res = 1;
            foreach (var (next, _) in graph.AdjacencyList[v])
            {
                if (next == prev || visited[next]) continue;
                res += S(next, v);
            }
            return res;
        }
        if (S(0, -1) < graph.N) return null;
        return new Tree<T> { Graph = graph };
    }

    public interface IRerootingOperator<TResult>
    {
        TResult Identity { get; }
        TResult Merge(TResult l, TResult r);
        TResult Finalize(TResult e, int v);
    }
    public TResult[] Rerooting<TResult, TOperator>(TOperator op = default) where TOperator : struct, IRerootingOperator<TResult>
    {
        var n = Graph.N;
        var res = new TResult[n];
        var adjacencyList = Graph.AdjacencyList;
        var subTreeValues = new (TResult, int)[n][];
        TResult SubTreeValue(int v, int prev)
        {
            var merged = op.Identity;
            var l = adjacencyList[v].Count;
            subTreeValues[v] = new (TResult, int)[l];
            for (var i = 0; i < l; i++)
            {
                var (next, index) = adjacencyList[v][i];
                if (next == prev) continue;
                var subTreeValue = SubTreeValue(next, v);
                subTreeValues[v][i] = (subTreeValue, index);
                merged = op.Merge(merged, subTreeValue);
            }
            return op.Finalize(merged, v);
        }
        void Evaluate(int v, int prev, TResult prevValue)
        {
            var adjacencies = adjacencyList[v];
            var l = adjacencies.Count;
            for (var i = 0; i < l; i++) if (adjacencies[i].next == prev)
            {
                subTreeValues[v][i].Item1 = prevValue;
                break;
            }
            var sumL = new TResult[l];
            var sumR = new TResult[l];
            sumL[0] = op.Identity;
            sumR[l - 1] = op.Identity;
            for (var i = 1; i < l; i++) sumL[i] = op.Merge(sumL[i - 1], subTreeValues[v][i - 1].Item1);
            for (var i = l - 2; i >= 0; i--) sumR[i] = op.Merge(sumR[i + 1], subTreeValues[v][i + 1].Item1);
            res[v] = op.Finalize(op.Merge(sumR[0], subTreeValues[v][0].Item1), v);
            for (var i = 0; i < l; i++)
            {
                var next = adjacencies[i].next;
                if (next == prev) continue;
                Evaluate(next, v, op.Finalize(op.Merge(sumL[i], sumR[i]), next));
            }
        }
        SubTreeValue(0, -1);
        Evaluate(0, -1, op.Identity);
        return res;
    }
}

readonly struct Op : Tree<int>.IRerootingOperator<long[]>
{
    public long[] Identity => new long[4];
    public long[] Finalize(long[] e, int v)
    {
        var res = new long[4];
        res[0] = 1;
        for (var i = 1; i <= 3; i++) res[i] += e[i - 1];
        return res;
    }
    public long[] Merge(long[] l, long[] r)
    {
        var y = new long[4];
        for (var i = 0; i <= 3; i++) y[i] = l[i] + r[i];
        return y;
    }
}

class AtCoder
{
    object? Solve()
    {
        var n = Int();
        var edges = (n - 1).Repeat(() => (Int() - 1, Int() - 1));
        var g = GraphBuilder.SimpleGraph(n, edges, false);
        var t = Tree<int>.TryConstruct(g)!;
        var s = t.Rerooting<long[], Op>();
        var ans = 0L;
        for (var i = 0; i < n; i++) for (var j = 1; j <= 3; j++) ans += s[i][j];
        ans /= 2;
        return ans;
    }

    public static void Main() => new AtCoder().Run();
    public void Run()
    {
        var res = Solve();
        if (res != null)
        {
            if (res is bool yes) res = yes ? "Yes" : "No";
            sw.WriteLine(res);
        }
        sw.Flush();
    }

    string[] input = Array.Empty<string>();
    int iter = 0;
    readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false };

    #pragma warning disable IDE0051
    string String()
    {
        while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0);
        return input[iter++];
    }
    T Input<T>() where T : IParsable<T> => T.Parse(String(), null);
    int Int() => Input<int>();
    void Out(object? x, string? separator = null)
    {
        separator ??= Environment.NewLine;
        if (x is System.Collections.IEnumerable obj and not string)
        {
            var firstLine = true;
            foreach (var item in obj)
            {
                if (!firstLine) sw.Write(separator);
                firstLine = false;
                sw.Write(item);
            }
        }
        else sw.Write(x);
        sw.WriteLine();
    }
    #pragma warning restore IDE0051
}
0