結果

問題 No.844 split game
ユーザー claw88claw88
提出日時 2019-06-28 23:10:12
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 7,318 bytes
コンパイル時間 1,033 ms
コンパイル使用メモリ 120,064 KB
実行使用メモリ 39,660 KB
最終ジャッジ日時 2024-07-02 05:08:53
合計ジャッジ時間 9,297 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 128 ms
26,624 KB
testcase_01 AC 104 ms
26,752 KB
testcase_02 AC 238 ms
30,464 KB
testcase_03 AC 177 ms
29,440 KB
testcase_04 AC 105 ms
26,368 KB
testcase_05 WA -
testcase_06 AC 96 ms
25,344 KB
testcase_07 AC 80 ms
26,496 KB
testcase_08 WA -
testcase_09 AC 196 ms
27,904 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 197 ms
28,032 KB
testcase_13 AC 131 ms
25,856 KB
testcase_14 WA -
testcase_15 AC 265 ms
32,512 KB
testcase_16 AC 269 ms
32,512 KB
testcase_17 AC 266 ms
32,512 KB
testcase_18 AC 268 ms
32,384 KB
testcase_19 WA -
testcase_20 AC 266 ms
32,512 KB
testcase_21 AC 267 ms
32,512 KB
testcase_22 AC 269 ms
32,640 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 36 ms
19,580 KB
testcase_27 AC 47 ms
21,008 KB
testcase_28 AC 34 ms
19,352 KB
testcase_29 AC 45 ms
20,820 KB
testcase_30 AC 49 ms
21,196 KB
testcase_31 WA -
testcase_32 AC 35 ms
19,512 KB
testcase_33 AC 55 ms
21,804 KB
testcase_34 WA -
testcase_35 AC 62 ms
22,688 KB
testcase_36 AC 49 ms
21,248 KB
testcase_37 AC 76 ms
23,808 KB
testcase_38 AC 119 ms
25,600 KB
testcase_39 AC 212 ms
28,800 KB
testcase_40 AC 80 ms
25,216 KB
testcase_41 AC 32 ms
18,944 KB
testcase_42 AC 32 ms
19,072 KB
testcase_43 AC 31 ms
19,200 KB
testcase_44 AC 32 ms
18,944 KB
testcase_45 AC 31 ms
19,200 KB
testcase_46 AC 31 ms
19,072 KB
testcase_47 AC 31 ms
18,816 KB
testcase_48 AC 32 ms
19,200 KB
testcase_49 AC 32 ms
19,200 KB
testcase_50 AC 31 ms
18,688 KB
testcase_51 AC 32 ms
19,200 KB
testcase_52 AC 32 ms
19,200 KB
testcase_53 WA -
testcase_54 AC 30 ms
19,200 KB
testcase_55 AC 32 ms
19,200 KB
testcase_56 AC 33 ms
18,816 KB
testcase_57 AC 32 ms
19,200 KB
testcase_58 AC 32 ms
18,944 KB
testcase_59 AC 32 ms
19,200 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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;
        }
        var S = new SegTree<long>(N + 1, Max, long.MinValue);
        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);
                if(dp[L] > 0) 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);
                if (dp[L] > 0) 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);
}
0