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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	tanzaku
提出日時	2015-10-10 12:09:24
言語	Java21 (openjdk 21)
結果	AC
実行時間	377 ms / 2,000 ms
コード長	6,302 bytes
コンパイル時間	2,672 ms
コンパイル使用メモリ	87,220 KB
実行使用メモリ	40,784 KB
最終ジャッジ日時	2024-07-20 04:58:00
合計ジャッジ時間	11,370 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	90 ms 40,204 KB
testcase_01	AC	52 ms 37,040 KB
testcase_02	AC	52 ms 37,028 KB
testcase_03	AC	49 ms 36,828 KB
testcase_04	AC	47 ms 37,100 KB
testcase_05	AC	46 ms 37,144 KB
testcase_06	AC	46 ms 37,244 KB
testcase_07	AC	51 ms 37,404 KB
testcase_08	AC	51 ms 37,240 KB
testcase_09	AC	53 ms 37,256 KB
testcase_10	AC	57 ms 37,128 KB
testcase_11	AC	53 ms 37,232 KB
testcase_12	AC	53 ms 37,040 KB
testcase_13	AC	52 ms 37,128 KB
testcase_14	AC	55 ms 37,412 KB
testcase_15	AC	54 ms 37,304 KB
testcase_16	AC	53 ms 37,132 KB
testcase_17	AC	51 ms 37,036 KB
testcase_18	AC	50 ms 37,120 KB
testcase_19	AC	50 ms 37,004 KB
testcase_20	AC	49 ms 37,292 KB
testcase_21	AC	50 ms 36,992 KB
testcase_22	AC	54 ms 36,844 KB
testcase_23	AC	344 ms 40,508 KB
testcase_24	AC	141 ms 40,400 KB
testcase_25	AC	66 ms 39,888 KB
testcase_26	AC	71 ms 40,208 KB
testcase_27	AC	79 ms 39,984 KB
testcase_28	AC	78 ms 40,340 KB
testcase_29	AC	80 ms 40,072 KB
testcase_30	AC	123 ms 40,784 KB
testcase_31	AC	141 ms 40,364 KB
testcase_32	AC	214 ms 40,396 KB
testcase_33	AC	217 ms 40,396 KB
testcase_34	AC	280 ms 40,212 KB
testcase_35	AC	280 ms 40,388 KB
testcase_36	AC	350 ms 40,164 KB
testcase_37	AC	162 ms 40,092 KB
testcase_38	AC	289 ms 40,400 KB
testcase_39	AC	166 ms 40,260 KB
testcase_40	AC	183 ms 40,172 KB
testcase_41	AC	377 ms 40,412 KB
testcase_42	AC	333 ms 40,692 KB
testcase_43	AC	244 ms 40,056 KB
testcase_44	AC	125 ms 39,236 KB
testcase_45	AC	259 ms 39,944 KB
testcase_46	AC	340 ms 40,504 KB
testcase_47	AC	209 ms 39,884 KB
testcase_48	AC	258 ms 40,448 KB
testcase_49	AC	146 ms 39,540 KB
testcase_50	AC	173 ms 40,004 KB
testcase_51	AC	141 ms 39,680 KB
testcase_52	AC	202 ms 40,228 KB
testcase_53	AC	270 ms 40,068 KB
testcase_54	AC	167 ms 39,652 KB
testcase_55	AC	47 ms 37,176 KB

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

ソースコード

raw source code

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;
			{
				int s = 0, t = 0;
				int[] que = new int[dp.length];
				que[t++] = 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);
//					}
//				}
				while(s != t) {
					int v = que[s++];
					for(int a : A) {
						if(v + a >= dp.length) break;
						if(dp[v + a] > dp[v] + 1) {
							dp[v + a] = dp[v] + 1;
							que[t++] = v + a;
						}
					}
				}
			}
			
			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; }
	}
}

yukicoder

結果

テストケース

ソースコード