結果
問題 | No.845 最長の切符 |
ユーザー | hiromi_ayase |
提出日時 | 2019-06-28 22:42:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,267 ms / 3,000 ms |
コード長 | 3,903 bytes |
コンパイル時間 | 2,643 ms |
コンパイル使用メモリ | 83,840 KB |
実行使用メモリ | 57,940 KB |
最終ジャッジ日時 | 2023-09-14 22:26:27 |
合計ジャッジ時間 | 9,448 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
51,344 KB |
testcase_01 | AC | 70 ms
50,944 KB |
testcase_02 | AC | 72 ms
50,808 KB |
testcase_03 | AC | 69 ms
50,836 KB |
testcase_04 | AC | 69 ms
50,972 KB |
testcase_05 | AC | 69 ms
50,800 KB |
testcase_06 | AC | 69 ms
50,928 KB |
testcase_07 | AC | 70 ms
50,840 KB |
testcase_08 | AC | 73 ms
51,024 KB |
testcase_09 | AC | 70 ms
50,804 KB |
testcase_10 | AC | 93 ms
53,108 KB |
testcase_11 | AC | 77 ms
51,564 KB |
testcase_12 | AC | 80 ms
51,256 KB |
testcase_13 | AC | 76 ms
50,900 KB |
testcase_14 | AC | 78 ms
51,144 KB |
testcase_15 | AC | 143 ms
52,996 KB |
testcase_16 | AC | 1,267 ms
57,940 KB |
testcase_17 | AC | 391 ms
55,816 KB |
testcase_18 | AC | 243 ms
55,016 KB |
testcase_19 | AC | 148 ms
52,756 KB |
testcase_20 | AC | 298 ms
57,704 KB |
testcase_21 | AC | 199 ms
57,036 KB |
testcase_22 | AC | 349 ms
55,724 KB |
testcase_23 | AC | 156 ms
53,528 KB |
testcase_24 | AC | 1,049 ms
57,372 KB |
testcase_25 | AC | 71 ms
51,316 KB |
testcase_26 | AC | 101 ms
57,252 KB |
testcase_27 | AC | 69 ms
50,808 KB |
testcase_28 | AC | 114 ms
57,288 KB |
testcase_29 | AC | 70 ms
50,852 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int m = ni(); int[] from = new int[m]; int[] to = new int[m]; int[] w = new int[m]; for (int i = 0; i < m; i++) { from[i] = ni() - 1; to[i] = ni() - 1; w[i] = ni(); } int[][][] g = packWU(n, from, to, w); int[][] dp = new int[1 << n][n]; for (int[] v : dp) Arrays.fill(v, Integer.MIN_VALUE / 10); for (int u = 0; u < n; u++) { dp[1 << u][u] = 0; } for (int i = 0; i < (1 << n); i++) { for (int u = 0; u < n; u++) { for (int[] k : g[u]) { int v = k[0]; int c = k[1]; // u->v if (((i >> v) & 1) == 0) { dp[i | (1 << v)][v] = Math.max(dp[i | (1 << v)][v], dp[i][u] + c); } } } } int ret = 0; for (int i = 0; i < (1 << n); i++) { for (int u = 0; u < n; u++) { ret = Math.max(ret, dp[i][u]); } } System.out.println(ret); } public static int[][][] packWU(int n, int[] from, int[] to, int[] w) { int[][][] g = new int[n][][]; int[] p = new int[n]; for (int f : from) p[f]++; for (int t : to) p[t]++; for (int i = 0; i < n; i++) g[i] = new int[p[i]][2]; for (int i = 0; i < from.length; i++) { --p[from[i]]; g[from[i]][p[from[i]]][0] = to[i]; g[from[i]][p[from[i]]][1] = w[i]; --p[to[i]]; g[to[i]][p[to[i]]][0] = from[i]; g[to[i]][p[to[i]]][1] = w[i]; } return g; } 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)); } }