結果

問題 No.943 取り調べ
ユーザー hiromi_ayase
提出日時 2019-12-09 00:09:28
言語 Java
(openjdk 23)
結果
AC  
実行時間 300 ms / 1,206 ms
コード長 3,124 bytes
コンパイル時間 2,485 ms
コンパイル使用メモリ 82,940 KB
実行使用メモリ 40,704 KB
最終ジャッジ日時 2025-01-02 21:08:22
合計ジャッジ時間 6,787 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #

public class Main {

  private static void solve() {
    int n = ni();

    int[] x = new int[n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (ni() == 1)
          x[i] |= 1 << j;
      }
    }

    int[] a = na(n);
    int ret = Integer.MAX_VALUE;
    for (int i = 0; i < (1 << n); i++) {
      int state = i;
      for (int p = 0; p < n; p++) {
        for (int q = 0; q < n; q++) {
          if ((state & x[q]) == x[q]) {
            state |= 1 << q;
          }
        }
      }
      if (state == ((1 << n) - 1)) {
        int now = 0;
        for (int j = 0; j < n; j++) {
          if (((i >> j) & 1) == 1) {
            now += a[j];
          }
        }
        ret = Math.min(ret, now);
      }
    }
    System.out.println(ret);
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}

0