結果

問題 No.844 split game
ユーザー kusomushikusomushi
提出日時 2019-07-24 21:52:59
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,286 bytes
コンパイル時間 2,435 ms
コンパイル使用メモリ 80,956 KB
実行使用メモリ 60,676 KB
最終ジャッジ日時 2024-06-28 12:21:12
合計ジャッジ時間 17,504 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 260 ms
48,612 KB
testcase_01 AC 243 ms
50,716 KB
testcase_02 AC 336 ms
52,732 KB
testcase_03 AC 297 ms
51,696 KB
testcase_04 AC 231 ms
46,448 KB
testcase_05 AC 378 ms
56,264 KB
testcase_06 AC 234 ms
47,212 KB
testcase_07 AC 214 ms
48,980 KB
testcase_08 AC 184 ms
43,604 KB
testcase_09 WA -
testcase_10 AC 364 ms
54,528 KB
testcase_11 AC 397 ms
56,424 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 267 ms
50,380 KB
testcase_15 AC 424 ms
57,716 KB
testcase_16 AC 414 ms
57,260 KB
testcase_17 WA -
testcase_18 AC 434 ms
57,352 KB
testcase_19 AC 419 ms
57,420 KB
testcase_20 AC 437 ms
59,628 KB
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 136 ms
40,344 KB
testcase_24 AC 157 ms
42,732 KB
testcase_25 AC 144 ms
40,508 KB
testcase_26 AC 134 ms
40,152 KB
testcase_27 WA -
testcase_28 AC 105 ms
38,900 KB
testcase_29 AC 151 ms
42,256 KB
testcase_30 AC 157 ms
42,376 KB
testcase_31 AC 155 ms
41,776 KB
testcase_32 AC 107 ms
38,900 KB
testcase_33 AC 160 ms
43,636 KB
testcase_34 AC 144 ms
41,408 KB
testcase_35 AC 172 ms
43,556 KB
testcase_36 AC 149 ms
41,820 KB
testcase_37 AC 186 ms
43,500 KB
testcase_38 AC 235 ms
44,716 KB
testcase_39 AC 303 ms
46,804 KB
testcase_40 AC 203 ms
45,852 KB
testcase_41 AC 55 ms
36,848 KB
testcase_42 AC 53 ms
36,712 KB
testcase_43 AC 54 ms
36,488 KB
testcase_44 AC 56 ms
37,048 KB
testcase_45 AC 54 ms
37,144 KB
testcase_46 AC 54 ms
36,980 KB
testcase_47 AC 54 ms
36,448 KB
testcase_48 WA -
testcase_49 AC 55 ms
36,920 KB
testcase_50 AC 55 ms
37,020 KB
testcase_51 AC 54 ms
36,504 KB
testcase_52 WA -
testcase_53 AC 53 ms
36,712 KB
testcase_54 AC 55 ms
37,140 KB
testcase_55 AC 55 ms
36,936 KB
testcase_56 AC 54 ms
37,116 KB
testcase_57 AC 55 ms
36,704 KB
testcase_58 AC 56 ms
36,500 KB
testcase_59 AC 56 ms
37,244 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {

    static int N, M, A;
    static int[] L, R, P;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        N = sc.nextInt();
        M = sc.nextInt();
        A = sc.nextInt();
        L = new int[M];
        R = new int[M];
        P = new int[M];
        for (int i = 0; i < M; i++) {
            L[i] = sc.nextInt();
            R[i] = sc.nextInt();
            P[i] = sc.nextInt();
        }

        System.out.println(solve());
    }

    static long solve() {
        List<int[]>[] C = new List[N+1];
        for (int i = 1; i <= N; i++) {
            C[i] = new ArrayList<>();
        }
        for (int i = 0; i < M; i++) {
            C[R[i]].add( new int[]{L[i], R[i], P[i]} );
        }

        long[] sep = new long[N+1];
        long[] notSep = new long[N+1];

        for (int i = 1; i <= N; i++) {
            sep[i] = notSep[i-1] - A;
            notSep[i] = Math.max(sep[i-1], notSep[i-1]);
            for (int[] range : C[i]) {
                int l = range[0];
                int r = range[1];
                int p = range[2];

                sep[i] = Math.max(sep[i], sep[l-1] + p - (i==N ? 0 : A));
            }
        }

        return Math.max(sep[N], notSep[N]);
    }

    @SuppressWarnings("unused")
    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

        String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken("\n");
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        int[] nextIntArray(int n, int delta) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt() + delta;
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
    }

    static void writeLines(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int a : as) pw.println(a);
        pw.flush();
    }

    static void writeLines(long[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (long a : as) pw.println(a);
        pw.flush();
    }

    static void writeSingleLine(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < as.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(as[i]);
        }
        pw.println();
        pw.flush();
    }

    static int max(int... as) {
        int max = Integer.MIN_VALUE;
        for (int a : as) max = Math.max(a, max);
        return max;
    }

    static int min(int... as) {
        int min = Integer.MAX_VALUE;
        for (int a : as) min = Math.min(a, min);
        return min;
    }

    static void debug(Object... args) {
        StringJoiner j = new StringJoiner(" ");
        for (Object arg : args) {
            if (arg == null) j.add("null");
            else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
            else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
            else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
            else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
            else j.add(arg.toString());
        }
        System.err.println(j.toString());
    }

    static void printSingleLine(int[] array) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < array.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(array[i]);
        }
        pw.println();
        pw.flush();
    }

    static int lowerBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] < value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }

    static int upperBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] <= value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }
}
0