結果
問題 | No.943 取り調べ |
ユーザー | uwi |
提出日時 | 2019-12-05 22:09:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 102 ms / 1,206 ms |
コード長 | 3,826 bytes |
コンパイル時間 | 3,634 ms |
コンパイル使用メモリ | 79,888 KB |
実行使用メモリ | 52,184 KB |
最終ジャッジ日時 | 2023-08-24 17:03:44 |
合計ジャッジ時間 | 6,044 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,612 KB |
testcase_01 | AC | 42 ms
49,296 KB |
testcase_02 | AC | 42 ms
49,448 KB |
testcase_03 | AC | 42 ms
49,544 KB |
testcase_04 | AC | 71 ms
51,688 KB |
testcase_05 | AC | 74 ms
51,832 KB |
testcase_06 | AC | 73 ms
49,796 KB |
testcase_07 | AC | 42 ms
49,396 KB |
testcase_08 | AC | 98 ms
52,184 KB |
testcase_09 | AC | 62 ms
51,472 KB |
testcase_10 | AC | 61 ms
51,952 KB |
testcase_11 | AC | 62 ms
50,004 KB |
testcase_12 | AC | 41 ms
49,340 KB |
testcase_13 | AC | 43 ms
49,292 KB |
testcase_14 | AC | 42 ms
49,164 KB |
testcase_15 | AC | 43 ms
49,264 KB |
testcase_16 | AC | 42 ms
49,804 KB |
testcase_17 | AC | 71 ms
51,924 KB |
testcase_18 | AC | 42 ms
49,264 KB |
testcase_19 | AC | 42 ms
49,620 KB |
testcase_20 | AC | 43 ms
49,656 KB |
testcase_21 | AC | 42 ms
49,240 KB |
testcase_22 | AC | 77 ms
51,708 KB |
testcase_23 | AC | 102 ms
51,672 KB |
ソースコード
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class AdvD6 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int[][] a = new int[n][]; for(int i = 0;i < n;i++) { a[i] = na(n); } int[] g = new int[n]; for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { g[i] |= a[i][j]<<j; } } int[] w = na(n); long ans = 999999999; int[] dp = new int[1<<n]; for(int i = 1;i < 1<<n;i++) { dp[i] = dp[i&i-1] + w[Integer.numberOfTrailingZeros(i)]; } for(int i = 0;i < 1<<n;i++) { if(dp[i] >= ans)continue; int fact = i; int paint = 0; while(true) { boolean ch = false; for(int k = ~paint;k != 0;k&=k-1) { int j = Integer.numberOfTrailingZeros(k); if(j >= n)break; if((fact&g[j]) == g[j]) { paint |= 1<<j; fact |= 1<<j; ch = true; } } if(!ch)break; } if(paint + 1 == 1<<n){ ans = dp[i]; } } out.println(ans); } 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 AdvD6().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)); } }