結果

問題 No.288 貯金箱の仕事
ユーザー tanzakutanzaku
提出日時 2015-10-10 01:12:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 334 ms / 2,000 ms
コード長 5,948 bytes
コンパイル時間 2,778 ms
コンパイル使用メモリ 87,740 KB
実行使用メモリ 39,748 KB
最終ジャッジ日時 2024-07-20 04:53:31
合計ジャッジ時間 12,136 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 95 ms
39,420 KB
testcase_01 AC 74 ms
39,008 KB
testcase_02 AC 86 ms
39,736 KB
testcase_03 AC 70 ms
39,168 KB
testcase_04 AC 82 ms
39,032 KB
testcase_05 AC 50 ms
37,308 KB
testcase_06 AC 47 ms
37,200 KB
testcase_07 AC 101 ms
39,624 KB
testcase_08 AC 100 ms
39,552 KB
testcase_09 AC 91 ms
39,504 KB
testcase_10 AC 100 ms
39,316 KB
testcase_11 AC 83 ms
39,380 KB
testcase_12 AC 93 ms
39,680 KB
testcase_13 AC 92 ms
39,268 KB
testcase_14 AC 96 ms
39,704 KB
testcase_15 AC 99 ms
39,504 KB
testcase_16 AC 95 ms
39,500 KB
testcase_17 AC 90 ms
39,436 KB
testcase_18 AC 84 ms
39,424 KB
testcase_19 AC 90 ms
39,680 KB
testcase_20 AC 89 ms
39,432 KB
testcase_21 AC 84 ms
39,748 KB
testcase_22 AC 92 ms
39,432 KB
testcase_23 AC 325 ms
39,736 KB
testcase_24 AC 208 ms
39,716 KB
testcase_25 AC 77 ms
39,580 KB
testcase_26 AC 73 ms
39,308 KB
testcase_27 AC 69 ms
39,168 KB
testcase_28 AC 65 ms
39,204 KB
testcase_29 AC 77 ms
39,036 KB
testcase_30 AC 138 ms
39,244 KB
testcase_31 AC 140 ms
39,480 KB
testcase_32 AC 205 ms
39,312 KB
testcase_33 AC 215 ms
39,660 KB
testcase_34 AC 273 ms
39,412 KB
testcase_35 AC 269 ms
39,652 KB
testcase_36 AC 334 ms
39,480 KB
testcase_37 AC 153 ms
39,388 KB
testcase_38 AC 251 ms
39,572 KB
testcase_39 AC 167 ms
39,216 KB
testcase_40 AC 166 ms
39,380 KB
testcase_41 AC 322 ms
39,264 KB
testcase_42 AC 286 ms
39,424 KB
testcase_43 AC 230 ms
39,716 KB
testcase_44 AC 183 ms
39,392 KB
testcase_45 AC 274 ms
39,468 KB
testcase_46 AC 299 ms
39,516 KB
testcase_47 AC 225 ms
39,244 KB
testcase_48 AC 234 ms
39,696 KB
testcase_49 AC 180 ms
39,540 KB
testcase_50 AC 202 ms
39,696 KB
testcase_51 AC 173 ms
39,656 KB
testcase_52 AC 205 ms
39,708 KB
testcase_53 AC 239 ms
39,432 KB
testcase_54 AC 193 ms
39,536 KB
testcase_55 AC 76 ms
39,368 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

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];
			if(m > 0) {
				io.out.println(-1);
				return;
			}
			m = -m;
			
			int[] dp = new int[501*501];
			Arrays.fill(dp, 1<<29);
			dp[0] = 0;
			for(int i = 0; i < dp.length; i++) {
				for(int a : A) if(i + a < dp.length) {
					dp[i+a] = Math.min(dp[i+a], dp[i] + 1);
				}
			}
			
			long ans = m / (A[n-1] * A[n-1]) * (A[n-1] * A[n-1]) / A[n-1];
			m = m - m / (A[n-1] * A[n-1]) * (A[n-1] * A[n-1]);
			
			long ans2 = Long.MAX_VALUE;
			for(int i = 0; m >= 0; m -= A[n-1], i++) {
				ans2 = Math.min(ans2, dp[(int)m] + i);
			}
			
			if(ans2 >= 1<<29) {
				io.out.println(-1);
				return;
			}
			
			io.out.println(ans + ans2);
		}
	}
	
	/// 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; }
	
	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; }
	}
}
0