結果

問題 No.868 ハイパー部分和問題
ユーザー uwiuwi
提出日時 2019-08-16 22:12:10
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,516 bytes
コンパイル時間 5,803 ms
コンパイル使用メモリ 80,416 KB
実行使用メモリ 59,116 KB
最終ジャッジ日時 2023-10-24 16:07:02
合計ジャッジ時間 36,531 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 94 ms
55,132 KB
testcase_01 AC 91 ms
54,860 KB
testcase_02 WA -
testcase_03 AC 86 ms
54,804 KB
testcase_04 AC 68 ms
54,220 KB
testcase_05 AC 81 ms
54,568 KB
testcase_06 AC 83 ms
54,680 KB
testcase_07 AC 77 ms
54,636 KB
testcase_08 AC 80 ms
54,632 KB
testcase_09 AC 80 ms
54,488 KB
testcase_10 AC 81 ms
54,640 KB
testcase_11 AC 81 ms
54,628 KB
testcase_12 AC 68 ms
54,180 KB
testcase_13 AC 67 ms
54,196 KB
testcase_14 AC 1,602 ms
59,108 KB
testcase_15 AC 1,616 ms
59,104 KB
testcase_16 AC 1,619 ms
59,104 KB
testcase_17 AC 1,594 ms
59,116 KB
testcase_18 AC 1,625 ms
59,104 KB
testcase_19 AC 823 ms
56,516 KB
testcase_20 AC 863 ms
56,476 KB
testcase_21 AC 853 ms
56,436 KB
testcase_22 AC 861 ms
54,752 KB
testcase_23 AC 823 ms
56,500 KB
testcase_24 AC 848 ms
56,604 KB
testcase_25 AC 858 ms
56,540 KB
testcase_26 AC 863 ms
56,384 KB
testcase_27 AC 999 ms
56,236 KB
testcase_28 AC 912 ms
56,984 KB
testcase_29 AC 1,345 ms
59,064 KB
testcase_30 AC 1,352 ms
59,104 KB
testcase_31 AC 1,359 ms
59,112 KB
testcase_32 AC 1,602 ms
59,104 KB
testcase_33 AC 1,595 ms
59,104 KB
testcase_34 AC 1,226 ms
56,028 KB
testcase_35 AC 1,282 ms
57,428 KB
testcase_36 AC 1,543 ms
57,064 KB
testcase_37 AC 1,659 ms
59,104 KB
testcase_38 AC 57 ms
53,356 KB
testcase_39 AC 64 ms
51,876 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190816;
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 F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(n);
		int D = 30005;
		long[] dp = new long[D];
		dp[0] = 1;
		for(int v : a){
			if(v == 0)continue;
			for(int i = D-1;i >= v;i--){
				dp[i] += dp[i-v];
			}
		}
		
		for(int Q = ni();Q > 0;Q--){
			int x = ni()-1, v = ni();
			if(a[x] != 0){
				for(int i = a[x];i < D;i++){
					dp[i] -= dp[i-a[x]];
				}
			}
			a[x] = v;
			if(a[x] != 0){
				for(int i = D-1;i >= a[x];i--){
					dp[i] += dp[i-a[x]];
				}
			}
			out.println(dp[K] != 0 ? 1 : 0);
		}
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new F().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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