結果
問題 | No.788 トラックの移動 |
ユーザー | EmKjp |
提出日時 | 2019-05-01 15:08:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,844 ms / 2,000 ms |
コード長 | 6,986 bytes |
コンパイル時間 | 3,869 ms |
コンパイル使用メモリ | 111,360 KB |
実行使用メモリ | 40,892 KB |
最終ジャッジ日時 | 2024-12-15 07:05:03 |
合計ジャッジ時間 | 13,363 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,844 ms
40,508 KB |
testcase_01 | AC | 34 ms
19,328 KB |
testcase_02 | AC | 34 ms
19,328 KB |
testcase_03 | AC | 34 ms
19,328 KB |
testcase_04 | AC | 441 ms
31,616 KB |
testcase_05 | AC | 1,788 ms
40,740 KB |
testcase_06 | AC | 1,844 ms
40,880 KB |
testcase_07 | AC | 35 ms
19,200 KB |
testcase_08 | AC | 34 ms
19,328 KB |
testcase_09 | AC | 35 ms
19,200 KB |
testcase_10 | AC | 35 ms
19,328 KB |
testcase_11 | AC | 35 ms
19,328 KB |
testcase_12 | AC | 35 ms
19,328 KB |
testcase_13 | AC | 35 ms
19,456 KB |
testcase_14 | AC | 35 ms
19,328 KB |
testcase_15 | AC | 474 ms
40,228 KB |
testcase_16 | AC | 1,470 ms
40,892 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.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { struct Edge { public int To, Cost; } public void Run() { var N = ni(); var M = ni(); var L = ni() - 1; var T = ni(N); var a = new int[M]; var b = new int[M]; var c = new int[M]; var adj = Enumerable.Range(0, N).Select(_ => new List<Edge>()).ToArray(); for (int i = 0; i < M; i++) { a[i] = ni(); b[i] = ni(); c[i] = ni(); a[i]--; b[i]--; adj[a[i]].Add(new Edge { To = b[i], Cost = c[i] }); adj[b[i]].Add(new Edge { To = a[i], Cost = c[i] }); } long ans = long.MaxValue; var costFromStartPoint = ShortestPath(adj, L); if (T.Count(t => t > 0) == 1) { ans = 0; } else { for (int i = 0; i < N; i++) { var costs = ShortestPath(adj, i); var result = 0L; for (int j = 0; j < N; j++) { result += 2L * T[j] * costs[j]; } var minCost = long.MaxValue; for (int j = 0; j < N; j++) { if (T[j] == 0) continue; var firstMove = costFromStartPoint[j]; var addedMove = costs[j]; var cost = result - addedMove + firstMove; minCost = Math.Min(minCost, cost); } ans = Math.Min(ans, minCost); } } cout.WriteLine(ans); } private long[] ShortestPath(List<Edge>[] adj, int start) { var d = new long[adj.Length]; for (int i = 0; i < d.Length; i++) { d[i] = long.MaxValue; } var visited = new bool[adj.Length]; var queue = new PriorityQueue<Tuple<int, long>>((t1, t2) => t1.Item2.CompareTo(t2.Item2)); queue.Enqueue(Tuple.Create(start, 0L)); while (queue.Any()) { var top = queue.Dequeue(); var pos = top.Item1; var cost = top.Item2; if (visited[pos]) continue; visited[pos] = true; d[pos] = Math.Min(d[pos], cost); foreach (var e in adj[pos]) { if (!visited[e.To]) { queue.Enqueue(Tuple.Create(e.To, cost + e.Cost)); } } } return d; } } public class PriorityQueue<T> { private T[] array = new T[100]; private int size = 0; private readonly Comparer<T> _comparer; public PriorityQueue() { this._comparer = Comparer<T>.Default; } public PriorityQueue(Comparison<T> comp) { this._comparer = Comparer<T>.Create(comp); } private void Swap(int a, int b) { T t = array[a]; array[a] = array[b]; array[b] = t; } private void Expand() { var newlist = new T[array.Length * 2]; Array.Copy(array, newlist, array.Length); array = newlist; } public bool Any() { return size > 0; } public void Enqueue(T newValue) { if (size >= array.Length) { Expand(); } array[size++] = newValue; int pos = size - 1; while (pos > 0) { int parent = (pos - 1) / 2; if (_comparer.Compare(array[parent], array[pos]) > 0) { Swap(parent, pos); pos = parent; } else break; } } public T Dequeue() { var top = array[0]; array[0] = array[--size]; int pos = 0; while (pos * 2 + 1 < size) { int left = pos * 2 + 1; int right = left + 1; int next = left; if (right < size && _comparer.Compare(array[left], array[right]) > 0) next = right; if (_comparer.Compare(array[pos], array[next]) > 0) { Swap(next, pos); pos = next; } else break; } return top; } }; // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public int[] ni(int n) { return NextIntArray(n); } public long nl() { return NextLong(); } public long[] nl(int n) { return NextLongArray(n); } public double nd() { return NextDouble(); } public string ns() { return Next(); } public string[] ns(int n) { return NextArray(n); } } public class Scanner { private TextReader Reader; private Queue<String> TokenQueue = new Queue<string>(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }