結果

問題 No.1638 Robot Maze
ユーザー 👑 kakel-sankakel-san
提出日時 2021-08-06 21:56:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 38 ms / 2,000 ms
コード長 3,900 bytes
コンパイル時間 2,696 ms
コンパイル使用メモリ 113,568 KB
実行使用メモリ 25,372 KB
最終ジャッジ日時 2023-10-17 03:18:21
合計ジャッジ時間 5,847 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
25,300 KB
testcase_01 AC 31 ms
25,300 KB
testcase_02 AC 31 ms
25,300 KB
testcase_03 AC 36 ms
25,368 KB
testcase_04 AC 32 ms
25,368 KB
testcase_05 AC 32 ms
25,368 KB
testcase_06 AC 32 ms
25,368 KB
testcase_07 AC 33 ms
25,368 KB
testcase_08 AC 32 ms
25,368 KB
testcase_09 AC 32 ms
25,368 KB
testcase_10 AC 33 ms
25,368 KB
testcase_11 AC 32 ms
25,368 KB
testcase_12 AC 32 ms
25,368 KB
testcase_13 AC 32 ms
25,368 KB
testcase_14 AC 35 ms
25,372 KB
testcase_15 AC 33 ms
25,372 KB
testcase_16 AC 33 ms
25,372 KB
testcase_17 AC 33 ms
25,372 KB
testcase_18 AC 32 ms
25,372 KB
testcase_19 AC 33 ms
25,368 KB
testcase_20 AC 33 ms
25,368 KB
testcase_21 AC 33 ms
25,304 KB
testcase_22 AC 32 ms
25,304 KB
testcase_23 AC 32 ms
25,304 KB
testcase_24 AC 32 ms
25,308 KB
testcase_25 AC 34 ms
25,308 KB
testcase_26 AC 34 ms
25,372 KB
testcase_27 AC 33 ms
25,372 KB
testcase_28 AC 33 ms
25,372 KB
testcase_29 AC 33 ms
25,372 KB
testcase_30 AC 31 ms
25,360 KB
testcase_31 AC 32 ms
25,360 KB
testcase_32 AC 35 ms
25,372 KB
testcase_33 AC 36 ms
25,372 KB
testcase_34 AC 37 ms
25,372 KB
testcase_35 AC 38 ms
25,372 KB
testcase_36 AC 38 ms
25,372 KB
testcase_37 AC 36 ms
25,372 KB
testcase_38 AC 36 ms
25,372 KB
testcase_39 AC 37 ms
25,372 KB
testcase_40 AC 36 ms
25,372 KB
testcase_41 AC 37 ms
25,372 KB
testcase_42 AC 37 ms
25,372 KB
testcase_43 AC 37 ms
25,372 KB
testcase_44 AC 36 ms
25,372 KB
testcase_45 AC 37 ms
25,372 KB
testcase_46 AC 37 ms
25,372 KB
testcase_47 AC 36 ms
25,372 KB
testcase_48 AC 37 ms
25,372 KB
testcase_49 AC 36 ms
25,372 KB
testcase_50 AC 38 ms
25,372 KB
testcase_51 AC 38 ms
25,372 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.Collections.Generic;
using static System.Console;
using System.Linq;

class yuki308
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static long[] LList => ReadLine().Split().Select(long.Parse).ToArray();
    static string[] SList(int n) => Enumerable.Repeat(0, n).Select(_ => ReadLine()).ToArray();
    static void Main()
    {
        var c = NList;
        var (h, w) = (c[0], c[1]);
        var n = LList;
        var (u, d, r, l, k, p) = ((int)n[0], (int)n[1], (int)n[2], (int)n[3], n[4], n[5]);
        c = NList;
        var (xs, ys, xt, yt) = (c[0] - 1, c[1] - 1, c[2] - 1, c[3] - 1);
        var map = SList(h);

        var move = new int[][] { new[] { 0, -1, l }, new[] { 0, 1, r }, new[] { -1, 0, u }, new[] { 1, 0, d } };
        var list = Enumerable.Repeat(long.MaxValue, h * w).ToArray();
        var q = new PriorityQueue<Pair>(300, false);
        q.Enqueue(new Pair(Key(xs, ys, w), 0));
        list[Key(xs, ys, w)] = 0;
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            if (list[cur.Pos] != cur.Val) continue;
            foreach (var m in move)
            {
                var nx = cur.Pos / w + m[0];
                var ny = cur.Pos % w + m[1];
                var ncost = cur.Val + m[2];
                if (nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
                if (map[nx][ny] == '#') continue;
                if (map[nx][ny] == '@') ncost += p;
                var npos = Key(nx, ny, w);
                if (list[npos] <= ncost) continue;
                list[npos] = ncost;
                q.Enqueue(new Pair(npos, ncost));
            }
        }
        WriteLine(list[Key(xt, yt, w)] > k ? "No" : "Yes");
    }
    static int Key(int x, int y, int w)
    {
        return x * w + y;
    }
    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;
        }
    }
}
0