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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	tanzaku
提出日時	2015-10-10 17:16:59
言語	Java21 (openjdk 21)
結果	WA (最新) AC (最初)
実行時間	-
コード長	6,718 bytes
コンパイル時間	4,289 ms
コンパイル使用メモリ	85,576 KB
実行使用メモリ	39,092 KB
最終ジャッジ日時	2024-07-21 06:15:11
合計ジャッジ時間	8,088 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 37,356 KB
testcase_01	AC	47 ms 36,928 KB
testcase_02	AC	47 ms 37,252 KB
testcase_03	AC	46 ms 37,244 KB
testcase_04	AC	48 ms 36,812 KB
testcase_05	AC	46 ms 36,844 KB
testcase_06	AC	45 ms 36,936 KB
testcase_07	AC	46 ms 37,156 KB
testcase_08	AC	46 ms 37,120 KB
testcase_09	AC	47 ms 37,516 KB
testcase_10	AC	47 ms 37,016 KB
testcase_11	AC	47 ms 37,520 KB
testcase_12	AC	46 ms 37,172 KB
testcase_13	AC	48 ms 37,216 KB
testcase_14	AC	49 ms 36,916 KB
testcase_15	AC	47 ms 36,948 KB
testcase_16	AC	47 ms 37,300 KB
testcase_17	AC	48 ms 37,076 KB
testcase_18	AC	46 ms 37,372 KB
testcase_19	AC	46 ms 36,992 KB
testcase_20	AC	49 ms 37,040 KB
testcase_21	AC	46 ms 37,300 KB
testcase_22	AC	47 ms 37,508 KB
testcase_23	AC	77 ms 38,488 KB
testcase_24	AC	55 ms 37,500 KB
testcase_25	AC	46 ms 37,268 KB
testcase_26	AC	48 ms 36,944 KB
testcase_27	AC	47 ms 37,204 KB
testcase_28	AC	46 ms 36,928 KB
testcase_29	AC	45 ms 36,992 KB
testcase_30	AC	53 ms 37,432 KB
testcase_31	AC	53 ms 37,492 KB
testcase_32	AC	57 ms 37,900 KB
testcase_33	AC	58 ms 37,932 KB
testcase_34	AC	70 ms 37,888 KB
testcase_35	AC	70 ms 38,020 KB
testcase_36	AC	78 ms 38,584 KB
testcase_37	AC	71 ms 37,796 KB
testcase_38	AC	61 ms 38,068 KB
testcase_39	AC	76 ms 38,288 KB
testcase_40	AC	74 ms 37,996 KB
testcase_41	AC	72 ms 38,460 KB
testcase_42	AC	90 ms 39,092 KB
testcase_43	AC	58 ms 37,544 KB
testcase_44	AC	53 ms 37,376 KB
testcase_45	AC	68 ms 37,528 KB
testcase_46	AC	85 ms 38,596 KB
testcase_47	AC	74 ms 38,044 KB
testcase_48	AC	57 ms 37,560 KB
testcase_49	AC	55 ms 37,040 KB
testcase_50	AC	68 ms 37,656 KB
testcase_51	AC	69 ms 37,928 KB
testcase_52	AC	71 ms 37,968 KB
testcase_53	AC	68 ms 37,868 KB
testcase_54	AC	70 ms 37,576 KB
testcase_55	WA	-

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

ソースコード

raw source code

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

import javax.management.RuntimeErrorException;

import static java.util.Arrays.*;

public class _288 {
	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];
			io.out.println(solve(A, -m));
		}
	}
	
	// min Σ C[i] s.t. Σ A[i] * C[i] = X, A[i] >= 0, C[i] >= 0
	long solve(final int[] A, final long X) {
		if(X < 0) return -1;
		
		Arrays.sort(A);
		final int n = A.length;
		final int maxElem = A[n - 1];
		final long[] minUseMaxElem = bfs01(A, 1);
		final long[] other = bfs01(A, 0);
		if(minUseMaxElem[(int)(X%maxElem)] > X / maxElem) {
			return -1;
		}
		else {
			return other[(int)(X%maxElem)] + X / maxElem;
		}
	}
	
	long[] bfs01(final int[] A, final int countMaxElem) {
		final Deque<Integer> deq = new ArrayDeque<Integer>();
		final int maxElem = A[A.length - 1];
		final long[] dp = new long[maxElem];
		Arrays.fill(dp, Long.MAX_VALUE);
		dp[0] = 0;
		deq.add(0);
		while(!deq.isEmpty()) {
			final int idx = deq.pollFirst();
			for(int i = 0; i < A.length - 1; i++) {
				int v = A[i] + idx;
				if(v >= maxElem) {
					v -= maxElem;
					if(dp[v] > dp[idx] + countMaxElem) {
						dp[v] = dp[idx] + countMaxElem;
						if(countMaxElem == 0) { deq.addFirst(v); }
						else { deq.addLast(v); }
					}
				}
				else {
					if(dp[v] > dp[idx] + (countMaxElem^1)) {
						dp[v] = dp[idx] + (countMaxElem^1);
						if((countMaxElem^1) == 0) { deq.addFirst(v); }
						else { deq.addLast(v); }
					}
				}
			}
		}
		return dp;
	}
	
	
	/// 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; }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	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 _288().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

結果

テストケース

ソースコード