#53563 (Java21) No.288 貯金箱の仕事

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	ぴろず
提出日時	2015-10-13 11:59:17
言語	Java21 (openjdk 21)
結果	AC
実行時間	376 ms / 2,000 ms
コード長	4,548 bytes
コンパイル時間	2,505 ms
コンパイル使用メモリ	77,664 KB
実行使用メモリ	40,424 KB
最終ジャッジ日時	2024-07-21 07:25:06
合計ジャッジ時間	10,609 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	91 ms 39,292 KB
testcase_01	AC	45 ms 36,712 KB
testcase_02	AC	45 ms 36,960 KB
testcase_03	AC	45 ms 36,652 KB
testcase_04	AC	44 ms 36,864 KB
testcase_05	AC	47 ms 36,972 KB
testcase_06	AC	51 ms 36,840 KB
testcase_07	AC	54 ms 36,960 KB
testcase_08	AC	45 ms 36,820 KB
testcase_09	AC	51 ms 36,820 KB
testcase_10	AC	49 ms 36,972 KB
testcase_11	AC	46 ms 36,444 KB
testcase_12	AC	53 ms 36,864 KB
testcase_13	AC	51 ms 36,744 KB
testcase_14	AC	49 ms 36,768 KB
testcase_15	AC	51 ms 36,980 KB
testcase_16	AC	51 ms 36,956 KB
testcase_17	AC	47 ms 36,972 KB
testcase_18	AC	47 ms 36,972 KB
testcase_19	AC	47 ms 36,864 KB
testcase_20	AC	45 ms 36,940 KB
testcase_21	AC	45 ms 36,784 KB
testcase_22	AC	48 ms 36,840 KB
testcase_23	AC	375 ms 40,340 KB
testcase_24	AC	213 ms 38,660 KB
testcase_25	AC	65 ms 38,620 KB
testcase_26	AC	64 ms 38,772 KB
testcase_27	AC	63 ms 38,736 KB
testcase_28	AC	74 ms 38,740 KB
testcase_29	AC	64 ms 38,772 KB
testcase_30	AC	116 ms 39,292 KB
testcase_31	AC	116 ms 39,140 KB
testcase_32	AC	222 ms 38,640 KB
testcase_33	AC	215 ms 38,760 KB
testcase_34	AC	286 ms 38,580 KB
testcase_35	AC	292 ms 38,680 KB
testcase_36	AC	376 ms 40,396 KB
testcase_37	AC	125 ms 39,216 KB
testcase_38	AC	262 ms 38,784 KB
testcase_39	AC	140 ms 39,416 KB
testcase_40	AC	142 ms 39,252 KB
testcase_41	AC	360 ms 40,248 KB
testcase_42	AC	324 ms 40,132 KB
testcase_43	AC	244 ms 38,560 KB
testcase_44	AC	109 ms 38,480 KB
testcase_45	AC	241 ms 40,192 KB
testcase_46	AC	327 ms 40,424 KB
testcase_47	AC	154 ms 38,996 KB
testcase_48	AC	252 ms 40,304 KB
testcase_49	AC	116 ms 38,928 KB
testcase_50	AC	142 ms 39,040 KB
testcase_51	AC	120 ms 39,004 KB
testcase_52	AC	160 ms 39,008 KB
testcase_53	AC	246 ms 38,636 KB
testcase_54	AC	153 ms 40,272 KB
testcase_55	AC	51 ms 36,960 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package no288;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		System.out.println(solve());
	}

	public static final int INF = 1 << 29;
	public static long solve() {
		IO io = new IO();
		int n = io.nextInt();
		long m = io.nextLong();
		int[] a = io.nextIntArray(n);
		long b = 0;
		for(int i=0;i<n;i++) {
			long k = io.nextLong();
			b += k * a[i];
		}
		if (m > b) {
			return -1;
		}
		long x = b - m;
		int max = a[n-1] * a[n-1];
		int[] dp = new int[max+1];
		Arrays.fill(dp, INF);
		dp[0] = 0;
		for(int i=1;i<=max;i++) {
			for(int j=0;j<n;j++) {
				if (i >= a[j]) {
					dp[i] = Math.min(dp[i],dp[i-a[j]] + 1);
				}
			}
		}
		long ans = Long.MAX_VALUE;
		for(int i=(int) (x%a[n-1]);i<=max && i <= x;i+=a[n-1]) {
			if (dp[i] != INF) {
				ans = Math.min(ans, dp[i] + (x - i) / a[n-1]);
			}
		}
		return ans == Long.MAX_VALUE ? -1 : ans;
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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 char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}

yukicoder

結果

テストケース

ソースコード