結果

問題 No.792 真理関数をつくろう
ユーザー OlandOland
提出日時 2019-10-29 21:12:15
言語 Java21
(openjdk 21)
結果
AC  
実行時間 221 ms / 2,000 ms
コード長 6,613 bytes
コンパイル時間 3,137 ms
コンパイル使用メモリ 91,088 KB
実行使用メモリ 46,832 KB
最終ジャッジ日時 2024-09-14 21:36:21
合計ジャッジ時間 6,497 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
38,200 KB
testcase_01 AC 120 ms
40,256 KB
testcase_02 AC 64 ms
37,912 KB
testcase_03 AC 135 ms
40,952 KB
testcase_04 AC 63 ms
38,044 KB
testcase_05 AC 134 ms
41,836 KB
testcase_06 AC 203 ms
46,372 KB
testcase_07 AC 94 ms
38,756 KB
testcase_08 AC 62 ms
38,096 KB
testcase_09 AC 67 ms
38,184 KB
testcase_10 AC 65 ms
37,812 KB
testcase_11 AC 63 ms
38,224 KB
testcase_12 AC 71 ms
38,232 KB
testcase_13 AC 63 ms
38,052 KB
testcase_14 AC 63 ms
37,796 KB
testcase_15 AC 80 ms
38,552 KB
testcase_16 AC 148 ms
44,640 KB
testcase_17 AC 78 ms
38,212 KB
testcase_18 AC 64 ms
38,080 KB
testcase_19 AC 63 ms
37,732 KB
testcase_20 AC 139 ms
44,504 KB
testcase_21 AC 221 ms
46,832 KB
testcase_22 AC 63 ms
38,112 KB
testcase_23 AC 64 ms
37,832 KB
testcase_24 AC 63 ms
37,916 KB
testcase_25 AC 66 ms
38,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main implements Runnable{
    private FastScanner in;
    private PrintWriter out;
    final int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b; /*オーバーフローに注意*/}

    private void solve() {
        int N = in.nextInt();
        ArrayList<ArrayList<Boolean>> list = new ArrayList<>();
        boolean[][] Q = new boolean[1<<N][N];
        boolean[] R = new boolean[1<<N];
        int num = 0;
        for(int i = 0; i < 1<<N; i++){
            for(int j = 0; j < N; j++) Q[i][j] = in.nextStr().equals("1");
            R[i] = in.nextStr().equals("1");
            if(!R[i]) continue;
            num++;
            list.add(new ArrayList<>());
            for(int j = 0; j < N; j++) list.get(num-1).add(Q[i][j]);
        }

        if(num == 1<<N){
            out.println("A=⊤");
            return;
        }
        if(num == 0){
            out.println("A=⊥");
            return;
        }

        out.print("A=");
        for(int i = 0; i < list.size(); i++){
            out.print("(");
            for(int j = 0; j < N; j++){
                out.print(list.get(i).get(j) ? "P_" : "¬P_");
                out.print((j+1));
                if(j != N-1) out.print("∧");
            }
            out.print(")");
            if(i != (list.size()-1)) out.print("∨");
        }
        out.println();
    }
    //end solve

    public static void main(String[] args) {
        Thread.setDefaultUncaughtExceptionHandler((t,e)->System.exit(1));
        new Thread(null, new Main(), "", 16L * 1024 * 1024).start();
    }

    public void run() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }

    static class FastScanner {
        Reader input;

        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}

        int nextInt() {return (int) nextLong();}

        long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0