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

• 問題: No.288 貯金箱の仕事
• ユーザー: tanzaku
• 提出日時: 2015-10-10 01:32:12
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 356 ms / 2,000 ms
• コード長: 5,987 bytes
• コンパイル時間: 2,454 ms
• コンパイル使用メモリ: 80,732 KB
• 実行使用メモリ: 52,152 KB
• 最終ジャッジ日時: 2024-07-20 04:55:01
• 合計ジャッジ時間: 12,085 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	86 ms; 51,684 KB
testcase_01	AC	55 ms; 50,224 KB
testcase_02	AC	57 ms; 50,368 KB
testcase_03	AC	55 ms; 50,516 KB
testcase_04	AC	55 ms; 50,460 KB
testcase_05	AC	55 ms; 50,312 KB
testcase_06	AC	55 ms; 50,544 KB
testcase_07	AC	65 ms; 50,520 KB
testcase_08	AC	57 ms; 50,348 KB
testcase_09	AC	65 ms; 50,144 KB
testcase_10	AC	65 ms; 50,996 KB
testcase_11	AC	58 ms; 50,200 KB
testcase_12	AC	61 ms; 50,580 KB
testcase_13	AC	60 ms; 50,560 KB
testcase_14	AC	60 ms; 50,328 KB
testcase_15	AC	64 ms; 50,464 KB
testcase_16	AC	63 ms; 50,424 KB
testcase_17	AC	59 ms; 50,144 KB
testcase_18	AC	58 ms; 50,528 KB
testcase_19	AC	59 ms; 50,480 KB
testcase_20	AC	58 ms; 50,472 KB
testcase_21	AC	58 ms; 50,028 KB
testcase_22	AC	62 ms; 50,204 KB
testcase_23	AC	356 ms; 51,960 KB
testcase_24	AC	143 ms; 51,904 KB
testcase_25	AC	84 ms; 51,424 KB
testcase_26	AC	87 ms; 51,656 KB
testcase_27	AC	74 ms; 51,220 KB
testcase_28	AC	75 ms; 51,480 KB
testcase_29	AC	76 ms; 51,148 KB
testcase_30	AC	156 ms; 51,940 KB
testcase_31	AC	162 ms; 51,888 KB
testcase_32	AC	227 ms; 52,144 KB
testcase_33	AC	225 ms; 52,000 KB
testcase_34	AC	292 ms; 51,984 KB
testcase_35	AC	293 ms; 51,864 KB
testcase_36	AC	355 ms; 51,964 KB
testcase_37	AC	155 ms; 51,800 KB
testcase_38	AC	273 ms; 52,052 KB
testcase_39	AC	173 ms; 51,720 KB
testcase_40	AC	179 ms; 51,712 KB
testcase_41	AC	345 ms; 52,152 KB
testcase_42	AC	314 ms; 51,796 KB
testcase_43	AC	245 ms; 52,092 KB
testcase_44	AC	126 ms; 51,664 KB
testcase_45	AC	234 ms; 51,820 KB
testcase_46	AC	316 ms; 51,892 KB
testcase_47	AC	199 ms; 51,948 KB
testcase_48	AC	242 ms; 51,896 KB
testcase_49	AC	155 ms; 51,744 KB
testcase_50	AC	186 ms; 52,104 KB
testcase_51	AC	147 ms; 51,812 KB
testcase_52	AC	214 ms; 52,128 KB
testcase_53	AC	250 ms; 51,744 KB
testcase_54	AC	183 ms; 51,752 KB
testcase_55	AC	56 ms; 50,548 KB

ソースコード

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[A[n-1]*A[n-1]+1];
			Arrays.fill(dp, 1<<29);
			dp[0] = 0;
			for(int i = 0; i < dp.length; i++) if(dp[i] < 1<<29) {
				for(int a : A) {
					if(i + a >= dp.length) break;
					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; }
	}
}