結果
問題 | No.788 トラックの移動 |
ユーザー | ひばち |
提出日時 | 2019-11-15 22:23:04 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,874 ms / 2,000 ms |
コード長 | 9,354 bytes |
コンパイル時間 | 5,048 ms |
コンパイル使用メモリ | 114,560 KB |
実行使用メモリ | 42,348 KB |
最終ジャッジ日時 | 2024-05-08 23:02:44 |
合計ジャッジ時間 | 13,047 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,857 ms
42,348 KB |
testcase_01 | AC | 29 ms
18,176 KB |
testcase_02 | AC | 29 ms
17,920 KB |
testcase_03 | AC | 29 ms
18,048 KB |
testcase_04 | AC | 452 ms
30,336 KB |
testcase_05 | AC | 1,819 ms
41,220 KB |
testcase_06 | AC | 1,874 ms
42,224 KB |
testcase_07 | AC | 30 ms
18,176 KB |
testcase_08 | AC | 29 ms
18,176 KB |
testcase_09 | AC | 30 ms
18,048 KB |
testcase_10 | AC | 29 ms
18,176 KB |
testcase_11 | AC | 31 ms
18,048 KB |
testcase_12 | AC | 30 ms
18,176 KB |
testcase_13 | AC | 25 ms
17,920 KB |
testcase_14 | AC | 25 ms
17,920 KB |
testcase_15 | AC | 471 ms
36,736 KB |
testcase_16 | AC | 1,617 ms
42,344 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.Collections.Generic; using System.Linq; using System.IO; using System.Runtime.CompilerServices; using System.Text; using static Template; using static System.Console; using static System.Convert; using static System.Math; using Pi = Pair<int, int>; using Number = System.Int64; class Solver { Scanner sc = new Scanner(); // List<Dijkstra.Edge>[] edge; int[] tr, ts; long[] dist; public void Solve() { int N, M, L; sc.Make(out N, out M, out L); L--; ts = new int[N];var ct = 0; for(var i = 0; i < N; i++) { ts[i] = sc.Next<int>(); if (ts[i] != 0) ct++; } if (ct == 1) Fail(0); var dij = new Dijkstra(N); for (var i = 0; i < M; i++) { int a, b, c; sc.Make(out a, out b, out c); a--; b--; dij.AddEdge(a, b, c); dij.AddEdge(b, a, c); } edge = dij.edges; dist = dij.Execute(L); tr = Create(N, () => -2); for (var i = 0; i < N; i++) dfs(i); var res = long.MaxValue; for (var i = 0; i < N; i++) { if (tr[i] != -1) ts[tr[i]]--; var calc = dist[i]; var d = dij.Execute(i); for (var j = 0; j < N; j++) calc += 2 * d[j] * ts[j]; chmin(ref res, calc); if (tr[i] != -1) ts[tr[i]]++; } WriteLine(res); } int dfs(int idx) { if (tr[idx] != -2) return tr[idx]; var rt = -1; foreach (var e in edge[idx]) if (e.cost + dist[e.to] == dist[idx]) { var i = dfs(e.to); if (i == -1) continue; if (rt == -1) rt = i; if (dist[rt] > dist[i]) rt = i; } if (rt == -1 && ts[idx] > 0) rt = idx; return tr[idx] = rt; } } class Dijkstra { private int num; public List<Edge>[] edges; public Dijkstra(int num) { this.num = num; edges = Create(num, () => new List<Edge>()); } public void AddEdge(int from, int to, Number weight) => edges[from].Add(new Edge(to, weight)); public Number[] Execute(int st = 0) { var dist = Create(num, () => Number.MaxValue); var pq = new PriorityQueue<Edge>(); pq.Enqueue(new Edge(st, 0)); dist[st] = 0; while (pq.Any()) { var p = pq.Dequeue(); if (p.cost > dist[p.to]) continue; foreach (var e in edges[p.to]) if (chmin(ref dist[e.to], e.cost + p.cost)) pq.Enqueue(new Edge(e.to, dist[e.to])); } return dist; } public struct Edge : IComparable<Edge> { public int to; public Number cost; public Edge(int to, Number cost) { this.to = to; this.cost = cost; } public int CompareTo(Edge e) => cost.CompareTo(e.cost); } } public class PriorityQueue<T> { private List<T> item = new List<T>(); private Comparison<T> cmp; public int Count { get { return item.Count; } } public T Peek { get { return item[0]; } } public PriorityQueue() { cmp = Comparer<T>.Default.Compare; } public PriorityQueue(Comparison<T> comparison) { cmp = comparison; } public PriorityQueue(IComparer<T> comparer) { cmp = comparer.Compare; } [MethodImpl(MethodImplOptions.AggressiveInlining)] private int Parent(int i) => (i - 1) >> 1; [MethodImpl(MethodImplOptions.AggressiveInlining)] private int Left(int i) => (i << 1) + 1; public T Enqueue(T val) { int i = item.Count; item.Add(val); while (i > 0) { int p = Parent(i); if (cmp(item[p], val) <= 0) break; item[i] = item[p]; i = p; } item[i] = val; return val; } public T Dequeue() { var ret = item[0]; var p = 0; var x = item[item.Count - 1]; while (Left(p) < item.Count - 1) { var l = Left(p); if (l < item.Count - 2 && cmp(item[l + 1], item[l]) < 0) l++; if (cmp(item[l], x) >= 0) break; item[p] = item[l]; p = l; } item[p] = x; item.RemoveAt(item.Count - 1); return ret; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Any() => item.Count > 0; } #region Template public class Template { static void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver().Solve(); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmin<T>(ref T num, T val) where T : IComparable<T> { if (num.CompareTo(val) == 1) { num = val; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmax<T>(ref T num, T val) where T : IComparable<T> { if (num.CompareTo(val) == -1) { num = val; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void swap<T>(ref T v1, ref T v2) { var t = v2; v2 = v1; v1 = t; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; } public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); } } public class Scanner { StreamReader sr; public Scanner() { sr = new StreamReader(Console.OpenStandardInput()); } public Scanner(string path) { sr = new StreamReader(path); } public string Str => sr.ReadLine().Trim(); public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray(); public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray(); public char[][] Grid(int n) => Create(n, () => Str.ToCharArray()); public int[] ArrInt1D(int n) => Create(n, () => Int); public long[] ArrLong1D(int n) => Create(n, () => Long); public int[][] ArrInt2D(int n) => Create(n, () => ArrInt); public long[][] ArrLong2D(int n) => Create(n, () => ArrLong); public Pair<T1, T2> PairMake<T1, T2>() => new Pair<T1, T2>(Next<T1>(), Next<T2>()); public Pair<T1, T2, T3> PairMake<T1, T2, T3>() => new Pair<T1, T2, T3>(Next<T1>(), Next<T2>(), Next<T3>()); private Queue<string> q = new Queue<string>(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); } public void Make<T1>(out T1 v1) => v1 = Next<T1>(); public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); } public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); } public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); } public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); } public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); } } public class Pair<T1, T2> : IComparable<Pair<T1, T2>> { public T1 v1; public T2 v2; public Pair() { } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2> p) { var c = Comparer<T1>.Default.Compare(v1, p.v1); if (c == 0) c = Comparer<T2>.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; } } public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>> { public T3 v3; public Pair() : base() { } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2, T3> p) { var c = base.CompareTo(p); if (c == 0) c = Comparer<T3>.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; public void Deconstruct(out T1 a, out T2 b,out T3 c) { Deconstruct(out a, out b);c = v3; } } #endregion