結果

問題 No.1812 Uribo Road
ユーザー tenten
提出日時 2023-04-13 11:44:29
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 3,081 bytes
コンパイル時間 2,975 ms
コンパイル使用メモリ 85,044 KB
実行使用メモリ 335,688 KB
最終ジャッジ日時 2024-10-09 10:24:06
合計ジャッジ時間 11,955 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 8 TLE * 1 -- * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int m = sc.nextInt();
int k = sc.nextInt();
int[] uMasks = new int[m];
for (int i = 0; i < k; i++) {
uMasks[sc.nextInt() - 1] = (1 << i);
}
ArrayList<ArrayList<Path>> graph = new ArrayList<>();
for (int i = 0; i < n; i++) {
graph.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
int c = sc.nextInt();
graph.get(a).add(new Path(b, c, uMasks[i]));
graph.get(b).add(new Path(a, c, uMasks[i]));
}
PriorityQueue<Path> queue = new PriorityQueue<>();
queue.add(new Path(0, 0, 0));
int[][] costs = new int[n][1 << k];
for (int[] arr : costs) {
Arrays.fill(arr, Integer.MAX_VALUE);
}
while (queue.size() > 0) {
Path p = queue.poll();
if (costs[p.idx][p.uri] <= p.value) {
continue;
}
costs[p.idx][p.uri] = p.value;
for (Path x : graph.get(p.idx)) {
queue.add(new Path(x.idx, x.value + p.value, x.uri | p.uri));
}
}
System.out.println(costs[n - 1][(1 << k) - 1]);
}
static class Path implements Comparable<Path> {
int idx;
int value;
int uri;
public Path(int idx, int value, int uri) {
this.idx = idx;
this.value = value;
this.uri = uri;
}
public int compareTo(Path another) {
return value - another.value;
}
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0