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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	ぴろず
提出日時	2015-10-13 13:19:13
言語	Java21 (openjdk 21)
結果	AC
実行時間	409 ms / 2,000 ms
コード長	4,659 bytes
コンパイル時間	2,654 ms
コンパイル使用メモリ	78,248 KB
実行使用メモリ	38,920 KB
最終ジャッジ日時	2024-07-21 07:28:53
合計ジャッジ時間	11,963 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	74 ms 38,704 KB
testcase_01	AC	52 ms 36,640 KB
testcase_02	AC	52 ms 36,728 KB
testcase_03	AC	54 ms 36,480 KB
testcase_04	AC	52 ms 36,728 KB
testcase_05	AC	52 ms 36,700 KB
testcase_06	AC	51 ms 36,604 KB
testcase_07	AC	65 ms 37,320 KB
testcase_08	AC	54 ms 36,440 KB
testcase_09	AC	60 ms 36,724 KB
testcase_10	AC	61 ms 36,840 KB
testcase_11	AC	58 ms 36,452 KB
testcase_12	AC	59 ms 36,488 KB
testcase_13	AC	59 ms 36,856 KB
testcase_14	AC	58 ms 36,712 KB
testcase_15	AC	61 ms 36,464 KB
testcase_16	AC	61 ms 36,780 KB
testcase_17	AC	57 ms 36,412 KB
testcase_18	AC	55 ms 36,644 KB
testcase_19	AC	57 ms 36,128 KB
testcase_20	AC	54 ms 36,704 KB
testcase_21	AC	54 ms 36,604 KB
testcase_22	AC	59 ms 36,572 KB
testcase_23	AC	409 ms 38,488 KB
testcase_24	AC	226 ms 38,488 KB
testcase_25	AC	80 ms 37,964 KB
testcase_26	AC	79 ms 38,032 KB
testcase_27	AC	78 ms 37,884 KB
testcase_28	AC	69 ms 38,004 KB
testcase_29	AC	79 ms 38,336 KB
testcase_30	AC	149 ms 38,688 KB
testcase_31	AC	149 ms 38,920 KB
testcase_32	AC	242 ms 38,920 KB
testcase_33	AC	242 ms 38,496 KB
testcase_34	AC	256 ms 38,856 KB
testcase_35	AC	254 ms 38,904 KB
testcase_36	AC	409 ms 38,712 KB
testcase_37	AC	139 ms 38,488 KB
testcase_38	AC	301 ms 38,916 KB
testcase_39	AC	186 ms 38,584 KB
testcase_40	AC	190 ms 38,700 KB
testcase_41	AC	394 ms 38,472 KB
testcase_42	AC	354 ms 38,832 KB
testcase_43	AC	229 ms 38,472 KB
testcase_44	AC	132 ms 38,040 KB
testcase_45	AC	207 ms 38,512 KB
testcase_46	AC	279 ms 38,688 KB
testcase_47	AC	176 ms 38,528 KB
testcase_48	AC	270 ms 38,712 KB
testcase_49	AC	138 ms 38,204 KB
testcase_50	AC	159 ms 38,232 KB
testcase_51	AC	130 ms 38,516 KB
testcase_52	AC	186 ms 38,716 KB
testcase_53	AC	218 ms 38,352 KB
testcase_54	AC	151 ms 38,632 KB
testcase_55	AC	53 ms 36,640 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=n-1;i>=0;i--) {
			for(int j=0;j<=max-a[i];j++) {
				if (dp[j] >= INF) {
					continue;
				}
				dp[j+a[i]] = Math.min(dp[j+a[i]], dp[j] + 1);
			}
		}
		long ans = Long.MAX_VALUE;
		if (x <= max) {
			ans = dp[(int) x] < INF ? dp[(int) x] : Long.MAX_VALUE;
		}else{
			int poyo = dp[a[n-1] * (a[n-1] - 1) + (int) (x % a[n-1])];
			if (poyo < INF) {
				ans = poyo + x / a[n-1] - (a[n-1] - 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

結果

テストケース

ソースコード