結果

問題 No.807 umg tours
ユーザー GrenacheGrenache
提出日時 2019-04-28 22:39:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,458 ms / 4,000 ms
コード長 7,993 bytes
コンパイル時間 6,230 ms
コンパイル使用メモリ 80,840 KB
実行使用メモリ 116,980 KB
最終ジャッジ日時 2024-05-02 23:50:40
合計ジャッジ時間 22,232 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
37,544 KB
testcase_01 AC 58 ms
37,148 KB
testcase_02 AC 64 ms
37,836 KB
testcase_03 AC 63 ms
38,084 KB
testcase_04 AC 54 ms
37,008 KB
testcase_05 AC 58 ms
37,412 KB
testcase_06 AC 64 ms
37,700 KB
testcase_07 AC 71 ms
37,840 KB
testcase_08 AC 52 ms
37,264 KB
testcase_09 AC 52 ms
37,384 KB
testcase_10 AC 52 ms
37,072 KB
testcase_11 AC 1,103 ms
86,624 KB
testcase_12 AC 1,031 ms
92,196 KB
testcase_13 AC 1,181 ms
101,416 KB
testcase_14 AC 697 ms
69,008 KB
testcase_15 AC 562 ms
66,696 KB
testcase_16 AC 1,397 ms
103,240 KB
testcase_17 AC 1,442 ms
116,612 KB
testcase_18 AC 1,406 ms
116,980 KB
testcase_19 AC 1,458 ms
116,708 KB
testcase_20 AC 975 ms
90,984 KB
testcase_21 AC 1,078 ms
88,596 KB
testcase_22 AC 559 ms
63,348 KB
testcase_23 AC 470 ms
58,716 KB
testcase_24 AC 1,139 ms
108,608 KB
testcase_25 AC 1,368 ms
116,964 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder807 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();

		int[] a = new int[m];
		int[] b = new int[m];
		int[] c = new int[m];
		for (int i = 0; i < m; i++) {
			a[i] = sc.nextInt() - 1;
			b[i] = sc.nextInt() - 1;
			c[i] = sc.nextInt();
		}

		Dijkstra di = new Dijkstra(n);
		for (int i = 0; i < m; i++) {
			di.addEdge(a[i], b[i], c[i]);
			di.addEdge(b[i], a[i], c[i]);
		}

		Dijkstra2 di2 = new Dijkstra2(n);
		for (int i = 0; i < m; i++) {
			di2.addEdge(a[i], b[i], c[i]);
			di2.addEdge(b[i], a[i], c[i]);
		}

		for (int i = 0; i < n; i++) {
//			pr.printf("%d %d%n", di.getShortestPath(0, i), di2.getShortestPath(0, i));
			pr.println(di.getShortestPath(0, i) + di2.getShortestPath(0, i));
		}
	}

	// Dijkstra O(E logV)
	private static class Dijkstra {
		long[] d;
		List<List<Edge>> edges;
		PriorityQueue<Vertex> pq;
		int n;
		int s;

		final long INF = Long.MAX_VALUE;

		Dijkstra(int n) {
			this.n = n;

			edges = new ArrayList<>(n);
			for (int ii = 0; ii < n; ii++) {
				edges.add(new ArrayList<Edge>());
			}

			s = - 1;
		}

		// i, j:0-indexed
		public void addEdge(int i, int j, int c) {
			edges.get(i).add(new Edge(i, j, c));
		}

		public long getShortestPath(int i, int j) {
			if (s != i) {
				d = new long[n];
				Arrays.fill(d, INF);
				d[i] = 0;
				pq = new PriorityQueue<Vertex>();
				pq.add(new Vertex(i, d[i]));

				while (!pq.isEmpty()) {
					Vertex u = pq.poll();
					if (d[u.me] < u.d) {
						continue;  // skip old vertex
					}

					List<Edge> uu = edges.get(u.me);
					for (int ii = 0, size = uu.size(); ii < size; ii++) {
						Edge v = uu.get(ii);
						if (d[u.me] != INF && d[v.v] > d[u.me] + v.w) {
							d[v.v] = d[u.me] + v.w;
							pq.add(new Vertex(v.v, d[v.v]));
						}
					}
				}

				s = i;
			}

			return d[j];
		}

		private static class Edge {
//			int u; // from
			int v; // to
			int w; // cost

			Edge(int u, int v, int w) {
//				this.u = u;
				this.v = v;
				this.w = w;
			}
		}

		private static class Vertex implements Comparable<Vertex> {
			int me; // me
			long d; // cost

			Vertex(int u, long w) {
				this.me = u;
				this.d = w;
			}

			@Override
			public int compareTo(Vertex o) {
				return Long.compare(this.d, o.d);
			}
		}
	}

	private static class Dijkstra2 {
		long[] d;
		long[] d2;
		List<List<Edge>> edges;
		PriorityQueue<Vertex> pq;
		int n;
		int s;

		final long INF = Long.MAX_VALUE;

		Dijkstra2(int n) {
			this.n = n;

			edges = new ArrayList<>(n);
			for (int ii = 0; ii < n; ii++) {
				edges.add(new ArrayList<Edge>());
			}

			s = - 1;
		}

		// i, j:0-indexed
		public void addEdge(int i, int j, int c) {
			edges.get(i).add(new Edge(i, j, c));
		}

		public long getShortestPath(int i, int j) {
			if (s != i) {
				d = new long[n];
				d2 = new long[n];
				Arrays.fill(d, INF);
				Arrays.fill(d2, INF);
				d[i] = 0;
				d2[i] = 0;
				pq = new PriorityQueue<Vertex>();
				pq.add(new Vertex(i, d[i], false));
				pq.add(new Vertex(i, d2[i], true));

				while (!pq.isEmpty()) {
					Vertex u = pq.poll();
					if (!u.f && d[u.me] < u.d) {
						continue;  // skip old vertex
					}
					if (u.f && d2[u.me] < u.d) {
						continue;  // skip old vertex
					}

					for (Edge v : edges.get(u.me)) {
						if (d[u.me] != INF && d[v.v] > d[u.me] + v.w) {
							d[v.v] = d[u.me] + v.w;
							pq.add(new Vertex(v.v, d[v.v], false));
						}
						if (d2[u.me] != INF && d2[v.v] > d2[u.me] + v.w) {
							d2[v.v] = d2[u.me] + v.w;
							pq.add(new Vertex(v.v, d2[v.v], true));
						}
						if (d[u.me] != INF && d2[v.v] > d[u.me]) {
							d2[v.v] = d[u.me];
							pq.add(new Vertex(v.v, d2[v.v], true));
						}
					}
				}

				s = i;
			}

			return d2[j];
		}

		private static class Edge {
//			int u; // from
			int v; // to
			int w; // cost

			Edge(int u, int v, int w) {
//				this.u = u;
				this.v = v;
				this.w = w;
			}
		}

		private static class Vertex implements Comparable<Vertex> {
			int me; // me
			long d; // cost
			boolean f;

			Vertex(int u, long w, boolean f) {
				this.me = u;
				this.d = w;
				this.f = f;
			}

			@Override
			public int compareTo(Vertex o) {
				return Long.compare(this.d, o.d);
			}
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);
			
		solve();
			
		pr.close();
		sc.close();
	}

	static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}
0