結果

問題 No.137 貯金箱の焦り
ユーザー uwiuwi
提出日時 2015-02-20 02:08:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,127 ms / 5,000 ms
コード長 3,880 bytes
コンパイル時間 3,673 ms
コンパイル使用メモリ 87,076 KB
実行使用メモリ 41,148 KB
最終ジャッジ日時 2024-04-25 11:43:44
合計ジャッジ時間 14,497 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 117 ms
40,460 KB
testcase_01 AC 119 ms
40,236 KB
testcase_02 AC 177 ms
40,436 KB
testcase_03 AC 67 ms
37,916 KB
testcase_04 AC 192 ms
40,400 KB
testcase_05 AC 153 ms
40,804 KB
testcase_06 AC 191 ms
40,524 KB
testcase_07 AC 169 ms
40,316 KB
testcase_08 AC 168 ms
40,316 KB
testcase_09 AC 193 ms
40,300 KB
testcase_10 AC 208 ms
41,112 KB
testcase_11 AC 155 ms
40,632 KB
testcase_12 AC 1,127 ms
40,316 KB
testcase_13 AC 248 ms
40,560 KB
testcase_14 AC 843 ms
40,588 KB
testcase_15 AC 746 ms
40,320 KB
testcase_16 AC 789 ms
40,308 KB
testcase_17 AC 446 ms
40,416 KB
testcase_18 AC 520 ms
40,564 KB
testcase_19 AC 821 ms
40,288 KB
testcase_20 AC 177 ms
40,776 KB
testcase_21 AC 537 ms
40,320 KB
testcase_22 AC 243 ms
41,148 KB
testcase_23 AC 236 ms
40,316 KB
testcase_24 AC 390 ms
40,472 KB
testcase_25 AC 628 ms
40,548 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Q192 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni();
		long m = nl();
		int[] a = na(n);
		
		int mod = 1234567891;
		long[] dp = new long[500*50*2+1];
		dp[0] = 1;
		while(m > 0){
			for(int j = 0;j < n;j++){
				for(int k = dp.length-1;k >= a[j];k--){
					dp[k] += dp[k-a[j]];
					if(dp[k] >= mod)dp[k] -= mod;
				}
			}
			if((m&1) == 0){
				int j = 0, k = 0;
				for(;k < dp.length;j++,k+=2){
					dp[j] = dp[k];
				}
				while(j < dp.length){
					dp[j++] = 0L;
				}
			}else{
				int j = 0, k = 1;
				for(;k < dp.length;j++,k+=2){
					dp[j] = dp[k];
				}
				while(j < dp.length){
					dp[j++] = 0L;
				}
			}
			m>>>=1;
		}
		out.println(dp[0]);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0