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

提出ソース

結果

問題	No.288 貯金箱の仕事
ユーザー	uwi
提出日時	2015-10-09 23:13:41
言語	Java21 (openjdk 21)
結果	WA (最新) AC (最初)
実行時間	-
コード長	4,454 bytes
コンパイル時間	4,672 ms
コンパイル使用メモリ	89,736 KB
実行使用メモリ	38,352 KB
最終ジャッジ日時	2024-07-20 04:34:00
合計ジャッジ時間	9,406 ms
ジャッジサーバーID （参考情報）	judge1 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	56 ms 36,712 KB
testcase_01	AC	53 ms 36,676 KB
testcase_02	AC	55 ms 36,908 KB
testcase_03	AC	54 ms 36,732 KB
testcase_04	AC	54 ms 36,756 KB
testcase_05	AC	53 ms 36,460 KB
testcase_06	AC	53 ms 36,748 KB
testcase_07	AC	54 ms 36,508 KB
testcase_08	AC	56 ms 36,720 KB
testcase_09	AC	55 ms 36,816 KB
testcase_10	AC	56 ms 36,876 KB
testcase_11	AC	56 ms 36,552 KB
testcase_12	AC	55 ms 36,884 KB
testcase_13	AC	57 ms 36,516 KB
testcase_14	AC	54 ms 36,576 KB
testcase_15	AC	58 ms 36,512 KB
testcase_16	AC	55 ms 36,512 KB
testcase_17	AC	56 ms 36,500 KB
testcase_18	AC	57 ms 36,888 KB
testcase_19	AC	54 ms 36,824 KB
testcase_20	AC	56 ms 36,824 KB
testcase_21	AC	56 ms 36,420 KB
testcase_22	AC	58 ms 36,728 KB
testcase_23	AC	85 ms 37,908 KB
testcase_24	AC	66 ms 36,816 KB
testcase_25	AC	56 ms 36,504 KB
testcase_26	AC	58 ms 36,816 KB
testcase_27	AC	55 ms 36,488 KB
testcase_28	AC	56 ms 36,740 KB
testcase_29	AC	56 ms 36,832 KB
testcase_30	AC	63 ms 36,664 KB
testcase_31	AC	60 ms 36,696 KB
testcase_32	AC	77 ms 37,276 KB
testcase_33	AC	75 ms 37,056 KB
testcase_34	AC	79 ms 37,012 KB
testcase_35	AC	79 ms 37,660 KB
testcase_36	AC	87 ms 38,084 KB
testcase_37	AC	68 ms 37,304 KB
testcase_38	AC	76 ms 37,812 KB
testcase_39	AC	73 ms 37,176 KB
testcase_40	AC	74 ms 37,312 KB
testcase_41	AC	94 ms 37,884 KB
testcase_42	AC	88 ms 38,352 KB
testcase_43	AC	74 ms 37,376 KB
testcase_44	AC	59 ms 36,680 KB
testcase_45	AC	75 ms 37,604 KB
testcase_46	AC	94 ms 38,052 KB
testcase_47	AC	73 ms 37,236 KB
testcase_48	AC	76 ms 37,112 KB
testcase_49	AC	65 ms 37,080 KB
testcase_50	AC	71 ms 37,072 KB
testcase_51	AC	68 ms 36,676 KB
testcase_52	AC	74 ms 37,016 KB
testcase_53	AC	88 ms 37,712 KB
testcase_54	AC	75 ms 37,076 KB
testcase_55	WA	-

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

ソースコード

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;
		}
		long rem = all - m;
		int[] rep2 = representable2(a);
		int[] rep = representable(a);
		int lim = rep[(int)(rem%a[n-1])];
		if(rem/a[n-1] >= lim){
			out.println(rep2[(int)(rem%a[n-1])] + rem/a[n-1]);
		}else{
			out.println(-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]){
						d[nex] = d[cur];
						q.addFirst(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

結果

テストケース

ソースコード