結果

問題 No.1560 majority x majority
ユーザー 37zigen
提出日時 2021-04-16 13:51:47
言語 Java
(openjdk 23)
結果
AC  
実行時間 706 ms / 2,000 ms
コード長 2,872 bytes
コンパイル時間 2,351 ms
コンパイル使用メモリ 79,008 KB
実行使用メモリ 44,108 KB
最終ジャッジ日時 2024-06-25 07:59:34
合計ジャッジ時間 10,004 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Random;
public class Main {
    public static void main(String[] args) {
        new Main().run();
    }
    
    void run() {
        FastScanner sc = new FastScanner();
        int N=sc.nextInt();
        int M=sc.nextInt();
        boolean[][] S=new boolean[N][M];
        for (int i=0;i<N;++i) {
            for (int j=0;j<M;++j) {
                S[i][j]=sc.nextInt()==1;
            }
        }
        
        long[] dp=new long[1<<M];
        dp[0]=1;
        
        for (int s=0;s<1<<M;++s) {
            boolean[] alive=new boolean[N];
            out:for (int i=0;i<N;++i) {
                for (int j=0;j<M;++j) {
                    if ((s>>j)%2==0) continue;
                    if (!S[i][j]) continue out; 
                }
                alive[i]=true;
            }
            for (int next=0;next<M;++next) {
                if ((s>>next)%2==1) continue;
                int ok=0;
                int ng=0;
                for (int i=0;i<N;++i) {
                    if (!alive[i]) continue;
                    if (S[i][next]) ++ok;
                    else ++ng;
                }
                if (ok>=ng) {
                    dp[s|1<<next] += dp[s];
                }
            }
        }
        System.out.println(dp[(1<<M)-1]);
    }
    static void tr(Object... objects) {
        System.out.println(Arrays.deepToString(objects));
    }
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }
    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }
    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0