AOJ 2502 VOCAL ANDROID

問題へのリンク

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("3");
            WillReturn.Add("4 5 15");
            WillReturn.Add("2 3 4");
            WillReturn.Add("7 8 39");
            WillReturn.Add("2");
            WillReturn.Add("6");
            WillReturn.Add("8");
            //19
            //39
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("1");
            WillReturn.Add("2 3 10");
            WillReturn.Add("2");
            WillReturn.Add("3");
            WillReturn.Add("1");
            //-1
        }
        else if (InputPattern == "Input3") {
            WillReturn = System.IO.File.ReadAllLines(@"D:\CSharp\TestConsole\in.txt").ToList();
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    struct PhraseInfoDef
    {
        internal int Kagen;
        internal int Jyougen;
        internal int Score;
    }
    static List<PhraseInfoDef> mPhraseInfoList = new List<PhraseInfoDef>();

    static void Main()
    {
        var sw = System.Diagnostics.Stopwatch.StartNew();
        List<string> InputList = GetInputList();

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

        int N = int.Parse(InputList[0]);

        foreach (string EachStr in InputList.Skip(1).Take(N)) {
            SplitAct(EachStr);
            PhraseInfoDef WillAdd;
            WillAdd.Kagen = wkArr[0];
            WillAdd.Jyougen = wkArr[1];
            WillAdd.Score = wkArr[2];
            mPhraseInfoList.Add(WillAdd);
        }

        int[] WArr = InputList.Skip(1 + N + 1).Select(pX => int.Parse(pX)).ToArray();
        int WMax = WArr.Max();
        int UB = WMax;

        // 最大スコア[時間の総和]
        var InsSegmentTree = new SegmentTree(UB, long.MinValue);
        InsSegmentTree[0] = 0;

        foreach (long EachInd in InsSegmentTree.GetNodeIndEnum()) {
            foreach (PhraseInfoDef EachPhraseInfo in mPhraseInfoList) {
                long RangeSta = EachInd - EachPhraseInfo.Jyougen;
                long RangeEnd = EachInd - EachPhraseInfo.Kagen;
                if (RangeEnd < 0) continue;
                RangeSta = Math.Max(0, RangeSta);

                long NewVal = InsSegmentTree.Internal_Query(RangeSta, RangeEnd);
                NewVal += EachPhraseInfo.Score;
                if (NewVal < 0) continue;

                long CurrVal = InsSegmentTree[EachInd];
                NewVal = Math.Max(NewVal, CurrVal);

                InsSegmentTree[EachInd] = NewVal;
            }
        }

        bool HasAnswer = true;

        foreach (int EachW in WArr) {
            long CurrVal = InsSegmentTree[EachW];
            if (CurrVal < 0) {
                HasAnswer = false;
            }
        }

        if (HasAnswer == false) {
            Console.WriteLine(-1);
            return;
        }

        var sb = new System.Text.StringBuilder();
        foreach (int EachW in WArr) {
            long CurrVal = InsSegmentTree[EachW];
            sb.Append(CurrVal);
            sb.AppendLine();
        }
        Console.Write(sb.ToString());
    }
}

#region SegmentTree
// SegmentTreeクラス (RMaxQ and 1点更新)
internal class SegmentTree
{
    private long[] mTreeNodeArr;
    private long UB; // 木のノードの配列のUB
    private long mLeafCnt; // 葉ノードの数
    private long mExternalArrUB;

    // ノードの添字を引数とし、範囲の開始添字と終了添字を持つ配列
    private struct RangeInfoDef
    {
        internal long StaInd;
        internal long EndInd;
    }
    private RangeInfoDef[] mRangeInfo;

    // ノードのIndexの列挙を返す
    internal IEnumerable<long> GetNodeIndEnum()
    {
        for (long I = 0; I <= mExternalArrUB; I++) {
            yield return I;
        }
    }

    // 木のノードのUBを返す
    internal long GetUB()
    {
        return mExternalArrUB;
    }

    // コンストラクタその1
    // 引数1 外部IndのUB
    // 引数2 単位元
    internal SegmentTree(long pExternalArrUB, long pInitVal)
    {
        mExternalArrUB = pExternalArrUB;

        ConstructorTreeInit();

        // すべての値をpInitValに
        for (long I = 0; I <= UB; I++) {
            mTreeNodeArr[I] = pInitVal;
        }
    }

    // コンストラクタその2
    // 引数1 初期化用の配列
    // 引数2 単位元
    internal SegmentTree(long[] pInitArr, long pInitVal)
    {
        mExternalArrUB = pInitArr.GetUpperBound(0);

        ConstructorTreeInit();

        // すべての値をpInitValに
        for (long I = 0; I <= UB; I++) {
            mTreeNodeArr[I] = pInitVal;
        }

        for (long I = 0; I <= pInitArr.GetUpperBound(0); I++) {
            long TreeNode = DeriveTreeNode(I);
            mTreeNodeArr[TreeNode] = pInitArr[I];
        }

        // 木DPの要領で、葉から根に伝播
        ExecTreeDP();
    }

    // コンストラクタその3
    // 引数1 初期化用のList
    // 引数2 単位元
    internal SegmentTree(List<long> pInitList, long pInitVal)
    {
        mExternalArrUB = pInitList.Count - 1;

        ConstructorTreeInit();

        // すべての値をpInitValに
        for (long I = 0; I <= UB; I++) {
            mTreeNodeArr[I] = pInitVal;
        }

        for (long I = 0; I <= pInitList.Count - 1; I++) {
            long TreeNode = DeriveTreeNode(I);
            mTreeNodeArr[TreeNode] = pInitList[(int)I];
        }

        // 木DPの要領で、葉から根に伝播
        ExecTreeDP();
    }

    // コンストラクタのヘルパメソッド(木の初期化)
    private void ConstructorTreeInit()
    {
        // 簡単のため、葉ノード数を2のべき乗に
        long ArrLength = 0;
        for (long I = 1; I < long.MaxValue; I *= 2) {
            ArrLength += I;
            mLeafCnt = I;

            if (mExternalArrUB + 1 < mLeafCnt) break;
        }

        UB = ArrLength - 1;
        mTreeNodeArr = new long[UB + 1];

        // ノードの添字を引数とし、範囲の開始添字と終了添字を持つ配列の作成
        mRangeInfo = new RangeInfoDef[UB + 1];
        for (long I = 0; I <= UB; I++) {
            if (I == 0) {
                RangeInfoDef WillSet1;
                WillSet1.StaInd = 0;
                WillSet1.EndInd = mLeafCnt - 1;
                mRangeInfo[I] = WillSet1;
                continue;
            }
            long ParentNode = DeriveParentNode(I);
            RangeInfoDef ParentRangeInfo = mRangeInfo[ParentNode];

            RangeInfoDef WillSet2;
            long Mid = (ParentRangeInfo.StaInd + ParentRangeInfo.EndInd) / 2;

            if (I % 2 == 1) { // 奇数ノードの場合
                WillSet2.StaInd = ParentRangeInfo.StaInd;
                WillSet2.EndInd = Mid;
            }
            else { // 偶数ノードの場合
                WillSet2.StaInd = Mid + 1;
                WillSet2.EndInd = ParentRangeInfo.EndInd;
            }
            mRangeInfo[I] = WillSet2;
        }
    }

    // 木DPの要領で、葉から根に伝播
    private void ExecTreeDP()
    {
        for (long I = UB; 0 < I; I--) {
            long SendNode = DeriveParentNode(I);
            mTreeNodeArr[SendNode] = Math.Max(mTreeNodeArr[SendNode], mTreeNodeArr[I]);
        }
    }

    // インデクサ
    internal long this[long pInd]
    {
        get
        {
            long CurrNode = DeriveTreeNode(pInd);
            return mTreeNodeArr[CurrNode];
        }
        set { Update(pInd, value); }
    }

    // 親ノードの添字を取得
    private long DeriveParentNode(long pTarget)
    {
        return (pTarget - 1) / 2;
    }

    // 子ノードの添字(小さいほう)を取得
    private long DeriveChildNode(long pTarget)
    {
        return pTarget * 2 + 1;
    }

    // 葉ノードの配列の添字を木の添字に変換して返す
    private long DeriveTreeNode(long pLeafArrInd)
    {
        long BaseInd = UB - mLeafCnt + 1;
        return BaseInd + pLeafArrInd;
    }

    // 葉ノードの配列のK番目の値をNewValに変更
    internal void Update(long pK, long pNewVal)
    {
        long CurrNode = DeriveTreeNode(pK);
        mTreeNodeArr[CurrNode] = pNewVal;

        // 登りながら更新
        while (CurrNode > 0) {
            CurrNode = DeriveParentNode(CurrNode);
            long ChildNode1 = DeriveChildNode(CurrNode);
            long ChildNode2 = ChildNode1 + 1;
            mTreeNodeArr[CurrNode] =
                Math.Max(mTreeNodeArr[ChildNode1], mTreeNodeArr[ChildNode2]);
        }
    }

    // 開始添字と終了添字とカレントノードを引数として、最大値を返す
    internal long Internal_Query(long pSearchStaInd, long pSearchEndInd)
    {
        return Private_Query(pSearchStaInd, pSearchEndInd, 0);
    }
    private long Private_Query(long pSearchStaInd, long pSearchEndInd, long pCurrNode)
    {
        long CurrNodeStaInd = mRangeInfo[pCurrNode].StaInd;
        long CurrNodeEndInd = mRangeInfo[pCurrNode].EndInd;

        // OverLapしてなければ、long.MinValue
        if (CurrNodeEndInd < pSearchStaInd || pSearchEndInd < CurrNodeStaInd)
            return long.MinValue;

        // 完全に含んでいれば、このノードの値
        if (pSearchStaInd <= CurrNodeStaInd && CurrNodeEndInd <= pSearchEndInd)
            return mTreeNodeArr[pCurrNode];

        // そうでなければ、2つの子の最大値
        long ChildNode1 = DeriveChildNode(pCurrNode);
        long ChildNode2 = ChildNode1 + 1;

        long ChildVal1 = Private_Query(pSearchStaInd, pSearchEndInd, ChildNode1);
        long ChildVal2 = Private_Query(pSearchStaInd, pSearchEndInd, ChildNode2);
        return Math.Max(ChildVal1, ChildVal2);
    }
}
#endregion

解説

1点更新区間最大値取得なセグ木を用意して、貰うDPで解いてます。