結果
問題 | No.844 split game |
ユーザー | kusomushi |
提出日時 | 2019-07-24 21:55:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 397 ms / 2,000 ms |
コード長 | 5,306 bytes |
コンパイル時間 | 2,332 ms |
コンパイル使用メモリ | 80,812 KB |
実行使用メモリ | 68,656 KB |
最終ジャッジ日時 | 2024-06-28 12:24:54 |
合計ジャッジ時間 | 15,778 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 245 ms
61,860 KB |
testcase_01 | AC | 231 ms
62,164 KB |
testcase_02 | AC | 319 ms
62,816 KB |
testcase_03 | AC | 279 ms
62,692 KB |
testcase_04 | AC | 218 ms
57,632 KB |
testcase_05 | AC | 354 ms
64,996 KB |
testcase_06 | AC | 224 ms
57,876 KB |
testcase_07 | AC | 204 ms
60,068 KB |
testcase_08 | AC | 183 ms
55,456 KB |
testcase_09 | AC | 300 ms
58,676 KB |
testcase_10 | AC | 347 ms
63,496 KB |
testcase_11 | AC | 361 ms
65,188 KB |
testcase_12 | AC | 298 ms
58,596 KB |
testcase_13 | AC | 242 ms
56,068 KB |
testcase_14 | AC | 241 ms
61,216 KB |
testcase_15 | AC | 397 ms
68,656 KB |
testcase_16 | AC | 376 ms
67,812 KB |
testcase_17 | AC | 375 ms
68,412 KB |
testcase_18 | AC | 372 ms
67,612 KB |
testcase_19 | AC | 393 ms
68,496 KB |
testcase_20 | AC | 384 ms
67,272 KB |
testcase_21 | AC | 366 ms
67,804 KB |
testcase_22 | AC | 382 ms
67,832 KB |
testcase_23 | AC | 133 ms
52,448 KB |
testcase_24 | AC | 143 ms
54,984 KB |
testcase_25 | AC | 136 ms
52,368 KB |
testcase_26 | AC | 123 ms
52,564 KB |
testcase_27 | AC | 140 ms
54,300 KB |
testcase_28 | AC | 102 ms
51,380 KB |
testcase_29 | AC | 146 ms
55,120 KB |
testcase_30 | AC | 143 ms
54,904 KB |
testcase_31 | AC | 151 ms
54,600 KB |
testcase_32 | AC | 95 ms
51,432 KB |
testcase_33 | AC | 157 ms
55,172 KB |
testcase_34 | AC | 138 ms
54,036 KB |
testcase_35 | AC | 158 ms
55,248 KB |
testcase_36 | AC | 147 ms
54,624 KB |
testcase_37 | AC | 173 ms
55,312 KB |
testcase_38 | AC | 211 ms
55,544 KB |
testcase_39 | AC | 282 ms
58,652 KB |
testcase_40 | AC | 191 ms
57,392 KB |
testcase_41 | AC | 54 ms
50,224 KB |
testcase_42 | AC | 55 ms
50,380 KB |
testcase_43 | AC | 55 ms
50,484 KB |
testcase_44 | AC | 54 ms
50,432 KB |
testcase_45 | AC | 54 ms
50,276 KB |
testcase_46 | AC | 52 ms
50,336 KB |
testcase_47 | AC | 54 ms
50,480 KB |
testcase_48 | AC | 52 ms
49,888 KB |
testcase_49 | AC | 52 ms
50,204 KB |
testcase_50 | AC | 53 ms
50,280 KB |
testcase_51 | AC | 53 ms
50,112 KB |
testcase_52 | AC | 53 ms
50,464 KB |
testcase_53 | AC | 50 ms
50,232 KB |
testcase_54 | AC | 53 ms
50,484 KB |
testcase_55 | AC | 56 ms
50,560 KB |
testcase_56 | AC | 52 ms
50,456 KB |
testcase_57 | AC | 54 ms
50,168 KB |
testcase_58 | AC | 53 ms
50,472 KB |
testcase_59 | AC | 54 ms
50,156 KB |
ソースコード
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; } }