結果
問題 | No.788 トラックの移動 |
ユーザー | 37zigen |
提出日時 | 2020-04-07 23:25:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 961 ms / 2,000 ms |
コード長 | 4,298 bytes |
コンパイル時間 | 2,711 ms |
コンパイル使用メモリ | 80,796 KB |
実行使用メモリ | 49,000 KB |
最終ジャッジ日時 | 2024-12-15 07:06:52 |
合計ジャッジ時間 | 9,371 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 834 ms
46,800 KB |
testcase_01 | AC | 65 ms
37,964 KB |
testcase_02 | AC | 65 ms
37,972 KB |
testcase_03 | AC | 67 ms
37,760 KB |
testcase_04 | AC | 479 ms
48,264 KB |
testcase_05 | AC | 961 ms
49,000 KB |
testcase_06 | AC | 843 ms
46,756 KB |
testcase_07 | AC | 66 ms
37,448 KB |
testcase_08 | AC | 67 ms
37,852 KB |
testcase_09 | AC | 65 ms
37,596 KB |
testcase_10 | AC | 67 ms
37,988 KB |
testcase_11 | AC | 66 ms
37,564 KB |
testcase_12 | AC | 68 ms
37,864 KB |
testcase_13 | AC | 65 ms
37,560 KB |
testcase_14 | AC | 66 ms
37,524 KB |
testcase_15 | AC | 335 ms
46,316 KB |
testcase_16 | AC | 712 ms
46,172 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.NoSuchElementException; import java.util.PriorityQueue; class Edge { int src,dst,cst; public Edge(int src_,int dst_,int cst_) { src=src_; dst=dst_; cst=cst_; } } public class Main { public static void main(String[] args) { new Main().run(); } long[] dijk(int src,ArrayList<Edge>[] g) { int N=g.length; long INF=Long.MAX_VALUE/3; long[] dist=new long[N]; Arrays.fill(dist, INF); dist[src]=0; class State implements Comparable<State>{ int v; long d; public State(int v_, long d_) { v=v_;d=d_; } public int compareTo(State o) {return Long.compare(d, o.d);}; } PriorityQueue<State> pq=new PriorityQueue<>(); pq.add(new State(src,0)); while(!pq.isEmpty()) { State state=pq.poll(); if(state.d>dist[state.v]) continue; for(Edge e:g[state.v]) { if(dist[state.v]+e.cst<dist[e.dst]) { dist[e.dst]=dist[state.v]+e.cst; pq.add(new State(e.dst,dist[e.dst])); } } } return dist; } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int M=sc.nextInt(); int L=sc.nextInt()-1; int[] t=new int[N]; for(int i=0;i<N;++i) t[i]=sc.nextInt(); ArrayList<Edge>[] g=new ArrayList[N]; for(int i=0;i<N;++i) g[i]=new ArrayList<>(); for(int i=0;i<M;++i) { int a=sc.nextInt()-1; int b=sc.nextInt()-1; int c=sc.nextInt(); g[a].add(new Edge(a,b,c)); g[b].add(new Edge(b,a,c)); } if(Arrays.stream(t).max().getAsInt()==Arrays.stream(t).sum()) { System.out.println(0); return; } long ans=Long.MAX_VALUE/3; long[] dist_src=dijk(L, g); for(int dst=0;dst<N;++dst) { long sum=0; long[] dist=dijk(dst, g); for(int i=0;i<N;++i) { sum+=2*dist[i]*t[i]; } ans=Math.min(ans,sum-dist[L]*Math.min(t[L], 1)); if(t[L]==0) { for(int middle=0;middle<N;++middle) { if(t[middle]>0) { ans=Math.min(ans,sum-dist[middle]+dist_src[middle]); }else { ans=Math.min(ans,sum+dist[dst]); } } } } System.out.println(ans); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }