結果

問題 No.868 ハイパー部分和問題
ユーザー uwi
提出日時 2019-08-17 14:46:02
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 4,232 bytes
コンパイル時間 4,479 ms
コンパイル使用メモリ 87,280 KB
実行使用メモリ 55,436 KB
最終ジャッジ日時 2024-09-24 19:35:28
合計ジャッジ時間 11,612 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 2
other WA * 38
権限があれば一括ダウンロードができます

ソースコード

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 = "6 26\r\n" + 
            "8 6 9 1 2 0\r\n" + 
            "6\r\n" + 
            "1 9\r\n" + 
            "2 6\r\n" + 
            "3 8\r\n" + 
            "4 5\r\n" + 
            "5 2\r\n" + 
            "6 6\r\n" + 
            "";
    
    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 = 1;
        
        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 ? 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)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0