結果
| 問題 | No.288 貯金箱の仕事 |
| ユーザー |
 uwi
|
| 提出日時 | 2015-10-09 23:13:41 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,454 bytes |
| コンパイル時間 | 4,672 ms |
| コンパイル使用メモリ | 89,736 KB |
| 実行使用メモリ | 38,352 KB |
| 最終ジャッジ日時 | 2024-07-20 04:34:00 |
| 合計ジャッジ時間 | 9,406 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 52 WA * 1 |
ソースコード
package contest;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayDeque;import java.util.Arrays;import java.util.Deque;import java.util.InputMismatchException;public class Q333 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();long m = nl();int[] a = na(n);long[] K = new long[n];for(int i= 0;i < n;i++)K[i] = nl();long all = 0;for(int i = 0;i < n;i++)all += K[i] * a[i];if(all < m){out.println(-1);return;}long rem = all - m;int[] rep2 = representable2(a);int[] rep = representable(a);int lim = rep[(int)(rem%a[n-1])];if(rem/a[n-1] >= lim){out.println(rep2[(int)(rem%a[n-1])] + rem/a[n-1]);}else{out.println(-1);}}public static int[] representable2(int[] a){int n = a.length;Deque<Integer> q = new ArrayDeque<Integer>();int[] d = new int[a[n-1]];Arrays.fill(d, Integer.MAX_VALUE);d[0] = 0;q.add(0);while(!q.isEmpty()){int cur = q.pollFirst();for(int i = 0;i < n-1;i++){if(cur+a[i] >= a[n-1]){int nex = cur+a[i]-a[n-1];if(d[nex] > d[cur]){d[nex] = d[cur];q.addFirst(nex);}}else{int nex = cur+a[i];if(d[nex] > d[cur]+1){d[nex] = d[cur]+1;q.addLast(nex);}}}}return d;}public static int[] representable(int[] a){int n = a.length;Deque<Integer> q = new ArrayDeque<Integer>();int[] d = new int[a[n-1]];Arrays.fill(d, Integer.MAX_VALUE);d[0] = 0;q.add(0);while(!q.isEmpty()){int cur = q.pollFirst();for(int i = 0;i < n-1;i++){if(cur+a[i] >= a[n-1]){int nex = cur+a[i]-a[n-1];if(d[nex] > d[cur] + 1){d[nex] = d[cur] + 1;q.addLast(nex);}}else{int nex = cur+a[i];if(d[nex] > d[cur]){d[nex] = d[cur];q.addFirst(nex);}}}}return d;}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");}public static void main(String[] args) throws Exception { new Q333().run(); }private byte[] inbuf = new byte[1024];private 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 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[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private int ni(){int num = 0, 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 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)); }}