結果

問題 No.2387 Yokan Factory
ユーザー kakel-san
提出日時 2023-07-21 21:42:13
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,991 ms / 5,000 ms
コード長 3,966 bytes
コンパイル時間 1,124 ms
コンパイル使用メモリ 111,232 KB
実行使用メモリ 66,092 KB
最終ジャッジ日時 2024-09-21 23:07:58
合計ジャッジ時間 17,592 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static long[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, x) = ((int)c[0], c[1], c[2]);
        var map = NArr(m);
        var tree = new List<(int to, long len, long width)>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<(int to, long len, long width)>();
        foreach (var edge in map)
        {
            tree[(int)edge[0] - 1].Add(((int)edge[1] - 1, edge[2], edge[3]));
            tree[(int)edge[1] - 1].Add(((int)edge[0] - 1, edge[2], edge[3]));
        }
        var ok = -1;
        var ng = 1_000_000_001;
        var INF = long.MaxValue / 2;
        while (ng - ok > 1)
        {
            var mid = (ok + ng) / 2;
            var len = Enumerable.Repeat(INF, n).ToArray();
            len[0] = 0;
            var q = new PriorityQueue<Pair>(n, false);
            q.Enqueue(new Pair(0, 0));
            while (q.Count > 0)
            {
                var cur = q.Dequeue();
                if (len[cur.Pos] != cur.Val) continue;
                foreach (var next in tree[cur.Pos])
                {
                    if (next.width < mid) continue;
                    if (len[next.to] <= cur.Val + next.len) continue;
                    len[next.to] = cur.Val + next.len;
                    q.Enqueue(new Pair(next.to, len[next.to]));
                }
            }
            if (len[n - 1] <= x) ok = mid;
            else ng = mid;
        }
        WriteLine(ok);
    }
    class Pair : IComparable<Pair>
    {
        public int Pos;
        public long Val;
        public Pair(int pos, long val)
        {
            Pos = pos; Val = val;
        }
        public int CompareTo(Pair b)
        {
            return Val.CompareTo(b.Val);
        }
    }
    class PriorityQueue<T> where T : IComparable<T>
    {
        public T[] List;
        public int Count;
        bool IsTopMax;
        public PriorityQueue(int count, bool isTopMax)
        {
            IsTopMax = isTopMax;
            List = new T[Math.Max(128, count)];
        }
        public void Enqueue(T value)
        {
            if (Count == List.Length)
            {
                var newlist = new T[List.Length * 2];
                for (var i = 0; i < List.Length; ++i) newlist[i] = List[i];
                List = newlist;
            }
            var pos = Count;
            List[pos] = value;
            ++Count;
            while (pos > 0)
            {
                var parent = (pos - 1) / 2;
                if (Calc(List[parent], List[pos], true)) break;
                Swap(parent, pos);
                pos = parent;
            }
        }
        public T Dequeue()
        {
            --Count;
            Swap(0, Count);
            var pos = 0;
            while (true)
            {
                var child = pos * 2 + 1;
                if (child >= Count) break;
                if (child + 1 < Count && Calc(List[child + 1], List[child], false)) ++child;
                if (Calc(List[pos], List[child], true)) break;
                Swap(pos, child);
                pos = child;
            }
            return List[Count];
        }
        bool Calc(T a, T b, bool equalVal)
        {
            var ret = a.CompareTo(b);
            if (ret == 0 && equalVal) return true;
            return IsTopMax ? ret > 0 : ret < 0;
        }
        void Swap(int a, int b)
        {
            var tmp = List[a];
            List[a] = List[b];
            List[b] = tmp;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0