結果

問題 No.807 umg tours
コンテスト
ユーザー Oland
提出日時 2019-03-23 01:51:27
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 4,778 bytes
コンパイル時間 2,759 ms
コンパイル使用メモリ 86,096 KB
実行使用メモリ 165,460 KB
最終ジャッジ日時 2024-09-19 11:08:54
合計ジャッジ時間 28,533 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other WA * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {
	
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	//PrintWriter out;
	final int MOD = (int)1e9+7;
	final int INF = Integer.MAX_VALUE / 2;
		
	/* solve */
	
	void solve() throws Exception{
		int N = sc.nextInt();
		int M = sc.nextInt();
		ArrayList<ArrayList<Edge>> G = new ArrayList<ArrayList<Edge>>();
		ArrayList<Edge> pathList = new ArrayList<Edge>();
		for(int i = 0; i < N; i++) G.add(new ArrayList<Edge>());
		for(int i = 0; i < M; i++){
			int a = sc.nextInt()-1, b = sc.nextInt()-1;
			long c = sc.nextLong();
			G.get(a).add(new Edge(a, b, c)); G.get(b).add(new Edge(b, a, c));
			pathList.add(new Edge(a, b, c)); pathList.add(new Edge(b, a, c));
		}
		
		long[] dist1 = dijkstra(G, 0);
		
		for(int i = 0; i < N; i++) G.add(new ArrayList<Edge>());
		for(Edge e : pathList){
			G.get(e.from).add(new Edge(e.from, e.to + N, 0));
			G.get(e.from + N).add(new Edge(e.from + N, e.to + N, e.cost));
			//G.get(e.to).add(new Edge(e.to, e.to + N, 0));
		}
		
		long[] dist2 = dijkstra(G, 0);
		
		for(int i = 0; i < N; i++){
			System.out.println((dist1[i] + dist2[i+N]));
		}
		
	}
	
	long[] dijkstra(ArrayList<ArrayList<Edge>> G, int start){
		long[] dist = new long[G.size()];
		Arrays.fill(dist, Long.MAX_VALUE / 2);
		dist[start] = 0;
		PriorityQueue<Node> priorityQueue = new PriorityQueue<Node>((n1, n2)->(n1.cost == n2.cost) ? 0 : (n1.cost < n2.cost) ? -1 : 1);
		priorityQueue.add(new Node(start, 0));
		
		while(!priorityQueue.isEmpty()){
			Node node = priorityQueue.poll();
			if(dist[node.index] < node.cost) continue;
			for(Edge e : G.get(node.index)){
				if(dist[e.to] > dist[node.index] + e.cost){
					dist[e.to] = dist[node.index] + e.cost;
					priorityQueue.add(new Node(e.to, dist[e.to]));
				}
			}
		}
		
		return dist;
	}
	
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		//out = new PrintWriter(System.out);
		solve();
		//out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%8d ms", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class Node{
	int index;
	long cost;
	public Node(int i, long c){
		index = i; cost = c;
	}
}

class Edge{
	int from;
	int to;
	long cost;
	public Edge(int f, int t, long c){
		from = f; to = t; cost = c;
	}
}

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    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());
    }
}
0