結果
問題 | No.1037 exhausted |
ユーザー |
|
提出日時 | 2020-04-24 21:40:24 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 136 ms / 2,000 ms |
コード長 | 3,796 bytes |
コンパイル時間 | 3,900 ms |
コンパイル使用メモリ | 85,740 KB |
実行使用メモリ | 42,936 KB |
最終ジャッジ日時 | 2024-10-15 02:35:33 |
合計ジャッジ時間 | 6,774 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
package contest200424;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class E {InputStream is;PrintWriter out;String INPUT = "";void solve(){// 0 Lint n = ni(), V = ni(), L = ni();long[] dp = new long[V+1];long I = Long.MAX_VALUE / 3;Arrays.fill(dp, I);dp[V] = 0;int pre = 0;for(int i = 0;i < n;i++){int x = ni(), v = ni(), w = ni();int run = x - pre;long[] ndp = new long[V+1];Arrays.fill(ndp, I);for(int j = run;j <= V;j++){ndp[j-run] = Math.min(ndp[j-run], dp[j]);int nj = Math.min(V, j-run+v);ndp[nj] = Math.min(ndp[nj], dp[j] + w);}dp = ndp;pre = x;}int run = L-pre;{long[] ndp = new long[V+1];Arrays.fill(ndp, I);for(int j = run;j <= V;j++){ndp[j-run] = Math.min(ndp[j-run], dp[j]);}dp = ndp;}long ans = I;for(int j = 0;j <= V;j++){ans = Math.min(ans, dp[j]);}out.println(ans < I ? ans : -1);}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 E().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)); }}