結果

問題 No.845 最長の切符
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-06-28 22:42:58
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,139 ms / 3,000 ms
コード長 3,903 bytes
コンパイル時間 3,361 ms
コンパイル使用メモリ 89,324 KB
実行使用メモリ 57,780 KB
最終ジャッジ日時 2024-07-02 05:01:26
合計ジャッジ時間 9,790 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 82 ms
50,868 KB
testcase_01 AC 84 ms
51,264 KB
testcase_02 AC 86 ms
50,988 KB
testcase_03 AC 84 ms
51,308 KB
testcase_04 AC 82 ms
51,268 KB
testcase_05 AC 84 ms
51,308 KB
testcase_06 AC 81 ms
51,324 KB
testcase_07 AC 82 ms
51,008 KB
testcase_08 AC 86 ms
51,348 KB
testcase_09 AC 83 ms
51,264 KB
testcase_10 AC 105 ms
52,060 KB
testcase_11 AC 87 ms
51,304 KB
testcase_12 AC 91 ms
51,548 KB
testcase_13 AC 84 ms
51,428 KB
testcase_14 AC 87 ms
51,404 KB
testcase_15 AC 158 ms
52,364 KB
testcase_16 AC 1,139 ms
57,232 KB
testcase_17 AC 378 ms
54,444 KB
testcase_18 AC 263 ms
54,524 KB
testcase_19 AC 159 ms
52,368 KB
testcase_20 AC 323 ms
57,020 KB
testcase_21 AC 223 ms
57,044 KB
testcase_22 AC 330 ms
54,672 KB
testcase_23 AC 160 ms
52,260 KB
testcase_24 AC 1,024 ms
57,780 KB
testcase_25 AC 80 ms
51,100 KB
testcase_26 AC 111 ms
56,732 KB
testcase_27 AC 81 ms
51,352 KB
testcase_28 AC 126 ms
56,824 KB
testcase_29 AC 77 ms
50,884 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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));
  }
}
0