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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	uwi
提出日時	2015-10-11 20:48:39
言語	Java21 (openjdk 21)
結果	AC
実行時間	349 ms / 2,000 ms
コード長	4,738 bytes
コンパイル時間	5,208 ms
コンパイル使用メモリ	81,348 KB
実行使用メモリ	39,228 KB
最終ジャッジ日時	2024-07-21 06:52:38
合計ジャッジ時間	13,725 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	52 ms 36,792 KB
testcase_01	AC	52 ms 36,736 KB
testcase_02	AC	56 ms 36,620 KB
testcase_03	AC	53 ms 36,436 KB
testcase_04	AC	52 ms 36,940 KB
testcase_05	AC	52 ms 36,532 KB
testcase_06	AC	52 ms 36,528 KB
testcase_07	AC	61 ms 37,112 KB
testcase_08	AC	55 ms 36,736 KB
testcase_09	AC	59 ms 36,728 KB
testcase_10	AC	59 ms 36,916 KB
testcase_11	AC	54 ms 36,452 KB
testcase_12	AC	60 ms 36,736 KB
testcase_13	AC	56 ms 36,744 KB
testcase_14	AC	56 ms 36,424 KB
testcase_15	AC	59 ms 36,864 KB
testcase_16	AC	63 ms 36,600 KB
testcase_17	AC	56 ms 36,912 KB
testcase_18	AC	55 ms 36,672 KB
testcase_19	AC	55 ms 36,704 KB
testcase_20	AC	55 ms 36,784 KB
testcase_21	AC	55 ms 36,504 KB
testcase_22	AC	57 ms 36,792 KB
testcase_23	AC	349 ms 38,776 KB
testcase_24	AC	246 ms 38,348 KB
testcase_25	AC	85 ms 38,636 KB
testcase_26	AC	75 ms 38,852 KB
testcase_27	AC	84 ms 38,700 KB
testcase_28	AC	85 ms 38,644 KB
testcase_29	AC	84 ms 38,584 KB
testcase_30	AC	136 ms 38,948 KB
testcase_31	AC	138 ms 39,228 KB
testcase_32	AC	243 ms 38,344 KB
testcase_33	AC	243 ms 38,556 KB
testcase_34	AC	284 ms 38,572 KB
testcase_35	AC	281 ms 38,776 KB
testcase_36	AC	348 ms 38,732 KB
testcase_37	AC	141 ms 39,052 KB
testcase_38	AC	259 ms 38,652 KB
testcase_39	AC	157 ms 38,748 KB
testcase_40	AC	155 ms 39,132 KB
testcase_41	AC	335 ms 38,348 KB
testcase_42	AC	304 ms 38,544 KB
testcase_43	AC	109 ms 37,816 KB
testcase_44	AC	120 ms 38,304 KB
testcase_45	AC	225 ms 38,248 KB
testcase_46	AC	304 ms 38,908 KB
testcase_47	AC	175 ms 38,972 KB
testcase_48	AC	270 ms 38,316 KB
testcase_49	AC	130 ms 38,344 KB
testcase_50	AC	155 ms 38,904 KB
testcase_51	AC	135 ms 38,836 KB
testcase_52	AC	191 ms 38,604 KB
testcase_53	AC	274 ms 38,564 KB
testcase_54	AC	151 ms 38,824 KB
testcase_55	AC	54 ms 36,884 KB

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

ソースコード

raw source code

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.InputMismatchException;

public class Q333 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long m = nl();
		int[] a = na(n);
		long[] K = new long[n];
		for(int i= 0;i < n;i++)K[i] = nl();
		long all = 0;
		for(int i = 0;i < n;i++)all += K[i] * a[i];
		if(all < m){
			out.println(-1);
			return;
		}
		out.println(minRepresentation(all-m, a));
	}
	
	long minRepresentation(long x, int[] a)
	{
		Arrays.sort(a);
		int n = a.length;
		int m = a[n-1];
		int lim = (int)Math.min(x, m*m);
		int[] dp = new int[lim+1];
		int I = 999999999;
		Arrays.fill(dp, I);
		dp[0] = 0;
		for(int i = 1;i <= lim;i++){
			for(int v : a){
				if(i-v >= 0){
					dp[i] = Math.min(dp[i], dp[i-v] + 1);
				}
			}
		}
		if(x <= m*m){
			return dp[(int)x] >= I ? -1 : dp[(int)x];
		}else{
			return dp[(int)(x%m+m*(m-1))] + (x/m-(m-1));
		}
	}
	
	public static int[] representable2(int[] a)
	{
		int n = a.length;
		Deque<Integer> q = new ArrayDeque<Integer>();
		int[] d = new int[a[n-1]];
		Arrays.fill(d, Integer.MAX_VALUE);
		d[0] = 0;
		q.add(0);
		while(!q.isEmpty()){
			int cur = q.pollFirst();
			for(int i = 0;i < n-1;i++){
				if(cur+a[i] >= a[n-1]){
					int nex = cur+a[i]-a[n-1];
					if(d[nex] > d[cur]+1){
						d[nex] = d[cur]+1;
						q.addLast(nex);
					}
				}else{
					int nex = cur+a[i];
					if(d[nex] > d[cur]+1){
						d[nex] = d[cur]+1;
						q.addLast(nex);
					}
				}
			}
		}
		return d;
	}
	
	public static int[] representable(int[] a)
	{
		int n = a.length;
		Deque<Integer> q = new ArrayDeque<Integer>();
		int[] d = new int[a[n-1]];
		Arrays.fill(d, Integer.MAX_VALUE);
		d[0] = 0;
		q.add(0);
		while(!q.isEmpty()){
			int cur = q.pollFirst();
			for(int i = 0;i < n-1;i++){
				if(cur+a[i] >= a[n-1]){
					int nex = cur+a[i]-a[n-1];
					if(d[nex] > d[cur] + 1){
						d[nex] = d[cur] + 1;
						q.addLast(nex);
					}
				}else{
					int nex = cur+a[i];
					if(d[nex] > d[cur]){
						d[nex] = d[cur];
						q.addFirst(nex);
					}
				}
			}
		}
		return d;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q333().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード