#355254 (C#(csc)) No.844 split game

• 問題: No.844 split game
• ユーザー: claw88
• 提出日時: 2019-06-28 23:11:45
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 308 ms / 2,000 ms
• コード長: 7,297 bytes
• コンパイル時間: 2,834 ms
• コンパイル使用メモリ: 114,240 KB
• 実行使用メモリ: 37,744 KB
• 最終ジャッジ日時: 2023-09-14 22:39:17
• 合計ジャッジ時間: 13,733 ms
• ジャッジサーバーID （参考情報）: judge12 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	162 ms; 33,548 KB
testcase_01	AC	137 ms; 30,064 KB
testcase_02	AC	276 ms; 35,408 KB
testcase_03	AC	212 ms; 34,276 KB
testcase_04	AC	142 ms; 31,224 KB
testcase_05	AC	282 ms; 34,456 KB
testcase_06	AC	131 ms; 30,620 KB
testcase_07	AC	116 ms; 31,516 KB
testcase_08	AC	98 ms; 26,496 KB
testcase_09	AC	236 ms; 32,936 KB
testcase_10	AC	297 ms; 36,208 KB
testcase_11	AC	287 ms; 36,704 KB
testcase_12	AC	234 ms; 32,836 KB
testcase_13	AC	168 ms; 28,568 KB
testcase_14	AC	161 ms; 27,676 KB
testcase_15	AC	308 ms; 37,540 KB
testcase_16	AC	308 ms; 37,644 KB
testcase_17	AC	308 ms; 35,588 KB
testcase_18	AC	303 ms; 37,736 KB
testcase_19	AC	308 ms; 37,580 KB
testcase_20	AC	305 ms; 35,692 KB
testcase_21	AC	307 ms; 37,608 KB
testcase_22	AC	306 ms; 37,744 KB
testcase_23	AC	74 ms; 21,732 KB
testcase_24	AC	85 ms; 21,828 KB
testcase_25	AC	79 ms; 21,892 KB
testcase_26	AC	73 ms; 21,672 KB
testcase_27	AC	82 ms; 19,848 KB
testcase_28	AC	72 ms; 21,796 KB
testcase_29	AC	82 ms; 21,872 KB
testcase_30	AC	86 ms; 21,860 KB
testcase_31	AC	83 ms; 21,884 KB
testcase_32	AC	71 ms; 21,748 KB
testcase_33	AC	91 ms; 23,796 KB
testcase_34	AC	82 ms; 23,940 KB
testcase_35	AC	97 ms; 23,928 KB
testcase_36	AC	86 ms; 25,928 KB
testcase_37	AC	111 ms; 26,848 KB
testcase_38	AC	155 ms; 30,532 KB
testcase_39	AC	248 ms; 31,940 KB
testcase_40	AC	116 ms; 28,484 KB
testcase_41	AC	68 ms; 23,824 KB
testcase_42	AC	67 ms; 22,004 KB
testcase_43	AC	67 ms; 21,820 KB
testcase_44	AC	67 ms; 19,796 KB
testcase_45	AC	68 ms; 21,932 KB
testcase_46	AC	68 ms; 21,792 KB
testcase_47	AC	67 ms; 21,796 KB
testcase_48	AC	69 ms; 23,776 KB
testcase_49	AC	67 ms; 21,880 KB
testcase_50	AC	67 ms; 21,720 KB
testcase_51	AC	68 ms; 21,720 KB
testcase_52	AC	68 ms; 21,760 KB
testcase_53	AC	68 ms; 19,836 KB
testcase_54	AC	67 ms; 21,800 KB
testcase_55	AC	69 ms; 23,920 KB
testcase_56	AC	69 ms; 21,812 KB
testcase_57	AC	68 ms; 21,808 KB
testcase_58	AC	68 ms; 23,916 KB
testcase_59	AC	69 ms; 23,932 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }


    class Edge : IComparable<Edge>
    {
        public int from, to, id; public long cost;
        public Edge(int from, int to, long cost, int id = -1)
        {
            this.from = from;
            this.to = to;
            this.cost = cost;
            this.id = id;
        }
        public int CompareTo(Edge e) => cost.CompareTo(e.cost);
    }


    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;
        var A = cin.nextlong;
        var E = new Edge[M];
        for (int i = 0; i < M; i++)
        {
            E[i] = new Edge(cin.nextint - 1, cin.nextint, cin.nextlong);
        }

        E = E.OrderBy(i => i.to).ThenBy(i => i.from).ToArray();

        var dp = new long[N + 1];
        for (int i = 0; i < dp.Length; i++)
        {
            dp[i] = long.MinValue / 3;
        }
        var S = new SegTree<long>(N + 1, Max, long.MinValue / 3);
        dp[0] = 0;
        S.Update(0, 0);

        foreach (var e in E)
        {
            int L = e.from;
            int R = e.to;
            long P = e.cost;

            if (L == 0 && R == N)
            {
                chmax(ref dp[R], P);
            }
            if (R == N)
            {
                chmax(ref dp[R], S[0, L] - A + P);
                chmax(ref dp[R], dp[L] + P);
            }
            else if (L == 0)
            {
                chmax(ref dp[R], P - A);
            }
            else
            {
                chmax(ref dp[R], S[0, L] - 2 * A + P);
                chmax(ref dp[R], dp[L] - A + P);
            }

            S.Update(R, dp[R]);

            //WriteLine();
            //dp.join();
            //S.Items.join();
            //WriteLine();
        }

        WriteLine(S[0, N]);
    }

}

/// <OriginalAuthor>riantkb</OriginalAuthor>
class SegTree<T>
{
    readonly int n;
    int s, t;
    T[] tr;
    readonly Func<T, T, T> f;
    readonly T exnum;

    /// <summary>
    ///  セグメントツリーの構築1
    /// </summary>
    /// <param name="m">要素数</param>
    /// <param name="f">マージ関数</param>
    /// <param name="ex">単位元</param>
    public SegTree(int m, Func<T, T, T> f, T ex)
    {
        this.f = f; exnum = ex; n = 1;
        while (n < m) n <<= 1;
        tr = new T[(n << 1) - 1];
        for (int i = 0; i < tr.Length; i++) tr[i] = ex;
    }
    public SegTree(int m, Func<T, T, T> f, T ex, T ini) : this(m, f, ex)
    {
        for (int i = 0; i < m; i++) Assign(i, ini);
        All_Update();
    }
    public SegTree(int m, Func<T, T, T> f, T ex, IList<T> ini) : this(m, f, ex)
    {
        for (int i = 0; i < m; i++) Assign(i, ini[i]);
        All_Update();
    }
    public T Look(int j) => tr[j + n - 1];
    public T Peek() => tr[0];


    /// <summary>
    /// 最下層に値の代入
    /// </summary>
    /// <param name="j">代入するインデックス</param>
    /// <param name="x">代入する値</param>
    public void Assign(int j, T x) => tr[j + n - 1] = x;
    public void Update(int j, T x)
    {
        Assign(j, x);
        Update(j);
    }
    public void Update(int j)
    {
        int i = j + n - 1;
        while (i > 0) { i = i - 1 >> 1; tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    }
    public void All_Update() { for (int i = n - 2; i >= 0; i--) tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    /// <summary>
    /// return node[s, t] 区間クエリ
    /// </summary>
    /// <param name="s">左端 0-indexed</param>
    /// <param name="t">右端 0-indexed</param>
    /// <returns>node[s, t]</returns>
    public T this[int s, int t] => Run(s, t);
    T Run(int s, int t) { t++; this.s = s; this.t = t; return Query(0, 0, n); }
    T Query(int k, int l, int r) => r <= s || t <= l ? exnum : s <= l && r <= t ? tr[k]
                              : f(Query(k << 1 | 1, l, l + r >> 1), Query(k + 1 << 1, l + r >> 1, r));
    public T[] Items
    {
        get
        {
            var ret = new T[n];
            for (int i = 0; i < ret.Length; i++)
            {
                ret[i] = Run(i, i);
            }
            return ret;
        }
    }

}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}