結果

問題 No.848 なかよし旅行
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-07-05 22:44:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 654 ms / 2,000 ms
コード長 4,650 bytes
コンパイル時間 2,818 ms
コンパイル使用メモリ 90,912 KB
実行使用メモリ 54,796 KB
最終ジャッジ日時 2024-11-08 00:51:21
合計ジャッジ時間 12,221 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 654 ms
54,796 KB
testcase_01 AC 90 ms
38,028 KB
testcase_02 AC 79 ms
38,288 KB
testcase_03 AC 82 ms
38,308 KB
testcase_04 AC 82 ms
38,064 KB
testcase_05 AC 82 ms
38,296 KB
testcase_06 AC 99 ms
38,768 KB
testcase_07 AC 88 ms
38,372 KB
testcase_08 AC 124 ms
39,972 KB
testcase_09 AC 142 ms
40,704 KB
testcase_10 AC 129 ms
40,004 KB
testcase_11 AC 376 ms
47,352 KB
testcase_12 AC 379 ms
48,396 KB
testcase_13 AC 412 ms
50,996 KB
testcase_14 AC 325 ms
47,500 KB
testcase_15 AC 415 ms
49,376 KB
testcase_16 AC 584 ms
53,556 KB
testcase_17 AC 476 ms
49,468 KB
testcase_18 AC 370 ms
47,704 KB
testcase_19 AC 370 ms
48,608 KB
testcase_20 AC 215 ms
42,172 KB
testcase_21 AC 533 ms
52,568 KB
testcase_22 AC 414 ms
52,584 KB
testcase_23 AC 184 ms
41,072 KB
testcase_24 AC 77 ms
38,056 KB
testcase_25 AC 583 ms
54,536 KB
testcase_26 AC 77 ms
38,056 KB
testcase_27 AC 77 ms
38,244 KB
testcase_28 AC 78 ms
37,980 KB
testcase_29 AC 79 ms
38,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.Comparator;
import java.util.TreeSet;

public class Main {


  private static void solve() {
    int n = ni();
    int m = ni();
    int p = ni() - 1;
    int q = ni() - 1;
    int t = 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);

    long[] ds = dijk(g, 0);
    long[] dp = dijk(g, p);
    long[] dq = dijk(g, q);

    if (ds[p] + dp[q] + dq[0] <= t) {
      System.out.println(t);
      return;
    }

    long ret = -1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        long total = ds[i] + ds[j] + Math.max(dp[i] + dp[j], dq[i] + dq[j]);
        if (total > t)
          continue;
        
        long now = t - Math.max(dp[i] + dp[j], dq[i] + dq[j]);
        if (now > ret) {
          ret = now;
        }

      }
    }
    System.out.println(ret);
  }

  public static long[] dijk(int[][][] g, int from) {
    int n = g.length;
    final long[] td = new long[n];
    Arrays.fill(td, Long.MAX_VALUE);
    TreeSet<Integer> q = new TreeSet<Integer>(new Comparator<Integer>() {
      public int compare(Integer a, Integer b) {
        if (td[a] - td[b] != 0)
          return Long.signum(td[a] - td[b]);
        return a - b;
      }
    });
    q.add(from);
    td[from] = 0;

    while (q.size() > 0) {
      int cur = q.pollFirst();

      for (int i = 0; i < g[cur].length; i++) {
        int next = g[cur][i][0];
        long nd = td[cur] + g[cur][i][1];
        if (nd < td[next]) {
          q.remove(next);
          td[next] = nd;
          q.add(next);
        }
      }
    }

    return td;
  }

  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