結果
問題 | No.812 Change of Class |
ユーザー | Tomohiko Hasegawa |
提出日時 | 2019-04-13 17:22:47 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 2,788 ms / 4,000 ms |
コード長 | 6,207 bytes |
コンパイル時間 | 1,503 ms |
コンパイル使用メモリ | 64,116 KB |
実行使用メモリ | 67,016 KB |
最終ジャッジ日時 | 2023-09-03 14:56:37 |
合計ジャッジ時間 | 53,673 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 388 ms
57,940 KB |
testcase_01 | AC | 109 ms
29,792 KB |
testcase_02 | AC | 242 ms
45,400 KB |
testcase_03 | AC | 451 ms
59,404 KB |
testcase_04 | AC | 404 ms
62,496 KB |
testcase_05 | AC | 2,788 ms
60,988 KB |
testcase_06 | AC | 2,177 ms
60,664 KB |
testcase_07 | AC | 76 ms
32,724 KB |
testcase_08 | AC | 67 ms
22,000 KB |
testcase_09 | AC | 2,413 ms
62,684 KB |
testcase_10 | AC | 2,498 ms
62,612 KB |
testcase_11 | AC | 149 ms
52,596 KB |
testcase_12 | AC | 1,487 ms
58,276 KB |
testcase_13 | AC | 60 ms
18,776 KB |
testcase_14 | AC | 60 ms
20,916 KB |
testcase_15 | AC | 1,732 ms
57,608 KB |
testcase_16 | AC | 123 ms
26,500 KB |
testcase_17 | AC | 1,550 ms
58,996 KB |
testcase_18 | AC | 1,155 ms
48,972 KB |
testcase_19 | AC | 1,334 ms
57,764 KB |
testcase_20 | AC | 2,622 ms
64,200 KB |
testcase_21 | AC | 1,121 ms
45,696 KB |
testcase_22 | AC | 469 ms
38,104 KB |
testcase_23 | AC | 107 ms
24,096 KB |
testcase_24 | AC | 144 ms
23,592 KB |
testcase_25 | AC | 381 ms
37,244 KB |
testcase_26 | AC | 2,135 ms
58,780 KB |
testcase_27 | AC | 1,906 ms
58,312 KB |
testcase_28 | AC | 1,269 ms
55,780 KB |
testcase_29 | AC | 279 ms
34,348 KB |
testcase_30 | AC | 1,655 ms
57,640 KB |
testcase_31 | AC | 1,433 ms
55,568 KB |
testcase_32 | AC | 583 ms
42,608 KB |
testcase_33 | AC | 1,703 ms
57,764 KB |
testcase_34 | AC | 132 ms
24,596 KB |
testcase_35 | AC | 273 ms
32,240 KB |
testcase_36 | AC | 146 ms
24,068 KB |
testcase_37 | AC | 794 ms
41,132 KB |
testcase_38 | AC | 86 ms
36,748 KB |
testcase_39 | AC | 846 ms
39,048 KB |
testcase_40 | AC | 193 ms
25,700 KB |
testcase_41 | AC | 83 ms
35,192 KB |
testcase_42 | AC | 1,947 ms
52,932 KB |
testcase_43 | AC | 222 ms
42,732 KB |
testcase_44 | AC | 1,331 ms
44,220 KB |
testcase_45 | AC | 151 ms
24,244 KB |
testcase_46 | AC | 202 ms
40,568 KB |
testcase_47 | AC | 1,282 ms
42,228 KB |
testcase_48 | AC | 1,260 ms
48,648 KB |
testcase_49 | AC | 385 ms
31,764 KB |
testcase_50 | AC | 69 ms
18,708 KB |
testcase_51 | AC | 308 ms
34,412 KB |
testcase_52 | AC | 572 ms
45,524 KB |
testcase_53 | AC | 243 ms
25,560 KB |
testcase_54 | AC | 219 ms
25,932 KB |
testcase_55 | AC | 438 ms
57,044 KB |
testcase_56 | AC | 558 ms
61,076 KB |
testcase_57 | AC | 591 ms
61,596 KB |
testcase_58 | AC | 318 ms
52,500 KB |
testcase_59 | AC | 660 ms
67,016 KB |
testcase_60 | AC | 61 ms
20,808 KB |
testcase_61 | AC | 62 ms
22,740 KB |
testcase_62 | AC | 63 ms
22,784 KB |
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.Text; using static System.Console; using static System.Math; namespace AtTest.yukicoder { class _812 { static void Main(string[] args) { Method(args); } static void Method(string[] args) { int[] nm = ReadInts(); int n = nm[0]; int m = nm[1]; List<Edge>[] graph = new List<Edge>[n]; for (int i = 0; i < n; i++) graph[i] = new List<Edge>(); for(int i = 0; i < m; i++) { int[] pq = ReadInts(); int a = pq[0] - 1; int b = pq[1] - 1; graph[a].Add(new Edge(b)); graph[b].Add(new Edge(a)); } int q = ReadInt(); long[][] vals = new long[q][]; for(int i = 0; i < q; i++) { long dist = 0; long[] distances = Dijkstra( ReadInt() - 1, graph, out dist); vals[i] = new long[2]; long div = 1; while (dist > div) { vals[i][1]++; div *= 2; } for (int j = 0; j < n; j++) { if (distances[j] < long.MaxValue) vals[i][0]++; } vals[i][0]--; } for (int i = 0; i < q; i++) { WriteLine(vals[i][0] + " " + vals[i][1]); } } static long[] Dijkstra(int startIndex, List<Edge>[] graph, out long maxDistance) { List<Edge> startNode = graph[startIndex]; var pQueue = new PriorityQueue<int>(); var visitFlags = new bool[graph.Length]; var distances = new long[graph.Length]; maxDistance = 0; //Initialize nodes for (int i = 0; i < distances.Length; i++) { distances[i] = long.MaxValue; visitFlags[i] = false; } pQueue.Enqueue(0, startIndex); distances[startIndex] = 0; while (pQueue.Exist()) { KeyValuePair<long, int> pair = pQueue.Dequeue(); long distance = pair.Key; int index = pair.Value; if (visitFlags[index]) continue; //Confirm distances List<Edge> nowNode = graph[index]; visitFlags[index] = true; maxDistance = Math.Max(maxDistance, distance); //Update priority queue for (int i = 0; i < nowNode.Count; i++) { int nextIndex = nowNode[i].toIndex; if (visitFlags[nextIndex]) continue; long nextDistance = distance + nowNode[i].distance; if (nextDistance < distances[nextIndex]) { distances[nextIndex] = nextDistance; pQueue.Enqueue(nextDistance, nextIndex); } } } return distances; } class Edge { public int toIndex; public long distance; public Edge(int toIndex, long distance = 1) { this.toIndex = toIndex; this.distance = distance; } } class PriorityQueue<T> { private readonly List<KeyValuePair<long, T>> list; private int count; public PriorityQueue() { list = new List<KeyValuePair<long, T>>(); count = 0; } private void Add(KeyValuePair<long, T> pair) { if (count == list.Count) { list.Add(pair); } else { list[count] = pair; } count++; } private void Swap(int a, int b) { KeyValuePair<long, T> tmp = list[a]; list[a] = list[b]; list[b] = tmp; } public void Enqueue(long key, T value) { Add(new KeyValuePair<long, T>(key, value)); int c = count - 1; while (c > 0) { int p = (c - 1) / 2; if (list[c].Key >= list[p].Key) break; Swap(p, c); c = p; } } public KeyValuePair<long, T> Dequeue() { KeyValuePair<long, T> pair = list[0]; count--; if (count == 0) return pair; list[0] = list[count]; int p = 0; while (true) { int c1 = p * 2 + 1; int c2 = p * 2 + 2; if (c1 >= count) break; int c = (c2 >= count || list[c1].Key < list[c2].Key) ? c1 : c2; if (list[c].Key >= list[p].Key) break; Swap(p, c); p = c; } return pair; } public bool Exist() { return count > 0; } } private static string Read() { return ReadLine(); } private static char[] ReadChars() { return Array.ConvertAll(Read().Split(), a => a[0]); } private static int ReadInt() { return int.Parse(Read()); } private static long ReadLong() { return long.Parse(Read()); } private static double ReadDouble() { return double.Parse(Read()); } private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); } private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); } private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); } } }