ABC423-D Long Waiting

問題へのリンク

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("4 10");
            WillReturn.Add("30 300 3");
            WillReturn.Add("60 45 4");
            WillReturn.Add("90 45 5");
            WillReturn.Add("120 45 2");
            //30
            //60
            //105
            //120
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("4 10");
            WillReturn.Add("30 300 10");
            WillReturn.Add("60 45 2");
            WillReturn.Add("90 45 3");
            WillReturn.Add("120 45 4");
            //30
            //330
            //330
            //330
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("10 24");
            WillReturn.Add("279290 9485601 1");
            WillReturn.Add("1094410 8022270 4");
            WillReturn.Add("1314176 7214745 5");
            WillReturn.Add("1897674 5924694 10");
            WillReturn.Add("1921802 5769841 4");
            WillReturn.Add("2506394 2765234 2");
            WillReturn.Add("2558629 2727489 9");
            WillReturn.Add("2681289 4061363 5");
            WillReturn.Add("3022540 2291905 3");
            WillReturn.Add("4407692 1313036 8");
            //279290
            //1094410
            //1314176
            //1897674
            //1921802
            //7691643
            //7822368
            //8528921
            //8528921
            //10549857
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static long[] GetSplitArr(string pStr)
    {
        return (pStr == "" ? new string[0] : pStr.Split(' ')).Select(pX => long.Parse(pX)).ToArray();
    }

    struct ABCInfoDef
    {
        internal long A;
        internal long B;
        internal long C;
    }
    static List<ABCInfoDef> mABCInfoList = new List<ABCInfoDef>();

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

        long[] wkArr = { };
        Action<string> SplitAct = (pStr) => wkArr = GetSplitArr(pStr);

        SplitAct(InputList[0]);
        long K = wkArr[1];

        // 入店の待ち行列
        var Que = new Queue<int>();

        // 退店のプライオリティキュー
        var Ins_PQueue_Arr = new PQueue_Arr();

        foreach (string EachStr in InputList.Skip(1)) {
            SplitAct(EachStr);
            ABCInfoDef WillAdd;
            WillAdd.A = wkArr[0];
            WillAdd.B = wkArr[1];
            WillAdd.C = wkArr[2];
            mABCInfoList.Add(WillAdd);
            Que.Enqueue(mABCInfoList.Count - 1);
        }

        long CurrTime = 0;
        long Ninzuu = 0;

        var AnswerDict = new Dictionary<int, long>();

        while (true) {
            // 入店
            Action<int> ExecNyuuten = (pListInd) =>
            {
                ABCInfoDef CurrABCInfo = mABCInfoList[pListInd];
                CurrTime = Math.Max(CurrTime, CurrABCInfo.A);
                Que.Dequeue();
                AnswerDict[pListInd] = CurrTime;

                Ninzuu += CurrABCInfo.C;

                PQueue_Arr.PQueueJyoutaiDef WillEnqueue;
                WillEnqueue.ListInd = pListInd;
                WillEnqueue.SortKey = CurrTime + mABCInfoList[pListInd].B;
                Ins_PQueue_Arr.Enqueue(WillEnqueue);
            };

            // 退店
            Action<int> ExecTaiten = (pListInd) =>
            {
                CurrTime = Math.Max(CurrTime, Ins_PQueue_Arr.Peek().SortKey);
                Ninzuu -= mABCInfoList[pListInd].C;

                Ins_PQueue_Arr.Dequeue();
            };

            if (Que.Count == 0 && Ins_PQueue_Arr.Count() == 0) {
                break;
            }
            if (Que.Count > 0 && Ins_PQueue_Arr.Count() == 0) {
                ExecNyuuten(Que.Peek());
                continue;
            }
            if (Que.Count == 0 && Ins_PQueue_Arr.Count() > 0) {
                ExecTaiten(Ins_PQueue_Arr.Peek().ListInd);
                continue;
            }
            if (Que.Count > 0 && Ins_PQueue_Arr.Count() > 0) {
                long Time1 = mABCInfoList[Que.Peek()].A;
                long Time2 = Ins_PQueue_Arr.Peek().SortKey;

                if (Time1 < Time2 && Ninzuu + mABCInfoList[Que.Peek()].C <= K) {
                    ExecNyuuten(Que.Peek());
                }
                else {
                    ExecTaiten(Ins_PQueue_Arr.Peek().ListInd);
                }
                continue;
            }
        }

        foreach (var EachPair in AnswerDict.OrderBy(pX => pX.Key)) {
            Console.WriteLine(EachPair.Value);
        }
    }
}

#region PQueue_Arr
// 内部で配列使用の優先度付きキュー (根のSortKeyが最小)
internal class PQueue_Arr
{
    internal struct PQueueJyoutaiDef
    {
        internal int ListInd;
        internal long SortKey;
    }

    private PQueueJyoutaiDef[] mHeapArr;
    private long mHeapArrCnt = 0;

    // コンストラクタ
    internal PQueue_Arr()
    {
        mHeapArr = new PQueueJyoutaiDef[65535];
    }

    internal bool IsEmpty()
    {
        return mHeapArrCnt == 0;
    }

    internal long Count()
    {
        return mHeapArrCnt;
    }

    internal PQueueJyoutaiDef Peek()
    {
        return mHeapArr[1];
    }

    // エンキュー処理
    internal void Enqueue(PQueueJyoutaiDef pAddJyoutai)
    {
        long CurrNode = 1 + mHeapArrCnt;
        if (mHeapArr.GetUpperBound(0) < CurrNode) {
            ExtendArr();
        }

        mHeapArr[CurrNode] = pAddJyoutai;
        mHeapArrCnt++;

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

            CurrNode /= 2;
        }
    }

    // 配列のExtend
    private void ExtendArr()
    {
        PQueueJyoutaiDef[] NewHeapArr = new PQueueJyoutaiDef[mHeapArrCnt * 2];
        mHeapArr.CopyTo(NewHeapArr, 0);
        mHeapArr = NewHeapArr;
    }

    // デキュー処理
    internal PQueueJyoutaiDef Dequeue()
    {
        PQueueJyoutaiDef TopNode = mHeapArr[1];
        long LastNode = mHeapArrCnt;
        mHeapArr[1] = mHeapArr[LastNode];
        mHeapArrCnt--;

        MinHeapify(1);
        return TopNode;
    }

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

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

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

        if (Left <= mHeapArrCnt && mHeapArr[Left].SortKey < Smallest) {
            Smallest = mHeapArr[Left].SortKey;
            SmallestNode = Left;
        }
        if (Right <= mHeapArrCnt && mHeapArr[Right].SortKey < Smallest) {
            Smallest = mHeapArr[Right].SortKey;
            SmallestNode = Right;
        }

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

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

解説

入店の待ち行列と
退店のプライオリティキューを用意し、
Actionデリゲートで入店と退店を行ってます。