結果

問題 No.160 最短経路のうち辞書順最小
ユーザー lzy9lzy9
提出日時 2018-03-22 20:31:12
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 105 ms / 5,000 ms
コード長 6,454 bytes
コンパイル時間 1,284 ms
コンパイル使用メモリ 111,104 KB
実行使用メモリ 22,656 KB
最終ジャッジ日時 2024-06-24 20:22:59
合計ジャッジ時間 4,385 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
18,304 KB
testcase_01 AC 28 ms
18,176 KB
testcase_02 AC 28 ms
17,920 KB
testcase_03 AC 28 ms
18,304 KB
testcase_04 AC 55 ms
19,840 KB
testcase_05 AC 59 ms
20,736 KB
testcase_06 AC 73 ms
21,760 KB
testcase_07 AC 76 ms
19,456 KB
testcase_08 AC 50 ms
19,072 KB
testcase_09 AC 91 ms
20,224 KB
testcase_10 AC 40 ms
19,072 KB
testcase_11 AC 40 ms
19,072 KB
testcase_12 AC 41 ms
19,072 KB
testcase_13 AC 70 ms
19,328 KB
testcase_14 AC 31 ms
18,944 KB
testcase_15 AC 35 ms
18,688 KB
testcase_16 AC 74 ms
19,968 KB
testcase_17 AC 41 ms
18,816 KB
testcase_18 AC 54 ms
19,200 KB
testcase_19 AC 105 ms
20,608 KB
testcase_20 AC 62 ms
19,712 KB
testcase_21 AC 32 ms
18,688 KB
testcase_22 AC 34 ms
18,560 KB
testcase_23 AC 48 ms
19,328 KB
testcase_24 AC 72 ms
19,584 KB
testcase_25 AC 44 ms
18,944 KB
testcase_26 AC 52 ms
19,200 KB
testcase_27 AC 28 ms
18,176 KB
testcase_28 AC 55 ms
22,656 KB
testcase_29 AC 28 ms
18,304 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int[] dx = new int[] { 0, 0, 1, -1 };
    static int[] dy = new int[] { 1, -1, 0, 0 };
    const int INF = 1010101010;

    static void Solve()
    {
        var n = sc.Int();
        var m = sc.Int();
        var s = sc.Int();
        var g = sc.Int();

        var graph = new List<List<Edge>>();

        for (int i = 0; i < n; i++)
            graph.Add(new List<Edge>());

        for (int i = 0; i < m; i++)
        {
            var a = sc.Int();
            var b = sc.Int();
            var c = sc.Int();

            graph[a].Add(new Edge { To = b, Cost = c });
            graph[b].Add(new Edge { To = a, Cost = c });
        }

        var cost = new int[n];
        var pre = new int[n];

        for (int i = 0; i < n; i++)
        {
            cost[i] = INF;
            pre[i] = i;
        }

        var queue = new Heap<Node>();
        queue.Enqueue(new Node { Id = g, Cost = 0 });
        cost[g] = 0;

        while (!queue.Empty())
        {
            var nearest = queue.Dequeue();

            if (cost[nearest.Id] < nearest.Cost)
                continue;
            
            foreach(var e in graph[nearest.Id]) {
                if (nearest.Cost + e.Cost < cost[e.To]) {
                    cost[e.To] = nearest.Cost + e.Cost;
                    pre[e.To] = nearest.Id;
                    queue.Enqueue(new Node {Id = e.To, Cost = cost[e.To]});
                }
                else if (nearest.Cost + e.Cost == cost[e.To]) {
                    pre[e.To] = Math.Min(nearest.Id, pre[e.To]);
                }
            }
        }

        var path = new List<int>();
        var p = s;

        while (p != g) {
            path.Add(p);
            p = pre[p];
        }

        path.Add(g);

        pr.WriteLine(string.Join(' ', path));
    }

    class Node : IComparable
    {
        public int Id;
        public int Cost;

        public int CompareTo(object obj)
        {
            return Cost - ((Node)obj).Cost;
        }

        public override string ToString()
        {
            return $"Id: {this.Id} - Cost: {this.Cost}";
        }
    }

    class Edge
    {
        public int To;
        public int Cost;
    }

    static double F(double prev, double next, double t)
    {
        return Math.Pow(Math.Exp((next - prev) / t), 2);
    }

    static int[,] Mul(int[,] a, int[,] b)
    {
        var ret = new int[a.GetLength(0), b.GetLength(1)];
        for (int i = 0; i < a.GetLength(0); i++)
            for (int j = 0; j < b.GetLength(1); j++)
                for (int k = 0; k < a.GetLength(1); k++)
                    ret[i, j] += a[i, k] * b[k, j];

        return ret;
    }

    static int[,] Pow(int[,] a, int n)
    {
        var b = new int[a.GetLength(1), a.GetLength(0)];

        var f = n % 2 == 1;

        for (int i = 0; i < a.GetLength(0); i++)
            b[i, i] = 1;

        while (n > 0)
        {
            if (n % 2 == 1)
                b = Mul(a, b);


            n >>= 1;
        }

        return b;
    }

    class Coord
    {
        public int x;
        public int y;
    }

    static void Main(string[] args)
    {
        // pr.AutoFlush = true;
        Solve();
        pr.Flush();
        // Console.ReadKey();
    }

    static Scanner sc = new Scanner();
    static Printer pr = new Printer();
}

class Heap<T> where T : IComparable
{
    private List<T> _heap;
    private int _last;
    private int _cnt;
    private IComparer<T> _comparer;

    public Heap()
    {
        _heap = new List<T>();
        _last = 0;
    }

    public Heap(IEnumerable<T> e)
    {
        _heap = new List<T>(e);
        _cnt = _last = _heap.Count();

        for (int i = _last / 2; 0 <= i; i--)
            Heapify(i);
    }

    public Heap(IComparer<T> comparer)
    {
        _comparer = comparer;
    }

    public Heap(IEnumerable<T> e, IComparer<T> comparer) : this(e)
    {
        _comparer = comparer;
    }

    private int Compare(T a, T b)
    {
        if (_comparer == null)
            return a.CompareTo(b);
        else
            return _comparer.Compare(a, b);
    }

    public bool Empty() {
        return _last == 0;
    }

    public void Enqueue(T item)
    {
        if (_last < _cnt) {

            _heap[_last++] = item;
        }
        else {
            _heap.Add(item);
            _cnt++;
            _last++;
        }

        var i = _last - 1;

        while (0 < i)
        {
            if (0 <= Compare(_heap[(i - 1) / 2], _heap[i]))
                break;
            swap((i - 1) / 2, i);
            i = (i - 1) / 2;
        }
    }

    public T Dequeue()
    {
        if (_last == 0)
            throw new Exception("Empty");

        var ret = _heap[0];
        _heap[0] = _heap[--_last];

        Heapify(0);

        return ret;
    }

    public T Peek()
    {
        return _heap[0];
    }

    public int Count()
    {
        return _last;
    }

    private void Heapify(int i)
    {
        var max = i;
        if (i * 2 + 1 < _last && Compare(_heap[max], _heap[i * 2 + 1]) < 0)
            max = i * 2 + 1;
        if (i * 2 + 2 < _last && Compare(_heap[max], _heap[i * 2 + 2]) < 0)
            max = i * 2 + 2;

        if (max == i)
            return;

        swap(i, max);

        Heapify(max);
    }

    private void swap(int a, int b)
    {
        var t = _heap[a];
        _heap[a] = _heap[b];
        _heap[b] = t;
    }
}

#region IO
class Scanner
{
    private int _i = 0;
    private string[] line = new string[0];

    private T[] Enumerate<T>(int n, Func<T> f)
    {
        T[] ret = new T[n];
        for (int i = 0; i < n; i++)
            ret[i] = f();
        return ret;
    }

    public string Str()
    {
        if (line.Length <= _i)
        {
            line = Console.ReadLine().Split(' ');
            _i = 0;
        }

        return line[_i++];
    }

    public int Int() => int.Parse(Str());
    public long Long() => long.Parse(Str());
    public double Double() => double.Parse(Str());
    public int[] Int(int n) => Enumerate(n, Int);
    public long[] Long(int n) => Enumerate(n, Long);
    public double[] Double(int n) => Enumerate(n, Double);
    public string[] Str(int n) => Enumerate(n, Str);
}

class Printer : StreamWriter
{
    public Printer() : base(Console.OpenStandardOutput())
    {
        AutoFlush = false;
    }
}
#endregion
0