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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	ぴろず
提出日時	2015-10-13 13:08:57
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	4,533 bytes
コンパイル時間	2,268 ms
コンパイル使用メモリ	76,740 KB
実行使用メモリ	53,776 KB
最終ジャッジ日時	2023-09-28 12:50:19
合計ジャッジ時間	12,257 ms
ジャッジサーバーID （参考情報）	judge12 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	67 ms 51,668 KB
testcase_01	AC	45 ms 49,544 KB
testcase_02	AC	44 ms 49,320 KB
testcase_03	AC	44 ms 49,340 KB
testcase_04	AC	44 ms 48,996 KB
testcase_05	AC	44 ms 49,460 KB
testcase_06	AC	44 ms 49,420 KB
testcase_07	WA	-
testcase_08	AC	46 ms 49,212 KB
testcase_09	WA	-
testcase_10	AC	53 ms 49,944 KB
testcase_11	WA	-
testcase_12	AC	50 ms 49,388 KB
testcase_13	WA	-
testcase_14	AC	49 ms 49,540 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	49 ms 49,380 KB
testcase_18	WA	-
testcase_19	AC	49 ms 49,388 KB
testcase_20	AC	46 ms 49,232 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	67 ms 51,624 KB
testcase_26	AC	68 ms 51,676 KB
testcase_27	AC	69 ms 49,736 KB
testcase_28	AC	68 ms 50,072 KB
testcase_29	WA	-
testcase_30	AC	109 ms 50,920 KB
testcase_31	AC	112 ms 51,700 KB
testcase_32	AC	206 ms 51,488 KB
testcase_33	AC	206 ms 51,180 KB
testcase_34	AC	279 ms 51,280 KB
testcase_35	AC	281 ms 51,600 KB
testcase_36	WA	-
testcase_37	AC	113 ms 50,940 KB
testcase_38	WA	-
testcase_39	AC	120 ms 51,296 KB
testcase_40	AC	122 ms 51,720 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	AC	229 ms 51,376 KB
testcase_44	WA	-
testcase_45	AC	224 ms 51,492 KB
testcase_46	AC	305 ms 51,332 KB
testcase_47	WA	-
testcase_48	WA	-
testcase_49	AC	106 ms 51,428 KB
testcase_50	WA	-
testcase_51	AC	107 ms 51,636 KB
testcase_52	AC	172 ms 50,956 KB
testcase_53	WA	-
testcase_54	WA	-
testcase_55	AC	43 ms 49,204 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;
		if (x <= max) {
			ans = dp[(int) x];
		}else{
			ans = dp[a[n-1] * (a[n-1] - 1) + (int) (x % a[n-1])] + x / a[n-1] - (a[n-1] - 1);
		}
		return ans >= INF ? -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

結果

テストケース

ソースコード