結果

問題 No.844 split game
ユーザー kusomushikusomushi
提出日時 2019-07-24 21:55:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 393 ms / 2,000 ms
コード長 5,306 bytes
コンパイル時間 2,529 ms
コンパイル使用メモリ 77,764 KB
実行使用メモリ 69,300 KB
最終ジャッジ日時 2023-09-10 21:20:31
合計ジャッジ時間 16,894 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 244 ms
59,800 KB
testcase_01 AC 220 ms
62,032 KB
testcase_02 AC 321 ms
65,596 KB
testcase_03 AC 283 ms
62,396 KB
testcase_04 AC 217 ms
57,596 KB
testcase_05 AC 345 ms
64,040 KB
testcase_06 AC 216 ms
57,440 KB
testcase_07 AC 189 ms
58,524 KB
testcase_08 AC 175 ms
55,320 KB
testcase_09 AC 294 ms
58,228 KB
testcase_10 AC 351 ms
66,468 KB
testcase_11 AC 356 ms
66,388 KB
testcase_12 AC 290 ms
58,492 KB
testcase_13 AC 249 ms
59,820 KB
testcase_14 AC 242 ms
60,624 KB
testcase_15 AC 386 ms
68,032 KB
testcase_16 AC 387 ms
67,976 KB
testcase_17 AC 384 ms
69,072 KB
testcase_18 AC 385 ms
68,008 KB
testcase_19 AC 393 ms
69,260 KB
testcase_20 AC 383 ms
69,060 KB
testcase_21 AC 391 ms
67,620 KB
testcase_22 AC 387 ms
69,300 KB
testcase_23 AC 110 ms
52,584 KB
testcase_24 AC 137 ms
54,892 KB
testcase_25 AC 123 ms
52,420 KB
testcase_26 AC 115 ms
53,080 KB
testcase_27 AC 133 ms
54,612 KB
testcase_28 AC 90 ms
51,016 KB
testcase_29 AC 135 ms
55,016 KB
testcase_30 AC 140 ms
54,868 KB
testcase_31 AC 141 ms
55,276 KB
testcase_32 AC 87 ms
51,552 KB
testcase_33 AC 148 ms
55,104 KB
testcase_34 AC 131 ms
54,760 KB
testcase_35 AC 152 ms
55,620 KB
testcase_36 AC 135 ms
54,880 KB
testcase_37 AC 166 ms
55,540 KB
testcase_38 AC 218 ms
55,612 KB
testcase_39 AC 296 ms
62,704 KB
testcase_40 AC 182 ms
55,848 KB
testcase_41 AC 45 ms
49,708 KB
testcase_42 AC 45 ms
49,344 KB
testcase_43 AC 45 ms
49,356 KB
testcase_44 AC 46 ms
49,324 KB
testcase_45 AC 46 ms
49,260 KB
testcase_46 AC 45 ms
49,424 KB
testcase_47 AC 45 ms
49,396 KB
testcase_48 AC 45 ms
49,336 KB
testcase_49 AC 46 ms
49,276 KB
testcase_50 AC 45 ms
49,264 KB
testcase_51 AC 46 ms
49,348 KB
testcase_52 AC 45 ms
49,328 KB
testcase_53 AC 45 ms
49,504 KB
testcase_54 AC 44 ms
49,464 KB
testcase_55 AC 46 ms
49,412 KB
testcase_56 AC 47 ms
49,508 KB
testcase_57 AC 46 ms
49,688 KB
testcase_58 AC 45 ms
49,516 KB
testcase_59 AC 47 ms
49,416 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] = Math.max(notSep[i-1], sep[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