結果
問題 | No.844 split game |
ユーザー | uwi |
提出日時 | 2019-06-28 21:30:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 294 ms / 2,000 ms |
コード長 | 3,646 bytes |
コンパイル時間 | 3,682 ms |
コンパイル使用メモリ | 87,516 KB |
実行使用メモリ | 60,164 KB |
最終ジャッジ日時 | 2023-09-14 21:38:11 |
合計ジャッジ時間 | 14,943 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 154 ms
56,620 KB |
testcase_01 | AC | 138 ms
56,236 KB |
testcase_02 | AC | 259 ms
59,732 KB |
testcase_03 | AC | 183 ms
57,052 KB |
testcase_04 | AC | 135 ms
54,524 KB |
testcase_05 | AC | 229 ms
59,576 KB |
testcase_06 | AC | 132 ms
54,100 KB |
testcase_07 | AC | 121 ms
53,532 KB |
testcase_08 | AC | 107 ms
53,080 KB |
testcase_09 | AC | 197 ms
56,988 KB |
testcase_10 | AC | 229 ms
59,728 KB |
testcase_11 | AC | 233 ms
60,084 KB |
testcase_12 | AC | 189 ms
57,384 KB |
testcase_13 | AC | 150 ms
56,820 KB |
testcase_14 | AC | 148 ms
54,968 KB |
testcase_15 | AC | 247 ms
60,164 KB |
testcase_16 | AC | 268 ms
59,940 KB |
testcase_17 | AC | 243 ms
59,720 KB |
testcase_18 | AC | 244 ms
59,880 KB |
testcase_19 | AC | 246 ms
59,808 KB |
testcase_20 | AC | 294 ms
59,824 KB |
testcase_21 | AC | 245 ms
59,552 KB |
testcase_22 | AC | 246 ms
59,800 KB |
testcase_23 | AC | 56 ms
50,588 KB |
testcase_24 | AC | 77 ms
52,432 KB |
testcase_25 | AC | 65 ms
51,664 KB |
testcase_26 | AC | 52 ms
49,648 KB |
testcase_27 | AC | 76 ms
52,032 KB |
testcase_28 | AC | 49 ms
49,668 KB |
testcase_29 | AC | 85 ms
52,276 KB |
testcase_30 | AC | 76 ms
51,900 KB |
testcase_31 | AC | 76 ms
51,940 KB |
testcase_32 | AC | 49 ms
49,528 KB |
testcase_33 | AC | 82 ms
52,484 KB |
testcase_34 | AC | 78 ms
52,168 KB |
testcase_35 | AC | 100 ms
52,840 KB |
testcase_36 | AC | 81 ms
52,628 KB |
testcase_37 | AC | 108 ms
53,436 KB |
testcase_38 | AC | 141 ms
56,292 KB |
testcase_39 | AC | 196 ms
58,640 KB |
testcase_40 | AC | 118 ms
53,504 KB |
testcase_41 | AC | 43 ms
49,340 KB |
testcase_42 | AC | 43 ms
49,476 KB |
testcase_43 | AC | 44 ms
49,448 KB |
testcase_44 | AC | 44 ms
49,632 KB |
testcase_45 | AC | 43 ms
49,324 KB |
testcase_46 | AC | 43 ms
49,492 KB |
testcase_47 | AC | 43 ms
49,836 KB |
testcase_48 | AC | 44 ms
49,616 KB |
testcase_49 | AC | 44 ms
49,420 KB |
testcase_50 | AC | 44 ms
49,484 KB |
testcase_51 | AC | 44 ms
49,380 KB |
testcase_52 | AC | 43 ms
49,464 KB |
testcase_53 | AC | 44 ms
47,936 KB |
testcase_54 | AC | 44 ms
49,496 KB |
testcase_55 | AC | 49 ms
49,640 KB |
testcase_56 | AC | 44 ms
49,368 KB |
testcase_57 | AC | 44 ms
49,548 KB |
testcase_58 | AC | 45 ms
49,388 KB |
testcase_59 | AC | 44 ms
49,492 KB |
ソースコード
package contest190628; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(), A = ni(); long[] dp = new long[n+1]; int[][] rs = new int[m][]; for(int i = 0;i < m;i++){ rs[i] = new int[]{ni()-1, ni()-1, ni()}; } Arrays.sort(rs, new Comparator<int[]>() { public int compare(int[] a, int[] b) { return a[1] - b[1]; } }); long max = Long.MIN_VALUE / 2; Arrays.fill(dp, max); dp[0] = A; max = A; int p = 0; for(int i = 1;i <= n;i++){ long v = max; while(p < m && rs[p][1] <= i-1){ v = Math.max(v, dp[rs[p][0]] + rs[p][2]); p++; } dp[i] = v - A; max = Math.max(max, dp[i]); } out.println(dp[n]); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }