結果
問題 | No.160 最短経路のうち辞書順最小 |
ユーザー | eitaho |
提出日時 | 2015-03-04 22:05:09 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 180 ms / 5,000 ms |
コード長 | 3,270 bytes |
コンパイル時間 | 2,310 ms |
コンパイル使用メモリ | 111,872 KB |
実行使用メモリ | 27,160 KB |
最終ジャッジ日時 | 2023-09-06 12:04:02 |
合計ジャッジ時間 | 8,088 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
21,836 KB |
testcase_01 | AC | 64 ms
21,724 KB |
testcase_02 | AC | 63 ms
21,760 KB |
testcase_03 | AC | 64 ms
21,692 KB |
testcase_04 | AC | 140 ms
23,796 KB |
testcase_05 | AC | 143 ms
23,800 KB |
testcase_06 | AC | 150 ms
23,916 KB |
testcase_07 | AC | 136 ms
21,852 KB |
testcase_08 | AC | 136 ms
23,908 KB |
testcase_09 | AC | 133 ms
21,744 KB |
testcase_10 | AC | 136 ms
23,780 KB |
testcase_11 | AC | 134 ms
21,956 KB |
testcase_12 | AC | 139 ms
21,700 KB |
testcase_13 | AC | 143 ms
21,840 KB |
testcase_14 | AC | 142 ms
21,824 KB |
testcase_15 | AC | 142 ms
21,768 KB |
testcase_16 | AC | 142 ms
23,868 KB |
testcase_17 | AC | 143 ms
23,892 KB |
testcase_18 | AC | 143 ms
21,764 KB |
testcase_19 | AC | 143 ms
23,936 KB |
testcase_20 | AC | 144 ms
21,892 KB |
testcase_21 | AC | 143 ms
21,772 KB |
testcase_22 | AC | 143 ms
21,748 KB |
testcase_23 | AC | 142 ms
21,852 KB |
testcase_24 | AC | 139 ms
21,944 KB |
testcase_25 | AC | 141 ms
21,744 KB |
testcase_26 | AC | 136 ms
23,880 KB |
testcase_27 | AC | 135 ms
19,748 KB |
testcase_28 | AC | 180 ms
27,160 KB |
testcase_29 | AC | 134 ms
23,868 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Text; using System.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { static readonly int INF = (int)1e9; void CheckMin(ref int a, int b) { if (b < a) a = b; } void Solve() { int N = reader.Int(), NumE = reader.Int(); int S = reader.Int(), G = reader.Int(); int[,] dist = new int[N, N]; var E = Enu.Range(0, N).Select(i => new List<Tuple<int, int>>()).ToArray(); for (int a = 0; a < N; a++) for (int b = 0; b < a; b++) dist[a, b] = dist[b, a] = INF; for (int i = 0; i < NumE; i++) { int a = reader.Int(), b = reader.Int(), c = reader.Int(); E[a].Add(Tuple.Create(b, c)); E[b].Add(Tuple.Create(a, c)); CheckMin(ref dist[a, b], c); CheckMin(ref dist[b, a], c); } for (int c = 0; c < N; c++) for (int a = 0; a < N; a++) for (int b = 0; b < N; b++) dist[a, b] = Math.Min(dist[a, b], dist[a, c] + dist[c, b]); var ans = new List<int>(); for (int at = S; ; ) { ans.Add(at); if (at == G) break; E[at].Sort(); foreach (var t in E[at]) { int next = t.Item1, d = t.Item2; if (dist[at, G] == d + dist[next, G]) { at = next; break; } } } Console.WriteLine(string.Join(" ", ans)); } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public Reader(string file) { reader = new StreamReader(file); } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }