結果

問題 No.288 貯金箱の仕事
ユーザー uwiuwi
提出日時 2015-10-11 21:59:57
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,600 bytes
コンパイル時間 4,310 ms
コンパイル使用メモリ 80,788 KB
実行使用メモリ 38,228 KB
最終ジャッジ日時 2024-07-21 06:55:44
合計ジャッジ時間 15,112 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
36,572 KB
testcase_01 AC 54 ms
36,884 KB
testcase_02 AC 54 ms
36,548 KB
testcase_03 AC 53 ms
36,452 KB
testcase_04 AC 54 ms
36,516 KB
testcase_05 AC 53 ms
36,044 KB
testcase_06 AC 53 ms
36,776 KB
testcase_07 AC 57 ms
36,604 KB
testcase_08 AC 54 ms
36,720 KB
testcase_09 AC 57 ms
36,452 KB
testcase_10 AC 57 ms
36,136 KB
testcase_11 AC 54 ms
36,552 KB
testcase_12 AC 56 ms
36,724 KB
testcase_13 AC 56 ms
36,608 KB
testcase_14 AC 56 ms
36,704 KB
testcase_15 AC 58 ms
36,828 KB
testcase_16 AC 57 ms
36,740 KB
testcase_17 AC 55 ms
36,596 KB
testcase_18 WA -
testcase_19 AC 56 ms
36,060 KB
testcase_20 AC 55 ms
36,468 KB
testcase_21 AC 54 ms
36,608 KB
testcase_22 AC 57 ms
36,728 KB
testcase_23 AC 502 ms
37,768 KB
testcase_24 AC 290 ms
37,788 KB
testcase_25 AC 80 ms
37,320 KB
testcase_26 AC 83 ms
37,248 KB
testcase_27 AC 81 ms
37,180 KB
testcase_28 AC 83 ms
36,920 KB
testcase_29 AC 82 ms
37,680 KB
testcase_30 AC 193 ms
38,116 KB
testcase_31 WA -
testcase_32 AC 292 ms
37,440 KB
testcase_33 WA -
testcase_34 AC 400 ms
37,956 KB
testcase_35 WA -
testcase_36 AC 507 ms
37,940 KB
testcase_37 AC 197 ms
37,596 KB
testcase_38 AC 367 ms
37,420 KB
testcase_39 AC 216 ms
37,808 KB
testcase_40 AC 222 ms
37,984 KB
testcase_41 AC 483 ms
37,900 KB
testcase_42 AC 435 ms
38,128 KB
testcase_43 AC 118 ms
37,920 KB
testcase_44 AC 107 ms
38,228 KB
testcase_45 AC 315 ms
37,964 KB
testcase_46 AC 437 ms
37,824 KB
testcase_47 AC 250 ms
37,588 KB
testcase_48 AC 321 ms
37,596 KB
testcase_49 AC 116 ms
37,852 KB
testcase_50 AC 223 ms
37,900 KB
testcase_51 AC 173 ms
37,796 KB
testcase_52 AC 267 ms
37,824 KB
testcase_53 AC 325 ms
37,596 KB
testcase_54 AC 213 ms
37,904 KB
testcase_55 AC 52 ms
36,436 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