結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | bluemegane |
提出日時 | 2021-05-03 11:23:52 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 951 ms / 2,000 ms |
コード長 | 4,555 bytes |
コンパイル時間 | 943 ms |
コンパイル使用メモリ | 61,984 KB |
実行使用メモリ | 71,616 KB |
最終ジャッジ日時 | 2023-09-29 05:56:46 |
合計ジャッジ時間 | 20,974 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
24,956 KB |
testcase_01 | AC | 68 ms
22,968 KB |
testcase_02 | AC | 484 ms
48,776 KB |
testcase_03 | AC | 636 ms
66,732 KB |
testcase_04 | AC | 629 ms
66,544 KB |
testcase_05 | AC | 451 ms
67,372 KB |
testcase_06 | AC | 453 ms
65,628 KB |
testcase_07 | AC | 181 ms
39,312 KB |
testcase_08 | AC | 535 ms
71,392 KB |
testcase_09 | AC | 105 ms
33,248 KB |
testcase_10 | AC | 272 ms
47,972 KB |
testcase_11 | AC | 199 ms
39,020 KB |
testcase_12 | AC | 174 ms
34,952 KB |
testcase_13 | AC | 534 ms
52,112 KB |
testcase_14 | AC | 613 ms
58,664 KB |
testcase_15 | AC | 696 ms
61,524 KB |
testcase_16 | AC | 360 ms
43,008 KB |
testcase_17 | AC | 789 ms
65,120 KB |
testcase_18 | AC | 257 ms
36,812 KB |
testcase_19 | AC | 723 ms
61,252 KB |
testcase_20 | AC | 220 ms
38,580 KB |
testcase_21 | AC | 300 ms
43,104 KB |
testcase_22 | AC | 647 ms
63,216 KB |
testcase_23 | AC | 72 ms
25,088 KB |
testcase_24 | AC | 72 ms
22,952 KB |
testcase_25 | AC | 158 ms
33,696 KB |
testcase_26 | AC | 393 ms
48,436 KB |
testcase_27 | AC | 408 ms
49,024 KB |
testcase_28 | AC | 657 ms
60,160 KB |
testcase_29 | AC | 125 ms
31,112 KB |
testcase_30 | AC | 744 ms
65,860 KB |
testcase_31 | AC | 492 ms
53,648 KB |
testcase_32 | AC | 330 ms
42,776 KB |
testcase_33 | AC | 715 ms
63,636 KB |
testcase_34 | AC | 269 ms
43,280 KB |
testcase_35 | AC | 732 ms
64,120 KB |
testcase_36 | AC | 70 ms
22,932 KB |
testcase_37 | AC | 72 ms
23,004 KB |
testcase_38 | AC | 70 ms
23,032 KB |
testcase_39 | AC | 72 ms
25,044 KB |
testcase_40 | AC | 69 ms
23,024 KB |
testcase_41 | AC | 951 ms
71,616 KB |
testcase_42 | AC | 289 ms
39,148 KB |
testcase_43 | AC | 497 ms
53,848 KB |
testcase_44 | AC | 196 ms
35,832 KB |
testcase_45 | AC | 476 ms
51,140 KB |
testcase_46 | AC | 64 ms
20,976 KB |
testcase_47 | AC | 65 ms
22,952 KB |
ソースコード
using static System.Math; using System.Collections.Generic; using System; public class PriorityQueue<T> where T : IComparable { private IComparer<T> _comparer = null; private int _type = 0; private T[] _heap; private int _sz = 0; private int _count = 0; public PriorityQueue(int maxSize, IComparer<T> comparer) { _heap = new T[maxSize]; _comparer = comparer; } public PriorityQueue(int maxSize, int type = 0) { _heap = new T[maxSize]; _type = type; } private int Compare(T x, T y) { if (_comparer != null) return _comparer.Compare(x, y); return _type == 0 ? x.CompareTo(y) : y.CompareTo(x); } public void Push(T x) { _count++; var i = _sz++; while (i > 0) { var p = (i - 1) / 2; if (Compare(_heap[p], x) <= 0) break; _heap[i] = _heap[p]; i = p; } _heap[i] = x; } public T Pop() { _count--; T ret = _heap[0]; T x = _heap[--_sz]; int i = 0; while (i * 2 + 1 < _sz) { int a = i * 2 + 1; int b = i * 2 + 2; if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b; if (Compare(_heap[a], x) >= 0) break; _heap[i] = _heap[a]; i = a; } _heap[i] = x; return ret; } public int Count() { return _count; } public T Peek() { return _heap[0]; } public bool Contains(T x) { for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true; return false; } public void Clear() { while (this.Count() > 0) this.Pop(); } public IEnumerator<T> GetEnumerator() { var ret = new List<T>(); while (this.Count() > 0) { ret.Add(this.Pop()); } foreach (var r in ret) { this.Push(r); yield return r; } } public T[] ToArray() { T[] array = new T[_sz]; int i = 0; foreach (var r in this) { array[i++] = r; } return array; } } public class Edge { public int to { get; set; } public double d { get; set; } } public class Node : IComparable { public int id { get; set; } public double d { get; set; } public int CompareTo(object obj) { var x = (Node)obj; if (this.d > x.d) return 1; else if (this.d == x.d) return 0; else return -1; } } public class P { public int x { get; set; } public int y { get; set; } } public class Hello { static void Main() { string[] line = Console.ReadLine().Trim().Split(' '); var n = int.Parse(line[0]); var m = int.Parse(line[1]); line = Console.ReadLine().Trim().Split(' '); var r = int.Parse(line[0]) - 1; var r2 = int.Parse(line[1]) - 1; var ps = new P[n]; var aa = new List<Edge>[n]; for (int i = 0; i < n; i++) { line = Console.ReadLine().Trim().Split(' '); ps[i] = new P { x = int.Parse(line[0]), y = int.Parse(line[1]) }; aa[i] = new List<Edge>(); } for (int i = 0; i < m; i++) { line = Console.ReadLine().Trim().Split(' '); var p = int.Parse(line[0]) - 1; var q = int.Parse(line[1]) - 1; var wd = Sqrt((ps[p].x - ps[q].x) * (ps[p].x - ps[q].x) + (ps[p].y - ps[q].y) * (ps[p].y - ps[q].y)); aa[p].Add(new Edge { to = q, d = wd }); aa[q].Add(new Edge { to = p, d = wd }); } var mind = new double[n]; for (int i = 0; i < n; i++) mind[i] = 100000000000d; goDijk(aa, r, n, mind); Console.WriteLine(mind[r2]); } public static void goDijk(List<Edge>[] aa, int r, int n, double[] mind) { var pq = new PriorityQueue<Node>(n + 100000, 0); pq.Push(new Node { id = r, d = 0 }); while (pq.Count() > 0) { var targ = pq.Pop(); var nowd = targ.d; var nowid = targ.id; if (mind[nowid] < nowd) continue; mind[nowid] = nowd; foreach (var x in aa[nowid]) if (nowd + x.d < mind[x.to]) { mind[x.to] = nowd + x.d; pq.Push(new Node { id = x.to, d = nowd + x.d }); } } } }