結果

問題 No.868 ハイパー部分和問題
ユーザー uwiuwi
提出日時 2019-08-17 14:44:12
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,098 bytes
コンパイル時間 4,069 ms
コンパイル使用メモリ 81,656 KB
実行使用メモリ 59,180 KB
最終ジャッジ日時 2023-10-25 00:29:27
合計ジャッジ時間 72,902 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 146 ms
39,896 KB
testcase_01 AC 140 ms
39,784 KB
testcase_02 AC 182 ms
39,936 KB
testcase_03 AC 130 ms
39,808 KB
testcase_04 AC 114 ms
39,888 KB
testcase_05 AC 115 ms
39,760 KB
testcase_06 AC 116 ms
39,788 KB
testcase_07 AC 116 ms
39,792 KB
testcase_08 AC 128 ms
39,992 KB
testcase_09 AC 114 ms
39,704 KB
testcase_10 AC 116 ms
39,776 KB
testcase_11 AC 122 ms
39,604 KB
testcase_12 AC 116 ms
39,504 KB
testcase_13 AC 128 ms
39,924 KB
testcase_14 AC 5,699 ms
41,864 KB
testcase_15 AC 6,586 ms
42,464 KB
testcase_16 AC 6,249 ms
43,324 KB
testcase_17 AC 6,492 ms
42,580 KB
testcase_18 AC 5,940 ms
59,036 KB
testcase_19 AC 1,116 ms
57,952 KB
testcase_20 AC 1,057 ms
57,856 KB
testcase_21 AC 1,034 ms
58,108 KB
testcase_22 AC 1,079 ms
58,008 KB
testcase_23 AC 1,059 ms
56,824 KB
testcase_24 AC 1,148 ms
57,848 KB
testcase_25 AC 1,054 ms
57,812 KB
testcase_26 AC 1,208 ms
58,976 KB
testcase_27 AC 1,204 ms
58,012 KB
testcase_28 AC 1,124 ms
58,548 KB
testcase_29 AC 800 ms
59,128 KB
testcase_30 AC 799 ms
59,180 KB
testcase_31 AC 891 ms
59,064 KB
testcase_32 AC 1,353 ms
59,132 KB
testcase_33 AC 1,533 ms
59,108 KB
testcase_34 TLE -
testcase_35 AC 6,429 ms
58,696 KB
testcase_36 AC 1,466 ms
59,076 KB
testcase_37 AC 1,448 ms
59,168 KB
testcase_38 AC 118 ms
56,588 KB
testcase_39 AC 115 ms
56,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190816;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	long[] mods;
	
	void solve()
	{
		mods = new long[2];
		Random gen = new Random();
		for(int i = 0;i < 2;i++){
			mods[i] = BigInteger.probablePrime(60, gen).longValue();
		}
		int Z = 2;
		
		int n = ni(), K = ni();
		int[] a = na(n);
		int D = 15005;
		long[][] dp = new long[Z][D];
		for(int k = 0;k < Z;k++){
			dp[k][0] = 1;
		}
		for(int v : a){
			if(v == 0)continue;
			for(int k = 0;k < Z;k++){
				for(int i = D-1;i >= v;i--){
					dp[k][i] += dp[k][i-v];
					if(dp[k][i] >= mods[k])dp[k][i] -= mods[k];
				}
			}
		}
		
		for(int Q = ni();Q > 0;Q--){
			int x = ni()-1, v = ni();
			if(a[x] != 0){
				for(int k = 0;k < Z;k++){
					for(int i = a[x];i < D;i++){
						dp[k][i] += mods[k] - dp[k][i-a[x]];
						if(dp[k][i] >= mods[k])dp[k][i] -= mods[k];
					}
				}
			}
			a[x] = v;
			if(a[x] != 0){
				for(int k = 0;k < Z;k++){
					for(int i = D-1;i >= a[x];i--){
						dp[k][i] += dp[k][i-a[x]];
						if(dp[k][i] >= mods[k])dp[k][i] -= mods[k];
					}
				}
			}
			out.println(dp[0][K] != 0 && dp[1][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