結果
問題 | No.1284 Flip Game |
ユーザー | ywmt |
提出日時 | 2020-11-06 22:51:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 119 ms / 2,000 ms |
コード長 | 5,516 bytes |
コンパイル時間 | 4,254 ms |
コンパイル使用メモリ | 74,680 KB |
実行使用メモリ | 54,732 KB |
最終ジャッジ日時 | 2023-09-29 19:21:43 |
合計ジャッジ時間 | 6,655 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
49,152 KB |
testcase_01 | AC | 41 ms
49,148 KB |
testcase_02 | AC | 43 ms
49,228 KB |
testcase_03 | AC | 41 ms
48,992 KB |
testcase_04 | AC | 42 ms
49,220 KB |
testcase_05 | AC | 42 ms
49,408 KB |
testcase_06 | AC | 41 ms
49,140 KB |
testcase_07 | AC | 41 ms
49,140 KB |
testcase_08 | AC | 42 ms
49,112 KB |
testcase_09 | AC | 41 ms
49,196 KB |
testcase_10 | AC | 42 ms
49,240 KB |
testcase_11 | AC | 42 ms
49,212 KB |
testcase_12 | AC | 42 ms
49,188 KB |
testcase_13 | AC | 44 ms
49,220 KB |
testcase_14 | AC | 44 ms
49,144 KB |
testcase_15 | AC | 54 ms
50,360 KB |
testcase_16 | AC | 53 ms
49,848 KB |
testcase_17 | AC | 74 ms
52,300 KB |
testcase_18 | AC | 86 ms
52,540 KB |
testcase_19 | AC | 107 ms
54,476 KB |
testcase_20 | AC | 76 ms
52,008 KB |
testcase_21 | AC | 79 ms
51,988 KB |
testcase_22 | AC | 86 ms
50,152 KB |
testcase_23 | AC | 111 ms
54,408 KB |
testcase_24 | AC | 111 ms
54,516 KB |
testcase_25 | AC | 108 ms
54,572 KB |
testcase_26 | AC | 119 ms
54,620 KB |
testcase_27 | AC | 119 ms
54,732 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { static PrintWriter out; static InputReader ir; static void solve() { int n = ir.nextInt(); long[][] c = new long[n][]; for (int i = 0; i < n; i++) c[i] = ir.nextLongArray(n); long[][] dp = new long[n][(int) Math.pow(3, n)]; for (int i = 0; i < n; i++) { Arrays.fill(dp[i], 1L << 60); dp[i][(int) Math.pow(3, i)] = 0; } for (int i = 0; i < Math.pow(3, n); i++) { int[] bit = new int[n]; int mask = i; int ct = 0; for (int j = 0; j < n; j++) { bit[j] = mask % 3; mask /= 3; ct += bit[j]; } for (int j = 0; j < n; j++) { if (bit[j] == 0 || dp[j][i] == 1L << 60) continue; for (int k = 0; k < n; k++) { if (bit[k] == 2 || j == k) continue; dp[k][i + (int) Math.pow(3, k)] = Math.min(dp[k][i + (int) Math.pow(3, k)], dp[j][i] + c[j][k]); } } } long res = 1L << 60; for (int i = 0; i < n; i++) { res = Math.min(res, dp[i][(int) Math.pow(3, n) - 1]); for (int j = 0; j < n; j++) { if (i != j) res = Math.min(res, dp[j][(int) Math.pow(3, n) - 1 - (int) Math.pow(3, i) * 2] + c[j][i]); } } out.println(res); } public static void main(String[] args) { ir = new InputReader(System.in); out = new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer = new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) { this.in = in; this.curbuf = this.lenbuf = 0; } public boolean hasNextByte() { if (curbuf >= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } static void tr(Object... o) { System.err.println(Arrays.deepToString(o)); } }