結果

問題 No.288 貯金箱の仕事
ユーザー uwiuwi
提出日時 2015-10-11 21:59:57
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,600 bytes
コンパイル時間 4,061 ms
コンパイル使用メモリ 82,120 KB
実行使用メモリ 52,256 KB
最終ジャッジ日時 2023-09-28 12:17:30
合計ジャッジ時間 14,553 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,516 KB
testcase_01 AC 43 ms
49,404 KB
testcase_02 AC 46 ms
49,344 KB
testcase_03 AC 43 ms
49,396 KB
testcase_04 AC 44 ms
49,256 KB
testcase_05 AC 43 ms
49,384 KB
testcase_06 AC 43 ms
49,384 KB
testcase_07 AC 50 ms
49,392 KB
testcase_08 AC 47 ms
49,444 KB
testcase_09 AC 49 ms
49,400 KB
testcase_10 AC 50 ms
49,388 KB
testcase_11 AC 46 ms
49,392 KB
testcase_12 AC 48 ms
49,340 KB
testcase_13 AC 45 ms
49,348 KB
testcase_14 AC 46 ms
49,620 KB
testcase_15 AC 48 ms
49,448 KB
testcase_16 AC 48 ms
49,496 KB
testcase_17 AC 45 ms
49,456 KB
testcase_18 WA -
testcase_19 AC 48 ms
49,832 KB
testcase_20 AC 45 ms
49,632 KB
testcase_21 AC 46 ms
49,404 KB
testcase_22 AC 48 ms
49,336 KB
testcase_23 AC 440 ms
51,856 KB
testcase_24 AC 253 ms
52,120 KB
testcase_25 AC 60 ms
50,884 KB
testcase_26 AC 74 ms
49,408 KB
testcase_27 AC 61 ms
51,096 KB
testcase_28 AC 60 ms
50,488 KB
testcase_29 AC 61 ms
51,124 KB
testcase_30 AC 169 ms
50,792 KB
testcase_31 WA -
testcase_32 AC 251 ms
51,060 KB
testcase_33 WA -
testcase_34 AC 346 ms
51,788 KB
testcase_35 WA -
testcase_36 AC 442 ms
51,144 KB
testcase_37 AC 168 ms
51,156 KB
testcase_38 AC 319 ms
51,052 KB
testcase_39 AC 194 ms
51,296 KB
testcase_40 AC 191 ms
51,028 KB
testcase_41 AC 424 ms
51,140 KB
testcase_42 AC 376 ms
51,924 KB
testcase_43 AC 103 ms
52,256 KB
testcase_44 AC 103 ms
51,068 KB
testcase_45 AC 266 ms
50,928 KB
testcase_46 AC 378 ms
51,852 KB
testcase_47 AC 217 ms
51,248 KB
testcase_48 AC 280 ms
51,368 KB
testcase_49 AC 111 ms
51,416 KB
testcase_50 AC 197 ms
50,992 KB
testcase_51 AC 152 ms
50,872 KB
testcase_52 AC 235 ms
51,068 KB
testcase_53 AC 287 ms
51,132 KB
testcase_54 AC 188 ms
51,088 KB
testcase_55 AC 45 ms
49,452 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Q333_4 {
	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[m];
		int I = 999999999;
		Arrays.fill(dp, I);
		dp[0] = 0;
		for(int i = 1, j = 1;i <= lim;i++,j++){
			if(j == m)j = 0;
			for(int v : a){
				int pj = j-v;
				if(pj < 0)pj += m;
				if(dp[pj] < dp[j]){
					dp[j] = dp[pj];
				}
			}
			dp[j]++;
		}
		if(x <= m*m){
			return dp[(int)(x%m)] >= I ? -1 : dp[(int)(x%m)];
		}else{
			return dp[(int)(x%m)] + (x/m-(m-1));
		}
	}
	
	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_4().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)); }
}
0