結果
| 問題 | No.943 取り調べ |
| ユーザー |
 Oland
|
| 提出日時 | 2019-12-06 17:46:29 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 94 ms / 1,206 ms |
| コード長 | 7,164 bytes |
| コンパイル時間 | 3,838 ms |
| コンパイル使用メモリ | 75,388 KB |
| 実行使用メモリ | 51,964 KB |
| 最終ジャッジ日時 | 2023-08-25 00:58:57 |
| 合計ジャッジ時間 | 4,866 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 41 ms
47,876 KB |
| testcase_01 | AC | 41 ms
49,420 KB |
| testcase_02 | AC | 41 ms
49,692 KB |
| testcase_03 | AC | 41 ms
49,420 KB |
| testcase_04 | AC | 93 ms
51,216 KB |
| testcase_05 | AC | 91 ms
51,176 KB |
| testcase_06 | AC | 91 ms
51,568 KB |
| testcase_07 | AC | 41 ms
49,352 KB |
| testcase_08 | AC | 94 ms
51,096 KB |
| testcase_09 | AC | 63 ms
51,564 KB |
| testcase_10 | AC | 63 ms
50,696 KB |
| testcase_11 | AC | 64 ms
51,964 KB |
| testcase_12 | AC | 41 ms
49,420 KB |
| testcase_13 | AC | 41 ms
49,540 KB |
| testcase_14 | AC | 42 ms
49,348 KB |
| testcase_15 | AC | 42 ms
49,532 KB |
| testcase_16 | AC | 40 ms
49,224 KB |
| testcase_17 | AC | 64 ms
50,860 KB |
| testcase_18 | AC | 41 ms
49,300 KB |
| testcase_19 | AC | 41 ms
49,352 KB |
| testcase_20 | AC | 41 ms
49,692 KB |
| testcase_21 | AC | 40 ms
49,404 KB |
| testcase_22 | AC | 62 ms
51,384 KB |
| testcase_23 | AC | 93 ms
51,232 KB |
ソースコード
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
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;}
void solve() {
int n = in.nextInt();
int[] mask = new int[n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(in.nextChar() == '1') mask[i] |= 1 << j;
}
}
int[] A = in.nextIntArray(n);
int[] dp = new int[1<<n];
int INF = Integer.MAX_VALUE / 2;
Arrays.fill(dp, INF);
dp[(1<<n)-1] = 0;
for(int s = (1 << n) - 2; s >= 0; s--){
for(int t = 0; t < n; t++){
if(((s >> t) & 1) != 0) continue;
int nextS = s | (1 << t);
int cost = ((s & mask[t]) == mask[t]) ? 0 : A[t];
dp[s] = Math.min(dp[s], dp[nextS] + cost);
}
}
out.println(dp[0]);
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "output.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public 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;
}
}
public 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;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public 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 String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
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;
}
}
}