結果

問題 No.2354 Poor Sight in Winter
ユーザー kakel-san
提出日時 2023-08-09 08:27:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 157 ms / 2,000 ms
コード長 4,105 bytes
コンパイル時間 4,749 ms
コンパイル使用メモリ 118,148 KB
実行使用メモリ 29,800 KB
最終ジャッジ日時 2024-11-14 14:59:11
合計ジャッジ時間 4,269 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        c = NList;
        var (sx, sy, gx, gy) = (c[0], c[1], c[2], c[3]);
        var map = NArr(n).ToList();
        map.Add(new int[] { sx, sy });
        map.Add(new int[] { gx, gy });
        var len = new int[map.Count][];
        for (var i = 0; i < len.Length; ++i)
        {
            len[i] = new int[map.Count];
            for (var j = 0; j < len[i].Length; ++j) len[i][j] = Math.Abs(map[i][0] - map[j][0]) + Math.Abs(map[i][1] - map[j][1]);
        }
        var ok = 1_000_000;
        var ng = 0;
        while (ok - ng > 1)
        {
            var mid = (ok + ng) / 2;
            var lights = Enumerable.Repeat(int.MaxValue / 2, map.Count).ToArray();
            lights[n] = 0;
            var q = new PriorityQueue<Pair>(n, false);
            q.Enqueue(new Pair(n, 0));
            while (q.Count > 0)
            {
                var cur = q.Dequeue();
                if (lights[cur.Pos] != cur.Val) continue;
                for (var next = 0; next < map.Count; ++next)
                {
                    var add = len[cur.Pos][next] / mid;
                    if (len[cur.Pos][next] > 0 && len[cur.Pos][next] % mid == 0) --add;
                    if (lights[next] <= cur.Val + add) continue;
                    lights[next] = cur.Val + add;
                    q.Enqueue(new Pair(next, lights[next]));
                }
            }
            if (lights[n + 1] <= k) ok = mid;
            else ng = mid;
        }
        WriteLine(ok);
    }
    class Pair : IComparable<Pair>
    {
        public int Pos;
        public int Val;
        public Pair(int pos, int 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