結果
問題 | No.1037 exhausted |
ユーザー | 37zigen |
提出日時 | 2020-05-13 12:55:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 183 ms / 2,000 ms |
コード長 | 3,296 bytes |
コンパイル時間 | 2,304 ms |
コンパイル使用メモリ | 77,696 KB |
実行使用メモリ | 75,576 KB |
最終ジャッジ日時 | 2024-09-14 15:34:21 |
合計ジャッジ時間 | 5,914 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,148 KB |
testcase_01 | AC | 51 ms
36,292 KB |
testcase_02 | AC | 50 ms
36,620 KB |
testcase_03 | AC | 51 ms
36,428 KB |
testcase_04 | AC | 52 ms
36,080 KB |
testcase_05 | AC | 51 ms
36,620 KB |
testcase_06 | AC | 52 ms
36,516 KB |
testcase_07 | AC | 52 ms
36,196 KB |
testcase_08 | AC | 51 ms
36,596 KB |
testcase_09 | AC | 51 ms
36,328 KB |
testcase_10 | AC | 51 ms
36,404 KB |
testcase_11 | AC | 51 ms
36,552 KB |
testcase_12 | AC | 180 ms
75,476 KB |
testcase_13 | AC | 181 ms
75,180 KB |
testcase_14 | AC | 178 ms
75,344 KB |
testcase_15 | AC | 183 ms
74,788 KB |
testcase_16 | AC | 179 ms
75,352 KB |
testcase_17 | AC | 178 ms
75,392 KB |
testcase_18 | AC | 182 ms
75,424 KB |
testcase_19 | AC | 180 ms
75,148 KB |
testcase_20 | AC | 171 ms
75,500 KB |
testcase_21 | AC | 182 ms
75,576 KB |
testcase_22 | AC | 158 ms
75,412 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main{ public static void main(String[] args) { new Main().run(); } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int V=sc.nextInt(); int L=sc.nextInt(); int[] x=new int[N+2]; int[] v=new int[N+2]; int[] w=new int[N+2]; for (int i=0;i<N;++i) { x[i+1]=sc.nextInt(); v[i+1]=sc.nextInt(); w[i+1]=sc.nextInt(); v[i+1]=Math.min(v[i+1], V); } x[N+1]=L; long[][] dp=new long[N+2][V+1]; long INF=Long.MAX_VALUE/3; for (int i=0;i<dp.length;++i) { for (int j=0;j<dp[i].length;++j) { dp[i][j]=INF; } } dp[0][V]=0; for (int i=0;i<N+1;++i) { if (i!=0) for (int j=V-1;j>=0;--j) { int nj=Math.min(V, j+v[i]); dp[i][nj]=Math.min(dp[i][nj], dp[i][j]+w[i]); } for (int j=x[i+1]-x[i];j<=V;++j) { int nj=j-(x[i+1]-x[i]); dp[i+1][nj]=Math.min(dp[i+1][nj], dp[i][j]); } } long ans=INF; for (int i=0;i<=V;++i) ans=Math.min(ans, dp[N+1][i]); System.out.println(ans==INF?-1:ans); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }