A64 Shortest Path 2

問題へのリンク

C#のソース

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("6 7");
            WillReturn.Add("1 2 15");
            WillReturn.Add("1 4 20");
            WillReturn.Add("2 3 65");
            WillReturn.Add("2 5 4");
            WillReturn.Add("3 6 50");
            WillReturn.Add("4 5 30");
            WillReturn.Add("5 6 8");
            //0
            //15
            //77
            //20
            //19
            //27
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("15 30");
            WillReturn.Add("10 11 23");
            WillReturn.Add("11 13 24");
            WillReturn.Add("5 8 22");
            WillReturn.Add("10 15 18");
            WillReturn.Add("12 14 15");
            WillReturn.Add("2 10 11");
            WillReturn.Add("4 7 15");
            WillReturn.Add("5 7 15");
            WillReturn.Add("7 9 8");
            WillReturn.Add("8 12 1");
            WillReturn.Add("5 14 1");
            WillReturn.Add("10 14 17");
            WillReturn.Add("10 12 11");
            WillReturn.Add("8 10 6");
            WillReturn.Add("7 14 28");
            WillReturn.Add("6 9 1");
            WillReturn.Add("1 10 19");
            WillReturn.Add("4 5 4");
            WillReturn.Add("9 10 21");
            WillReturn.Add("7 10 21");
            WillReturn.Add("4 10 29");
            WillReturn.Add("5 10 8");
            WillReturn.Add("4 14 8");
            WillReturn.Add("11 12 24");
            WillReturn.Add("10 13 13");
            WillReturn.Add("3 10 1");
            WillReturn.Add("5 12 24");
            WillReturn.Add("2 15 23");
            WillReturn.Add("6 10 18");
            WillReturn.Add("6 15 25");
            //0
            //30
            //20
            //31
            //27
            //37
            //40
            //25
            //38
            //19
            //42
            //26
            //32
            //28
            //37
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    struct EdgeInfoDef
    {
        internal long ToNode;
        internal long Cost;
    }
    static Dictionary<long, List<EdgeInfoDef>> mEdgeInfoListDict = new Dictionary<long, List<EdgeInfoDef>>();

    static void Main()
    {
        List<string> InputList = GetInputList();

        long[] wkArr = { };
        Action<string> SplitAct = pStr =>
            wkArr = pStr.Split(' ').Select(X => long.Parse(X)).ToArray();

        SplitAct(InputList[0]);
        long N = wkArr[0];

        foreach (string EachStr in InputList.Skip(1)) {
            SplitAct(EachStr);
            long FromNode = wkArr[0];
            long ToNode = wkArr[1];
            long Cost = wkArr[2];

            Action<long, long> AddAct = (pNode1, pNode2) =>
            {
                if (mEdgeInfoListDict.ContainsKey(pNode1) == false) {
                    mEdgeInfoListDict[pNode1] = new List<EdgeInfoDef>();
                }
                EdgeInfoDef WillAdd;
                WillAdd.ToNode = pNode2;
                WillAdd.Cost = Cost;
                mEdgeInfoListDict[pNode1].Add(WillAdd);
            };
            AddAct(FromNode, ToNode); // 正方向の辺
            AddAct(ToNode, FromNode); // 逆方向の辺
        }

        Dijkstra(1, N);
    }

    // ダイクストラ法で、各ノードまでの最短距離を求める
    static void Dijkstra(long pStaNode, long pGoalNode)
    {
        var InsPQueue = new PQueue();

        // 距離合計[確定ノード]なDict
        var KakuteiNodeDict = new Dictionary<long, long>();
        KakuteiNodeDict.Add(pStaNode, 0);

        //Enqueue処理
        Action<long> EnqueueAct = pFromNode =>
        {
            if (mEdgeInfoListDict.ContainsKey(pFromNode) == false) {
                return;
            }
            foreach (EdgeInfoDef EachEdge in mEdgeInfoListDict[pFromNode]) {
                // 確定ノードならContinue
                if (KakuteiNodeDict.ContainsKey(EachEdge.ToNode)) continue;

                long wkSumCost = KakuteiNodeDict[pFromNode] + EachEdge.Cost;

                PQueue.PQueueJyoutaiDef WillEnqueue;
                WillEnqueue.Node = EachEdge.ToNode;
                WillEnqueue.SumCost = wkSumCost;
                InsPQueue.Enqueue(WillEnqueue);
            }
        };
        EnqueueAct(pStaNode);

        while (InsPQueue.IsEmpty() == false) {
            PQueue.PQueueJyoutaiDef Dequeued = InsPQueue.Dequeue();

            // 確定ノードならcontinue
            if (KakuteiNodeDict.ContainsKey(Dequeued.Node)) continue;

            // 枝切り
            // if (KakuteiNodeDict.ContainsKey(pGoalNode)) break;

            KakuteiNodeDict.Add(Dequeued.Node, Dequeued.SumCost);
            EnqueueAct(Dequeued.Node);
        }

        for (int I = 1; I <= pGoalNode; I++) {
            if (KakuteiNodeDict.ContainsKey(I)) {
                Console.WriteLine(KakuteiNodeDict[I]);
            }
            else {
                Console.WriteLine(-1);
            }
        }
    }
}

#region PQueue
// 優先度付きキュー
internal class PQueue
{
    internal struct PQueueJyoutaiDef
    {
        internal long Node;
        internal long SumCost;
    }

    private Dictionary<long, PQueueJyoutaiDef> mHeapDict = new Dictionary<long, PQueueJyoutaiDef>();

    internal bool IsEmpty()
    {
        return mHeapDict.Count == 0;
    }

    // エンキュー処理
    internal void Enqueue(PQueueJyoutaiDef pAddJyoutai)
    {
        long CurrNode = 1 + mHeapDict.Count;
        mHeapDict[CurrNode] = pAddJyoutai;

        while (1 < CurrNode && mHeapDict[CurrNode / 2].SumCost > mHeapDict[CurrNode].SumCost) {
            PQueueJyoutaiDef Swap = mHeapDict[CurrNode];
            mHeapDict[CurrNode] = mHeapDict[CurrNode / 2];
            mHeapDict[CurrNode / 2] = Swap;

            CurrNode /= 2;
        }
    }

    // デキュー処理
    internal PQueueJyoutaiDef Dequeue()
    {
        PQueueJyoutaiDef TopNode = mHeapDict[1];
        long LastNode = mHeapDict.Count;
        mHeapDict[1] = mHeapDict[LastNode];
        mHeapDict.Remove(LastNode);

        MinHeapify(1);
        return TopNode;
    }

    // 根ノードを指定し、根から葉へヒープ構築
    private void MinHeapify(long pRootNode)
    {
        if (mHeapDict.Count <= 1) {
            return;
        }

        long Left = pRootNode * 2;
        long Right = pRootNode * 2 + 1;

        // 左の子、自分、右の子で値が最小のノードを選ぶ
        long Smallest = mHeapDict[pRootNode].SumCost;
        long SmallestNode = pRootNode;

        if (mHeapDict.ContainsKey(Left) && mHeapDict[Left].SumCost < Smallest) {
            Smallest = mHeapDict[Left].SumCost;
            SmallestNode = Left;
        }
        if (mHeapDict.ContainsKey(Right) && mHeapDict[Right].SumCost < Smallest) {
            Smallest = mHeapDict[Right].SumCost;
            SmallestNode = Right;
        }

        // 子ノードのほうが大きい場合
        if (SmallestNode != pRootNode) {
            PQueueJyoutaiDef Swap = mHeapDict[SmallestNode];
            mHeapDict[SmallestNode] = mHeapDict[pRootNode];
            mHeapDict[pRootNode] = Swap;

            // 再帰的に呼び出し
            MinHeapify(SmallestNode);
        }
    }
}
#endregion

解説

ダイクストラ法を使ってます。