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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	tanzaku
提出日時	2015-10-09 23:13:37
言語	Java21 (openjdk 21)
結果	AC
実行時間	1,058 ms / 2,000 ms
コード長	6,069 bytes
コンパイル時間	2,797 ms
コンパイル使用メモリ	89,896 KB
実行使用メモリ	38,872 KB
最終ジャッジ日時	2024-07-20 04:33:49
合計ジャッジ時間	51,696 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	61 ms 37,260 KB
testcase_01	AC	55 ms 37,084 KB
testcase_02	AC	55 ms 37,132 KB
testcase_03	AC	56 ms 37,256 KB
testcase_04	AC	55 ms 37,364 KB
testcase_05	AC	74 ms 37,968 KB
testcase_06	AC	76 ms 38,096 KB
testcase_07	AC	1,055 ms 38,308 KB
testcase_08	AC	1,055 ms 38,456 KB
testcase_09	AC	1,054 ms 38,584 KB
testcase_10	AC	1,056 ms 38,584 KB
testcase_11	AC	1,054 ms 38,872 KB
testcase_12	AC	1,056 ms 38,656 KB
testcase_13	AC	1,056 ms 38,548 KB
testcase_14	AC	1,057 ms 38,748 KB
testcase_15	AC	1,055 ms 38,428 KB
testcase_16	AC	1,055 ms 38,772 KB
testcase_17	AC	1,055 ms 38,668 KB
testcase_18	AC	1,055 ms 38,504 KB
testcase_19	AC	1,056 ms 38,680 KB
testcase_20	AC	1,054 ms 38,632 KB
testcase_21	AC	1,056 ms 38,448 KB
testcase_22	AC	1,057 ms 38,620 KB
testcase_23	AC	1,054 ms 38,492 KB
testcase_24	AC	1,055 ms 38,468 KB
testcase_25	AC	81 ms 37,740 KB
testcase_26	AC	81 ms 37,712 KB
testcase_27	AC	80 ms 37,904 KB
testcase_28	AC	80 ms 37,700 KB
testcase_29	AC	1,056 ms 38,752 KB
testcase_30	AC	1,055 ms 38,308 KB
testcase_31	AC	1,055 ms 38,564 KB
testcase_32	AC	1,056 ms 38,656 KB
testcase_33	AC	1,055 ms 38,528 KB
testcase_34	AC	1,058 ms 38,576 KB
testcase_35	AC	1,055 ms 38,344 KB
testcase_36	AC	1,056 ms 38,308 KB
testcase_37	AC	1,055 ms 38,712 KB
testcase_38	AC	1,054 ms 38,604 KB
testcase_39	AC	1,054 ms 38,656 KB
testcase_40	AC	1,057 ms 38,696 KB
testcase_41	AC	1,055 ms 38,660 KB
testcase_42	AC	1,056 ms 38,452 KB
testcase_43	AC	1,054 ms 38,440 KB
testcase_44	AC	1,057 ms 38,708 KB
testcase_45	AC	1,055 ms 38,544 KB
testcase_46	AC	1,055 ms 38,572 KB
testcase_47	AC	1,055 ms 38,528 KB
testcase_48	AC	1,054 ms 38,788 KB
testcase_49	AC	1,054 ms 38,712 KB
testcase_50	AC	1,054 ms 38,600 KB
testcase_51	AC	1,054 ms 38,696 KB
testcase_52	AC	1,055 ms 38,796 KB
testcase_53	AC	1,056 ms 38,728 KB
testcase_54	AC	1,055 ms 38,672 KB
testcase_55	AC	55 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) {
			START = System.currentTimeMillis();
			
			int n = io.nextInt();
			m = io.nextLong();
			A = io.nextIntArray(n);
			long[] K = io.nextLongArray(n);
//			m = 1000000000000L;
//			A = new int[n];
//			long[] K = new long[n];
//			for(int i = 0; i < n; i++) { A[i] = random.nextInt(500)+1; K[i] = random.nextLong()%(m+1); }
			for(int i = 0; i < n; i++) m -= A[i] * K[i];
			if(m > 0) {
				io.out.println(-1);
				System.err.println("come: " + m);
				return;
			}
			m = -m;
			ans = Long.MAX_VALUE;
			rec(n - 1, 0);
			if(ans == Long.MAX_VALUE) ans = -1;
			io.out.println(ans);
		}
	}
	
	long START;
	long m;
	int[] A;
	long ans;
	void rec(int idx, long cur) {
		if(cur >= ans) return;
		if(m == 0) { ans = cur; return; }
		if(idx == -1) return;
		for(long v = m / A[idx]; v >= 0 && cur < ans; v--) {
			if(System.currentTimeMillis() - START > 1000) return;
			m -= v * A[idx];
			rec(idx - 1, cur+v);
			m += v * A[idx];
		}
	}
	
	/// 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

結果

テストケース

ソースコード