結果
| 問題 |
No.288 貯金箱の仕事
|
| コンテスト | |
| ユーザー |
 tanzaku
|
| 提出日時 | 2015-10-12 01:20:19 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 145 ms / 2,000 ms |
| コード長 | 8,134 bytes |
| コンパイル時間 | 2,278 ms |
| コンパイル使用メモリ | 90,248 KB |
| 実行使用メモリ | 41,968 KB |
| 最終ジャッジ日時 | 2024-07-21 07:07:10 |
| 合計ジャッジ時間 | 7,367 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 53 |
ソースコード
import java.io.*;
import java.math.*;
import java.util.*;
import javax.management.RuntimeErrorException;
import static java.util.Arrays.*;
public class Main {
private static final int mod = (int)1e9+7;
final Random random = new Random(0);
final IOFast io = new IOFast();
/// MAIN CODE
public void run() throws IOException {
// int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
int n = io.nextInt();
long m = io.nextLong();
int[] A = io.nextIntArray(n);
long[] K = io.nextLongArray(n);
for(int i = 0; i < n; i++) m -= A[i] * K[i];
io.out.println(solve(A, -m));
}
}
// min Σ C[i] s.t. Σ A[i] * C[i] = X, A[i] >= 0, C[i] >= 0
long solve(final int[] A, final long X) {
if(X < 0) return -1;
Arrays.sort(A);
final int n = A.length;
final int maxElem = A[n - 1];
// final long[] minUseMaxElem = bfs01(A, 1);
// final long[] other = bfs01(A, 0);
// dump(minUseMaxElem, other, X / maxElem);
// if(minUseMaxElem[(int)(X%maxElem)] > X / maxElem) {
// return -1;
// }
// else {
// return other[(int)(X%maxElem)] + X / maxElem;
// }
final List<long[]> dps = func(A);
long ans = Long.MAX_VALUE;
for(int i = 0; i < dps.size() && X / maxElem - i >= 0; i++) {
final long[] cur = dps.get(i);
// dump(i, cur);
ans = Math.min(ans, X / maxElem - i + cur[(int)(X % maxElem)]);
// System.err.println(i + " " + X / maxElem + " " + cur[(int)(X % maxElem)]);
}
return ans >= Long.MAX_VALUE / 2 ? -1 : ans;
}
List<long[]> func(final int[] A) {
final int maxElem = A[A.length - 1];
final List<long[]> dps = new ArrayList<long[]>();
for(int i = 0; ; i++) {
final long[] dp = new long[maxElem];
if(i == 0) {
Arrays.fill(dp, Long.MAX_VALUE / 2);
dp[0] = 0;
}
else {
final long[] prev = dps.get(i-1);
for(int j = 0; j < maxElem; j++) {
dp[j] = Math.min(prev[j] + 1, Long.MAX_VALUE / 2);
}
}
for(int j = 0; j < maxElem; j++) {
for(int a : A) {
if(j >= a) {
dp[j] = Math.min(dp[j-a]+1, dp[j]);
}
else if(i != 0) {
final long[] prev = dps.get(i-1);
dp[j] = Math.min(prev[maxElem+j-a]+1, dp[j]);
}
}
}
dps.add(dp);
if(i != 0) {
final long[] prev = dps.get(i-1);
boolean ok = false;
for(int j = 0; j < maxElem; j++) {
if(dp[j] != Long.MAX_VALUE) {
ok |= dp[j] < prev[j];
// ok |= dp[j] - 1 < prev[j];
}
}
if(!ok) break;
}
}
return dps;
}
long[] bfs01(final int[] A, final int countMaxElem) {
final Deque<Integer> deq = new ArrayDeque<Integer>();
final int maxElem = A[A.length - 1];
final long[] dp = new long[maxElem];
Arrays.fill(dp, Long.MAX_VALUE);
dp[0] = 0;
deq.add(0);
while(!deq.isEmpty()) {
final int idx = deq.pollFirst();
for(int i = 0; i < A.length - 1; i++) {
int v = A[i] + idx;
if(v >= maxElem) {
v -= maxElem;
if(dp[v] > dp[idx] + countMaxElem) {
dp[v] = dp[idx] + countMaxElem;
if(countMaxElem == 0) { deq.addFirst(v); }
else { deq.addLast(v); }
}
}
else {
if(dp[v] > dp[idx] + (countMaxElem^1)) {
dp[v] = dp[idx] + (countMaxElem^1);
if((countMaxElem^1) == 0) { deq.addFirst(v); }
else { deq.addLast(v); }
}
}
}
}
return dp;
}
/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }
void main() throws IOException {
// IOFast.setFileIO("rle-size.in", "rle-size.out");
try { run(); }
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException { new Main().main(); }
static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }
static
public class IOFast {
private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private PrintWriter out = new PrintWriter(System.out);
void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }
private static int pos, readLen;
private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];
static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
public String nextString() throws IOException { return new String(next()); }
public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
// public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
}
}