Submission #1303396
Source Code Expand
using System.Collections; using System.Collections.Generic; using System.IO; using System.Linq; using System.Text; using System; using System.Numerics; using static System.Math; using static System.Console; class E { static void Main() => new J(); } class J { int F() => int.Parse(ReadLine()); int[] G() => ReadLine().Split(new char[] { ' ', '\t' }, StringSplitOptions.RemoveEmptyEntries).Select(int.Parse).ToArray(); public const int INF = 1000000007; public J() { SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); Solve(); Out.Flush(); } int V; List<Tuple<int,int>>[] es; void Solve() { var I = G(); V = I[0]; int E = I[1], R = I[2], T = I[3]; es = new List<Tuple<int, int>>[V]; for (var i = 0; i < V; i++) es[i] = new List<Tuple<int, int>>(); for (var e = 0; e < E; e++) { I = G(); int a = I[0] - 1, b = I[1] - 1, c = I[2]; es[a].Add(new Tuple<int, int>(b, c)); es[b].Add(new Tuple<int, int>(a, c)); } var s = 0L; for (var u = 0; u < V; u++) { var d = DijkstraFrom(u); Array.Sort(d); var i = 1; for (var x = 1; x < V; x++) { while (i < V && (long)R * d[x] >= (long)T * d[i]) i++; s += V - i; } } Console.WriteLine(s); } int[] DijkstraFrom(int u) { var d = Enumerable.Repeat(INF, V).ToArray(); var queue = new PriorityQueue(); d[u] = 0; queue.Enqueue(new Tuple<int, int>(u, 0)); while (queue.Count > 0) { var p = queue.Dequeue(); var v = p.Item1; if (d[v] < p.Item2) continue; foreach (var e in es[v]) { var tmp = d[v] + e.Item2; if (d[e.Item1] > tmp) queue.Enqueue(new Tuple<int, int>(e.Item1, d[e.Item1] = tmp)); } } return d; } } class PriorityQueue { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); public int Count; public PriorityQueue() { } public void Enqueue(Tuple<int, int> x) { var pos = Count++; list.Add(x); while (pos > 0) { var p = (pos - 1) / 2; if (list[p].Item2 <= x.Item2) break; list[pos] = list[p]; pos = p; } list[pos] = x; } public Tuple<int, int> Dequeue() { var value = list[0]; var x = list[--Count]; list.RemoveAt(Count); if (Count == 0) return value; var pos = 0; while (pos * 2 + 1 < Count) { var a = 2 * pos + 1; var b = 2 * pos + 2; if (b < Count && list[b].Item2 < list[a].Item2) a = b; if (list[a].Item2 >= x.Item2) break; list[pos] = list[a]; pos = a; } list[pos] = x; return value; } public bool IsEmpty => Count == 0; }
Submission Info
Submission Time | |
---|---|
Task | C - ウサギとカメ |
User | selpo |
Language | C# (Mono 4.6.2.0) |
Score | 0 |
Code Size | 2596 Byte |
Status | WA |
Exec Time | 5189 ms |
Memory | 41728 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample-01.txt, subtask0_sample-02.txt |
All | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample-01.txt | AC | 39 ms | 14036 KB |
subtask0_sample-02.txt | AC | 26 ms | 11476 KB |
subtask1_01.txt | AC | 26 ms | 11476 KB |
subtask1_02.txt | AC | 26 ms | 11476 KB |
subtask1_03.txt | AC | 26 ms | 11476 KB |
subtask1_04.txt | AC | 25 ms | 9428 KB |
subtask1_05.txt | AC | 49 ms | 9428 KB |
subtask1_06.txt | WA | 57 ms | 15572 KB |
subtask1_07.txt | AC | 156 ms | 15692 KB |
subtask1_08.txt | WA | 196 ms | 17740 KB |
subtask1_09.txt | AC | 1572 ms | 36776 KB |
subtask1_10.txt | AC | 1417 ms | 34456 KB |
subtask1_11.txt | AC | 631 ms | 23484 KB |
subtask1_12.txt | WA | 4563 ms | 37204 KB |
subtask1_13.txt | AC | 4698 ms | 37088 KB |
subtask1_14.txt | AC | 5087 ms | 37776 KB |
subtask1_15.txt | AC | 3712 ms | 41728 KB |
subtask1_16.txt | AC | 5189 ms | 37684 KB |