結果

問題 No.5006 Hidden Maze
ユーザー inani_waoninani_waon
提出日時 2022-06-12 17:57:06
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 433 ms / 2,000 ms
コード長 9,745 bytes
コンパイル時間 6,328 ms
実行使用メモリ 57,248 KB
スコア 3,968
平均クエリ数 961.32
最終ジャッジ日時 2022-06-12 17:57:58
合計ジャッジ時間 45,210 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 386 ms
52,720 KB
testcase_01 AC 340 ms
52,748 KB
testcase_02 AC 274 ms
53,176 KB
testcase_03 AC 352 ms
52,892 KB
testcase_04 AC 358 ms
53,044 KB
testcase_05 AC 307 ms
52,416 KB
testcase_06 AC 433 ms
56,996 KB
testcase_07 AC 357 ms
52,264 KB
testcase_08 AC 306 ms
52,580 KB
testcase_09 AC 374 ms
52,620 KB
testcase_10 AC 377 ms
53,244 KB
testcase_11 AC 353 ms
52,780 KB
testcase_12 AC 347 ms
52,776 KB
testcase_13 AC 356 ms
53,236 KB
testcase_14 AC 385 ms
56,960 KB
testcase_15 AC 327 ms
53,040 KB
testcase_16 AC 323 ms
52,988 KB
testcase_17 AC 391 ms
57,120 KB
testcase_18 AC 307 ms
52,588 KB
testcase_19 AC 396 ms
56,044 KB
testcase_20 AC 324 ms
52,548 KB
testcase_21 AC 277 ms
52,484 KB
testcase_22 AC 348 ms
53,312 KB
testcase_23 AC 422 ms
56,856 KB
testcase_24 AC 290 ms
52,840 KB
testcase_25 AC 294 ms
52,780 KB
testcase_26 AC 267 ms
52,992 KB
testcase_27 AC 294 ms
52,960 KB
testcase_28 AC 389 ms
56,556 KB
testcase_29 AC 358 ms
53,192 KB
testcase_30 AC 363 ms
57,232 KB
testcase_31 AC 347 ms
52,404 KB
testcase_32 AC 307 ms
52,376 KB
testcase_33 AC 363 ms
52,412 KB
testcase_34 AC 344 ms
52,896 KB
testcase_35 AC 390 ms
57,144 KB
testcase_36 AC 395 ms
52,988 KB
testcase_37 AC 349 ms
52,508 KB
testcase_38 AC 301 ms
52,704 KB
testcase_39 AC 81 ms
44,376 KB
testcase_40 AC 338 ms
53,080 KB
testcase_41 AC 381 ms
52,928 KB
testcase_42 AC 323 ms
52,456 KB
testcase_43 AC 308 ms
53,500 KB
testcase_44 AC 384 ms
56,628 KB
testcase_45 AC 366 ms
53,036 KB
testcase_46 AC 299 ms
52,348 KB
testcase_47 AC 380 ms
56,456 KB
testcase_48 AC 294 ms
52,612 KB
testcase_49 AC 316 ms
52,876 KB
testcase_50 AC 304 ms
53,016 KB
testcase_51 AC 369 ms
52,532 KB
testcase_52 AC 328 ms
52,336 KB
testcase_53 AC 329 ms
52,668 KB
testcase_54 AC 91 ms
44,992 KB
testcase_55 AC 349 ms
52,872 KB
testcase_56 AC 371 ms
52,716 KB
testcase_57 AC 362 ms
52,788 KB
testcase_58 AC 380 ms
56,508 KB
testcase_59 AC 371 ms
52,728 KB
testcase_60 AC 341 ms
52,884 KB
testcase_61 AC 74 ms
44,392 KB
testcase_62 AC 401 ms
56,856 KB
testcase_63 AC 335 ms
52,824 KB
testcase_64 AC 290 ms
53,160 KB
testcase_65 AC 424 ms
56,732 KB
testcase_66 AC 298 ms
52,264 KB
testcase_67 AC 362 ms
53,140 KB
testcase_68 AC 293 ms
53,380 KB
testcase_69 AC 387 ms
56,756 KB
testcase_70 AC 374 ms
57,248 KB
testcase_71 AC 402 ms
56,984 KB
testcase_72 AC 323 ms
52,996 KB
testcase_73 AC 309 ms
52,440 KB
testcase_74 AC 298 ms
52,552 KB
testcase_75 AC 268 ms
52,248 KB
testcase_76 AC 401 ms
56,548 KB
testcase_77 AC 397 ms
56,140 KB
testcase_78 AC 418 ms
57,136 KB
testcase_79 AC 342 ms
52,608 KB
testcase_80 AC 393 ms
57,204 KB
testcase_81 AC 314 ms
52,740 KB
testcase_82 AC 407 ms
56,484 KB
testcase_83 AC 80 ms
44,956 KB
testcase_84 AC 333 ms
53,088 KB
testcase_85 AC 422 ms
56,788 KB
testcase_86 AC 344 ms
52,912 KB
testcase_87 AC 360 ms
52,708 KB
testcase_88 AC 301 ms
52,684 KB
testcase_89 AC 274 ms
52,144 KB
testcase_90 AC 386 ms
56,680 KB
testcase_91 AC 330 ms
53,048 KB
testcase_92 AC 372 ms
56,332 KB
testcase_93 AC 374 ms
56,424 KB
testcase_94 AC 351 ms
53,256 KB
testcase_95 AC 361 ms
53,176 KB
testcase_96 AC 363 ms
56,264 KB
testcase_97 AC 277 ms
52,856 KB
testcase_98 AC 371 ms
52,972 KB
testcase_99 AC 371 ms
56,656 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 105 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.0/publish/

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class YukicoS5006
{
    public static void Main()
    {
        var nums = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        var solver = new YukicoS5006Solver(nums[2]);
        while (true)
        {
            var cmd = solver.GetCommand();
            Console.WriteLine(cmd);
            var res = int.Parse(Console.ReadLine());
            if (res == -1) break;
            solver.UpdateWall(cmd, res);
        }
    }
}

class YukicoS5006Solver
{
    const int N = 20;
    const int NN = N * N;
    const double InitWallRate = 150.0 / ((N - 1) * N * 2);
    readonly int _p;
    readonly double[] wallRateV = Enumerable.Repeat(InitWallRate, NN).ToArray();
    readonly double[] wallRateH = Enumerable.Repeat(InitWallRate, NN).ToArray();
    readonly Grid _grid;

    public YukicoS5006Solver(int p)
    {
        _p = p;
        _grid = new Grid(N, N);
    }

    public string GetCommand()
    {
        var wallCost = 100.0;

        var costs = GetRouteCost(wallCost);
        return GetRoute(costs);
    }

    double[] GetRouteCost(double wallCost)
    {
        var priorityQueue = new PriorityQueue<int, double>();
        priorityQueue.Enqueue(0, 0.0);

        var costs = Enumerable.Repeat(double.MaxValue, NN).ToArray();
        var visited = new bool[NN];

        while (priorityQueue.TryDequeue(out int pos, out double currentCost))
        {
            if (visited[pos]) continue;

            // その頂点への最短経路のコストを更新
            costs[pos] = currentCost;
            visited[pos] = true;

            var cell = _grid.Cells[pos];
            if (cell.Y > 0)
            {
                var wallRate = wallRateV[cell.EdgeIds[Direction.Up]];
                var cost = 1 + (wallRate * wallCost);
                priorityQueue.Enqueue(pos - N, currentCost + cost);
            }
            if (cell.Y < N - 1)
            {
                var wallRate = wallRateV[cell.EdgeIds[Direction.Down]];
                var cost = 1 + (wallRate * wallCost);
                priorityQueue.Enqueue(pos + N, currentCost + cost);
            }
            if (cell.X > 0)
            {
                var wallRate = wallRateH[cell.EdgeIds[Direction.Left]];
                var cost = 1 + (wallRate * wallCost);
                priorityQueue.Enqueue(pos - 1, currentCost + cost);
            }
            if (cell.Y < N - 1)
            {
                var wallRate = wallRateH[cell.EdgeIds[Direction.Right]];
                var cost = 1 + (wallRate * wallCost);
                priorityQueue.Enqueue(pos + 1, currentCost + cost);
            }
        }

        return costs;
    }

    string GetRoute(double[] costs)
    {
        var sb = new StringBuilder();
        var pos = 19 * N + 19;

        while (pos != 0)
        {
            var bestDir = 'X';
            var bestNext = -1;
            var bestCost = double.MaxValue;

            var cell = _grid.Cells[pos];
            if (cell.Y > 0)
            {
                var next = pos - N;
                var cost = costs[next];
                if (cost < bestCost)
                {
                    bestCost = cost;
                    bestNext = next;
                    bestDir = 'D';
                }
            }
            if (cell.Y < N - 1)
            {
                var next = pos + N;
                var cost = costs[next];
                if (cost < bestCost)
                {
                    bestCost = cost;
                    bestNext = next;
                    bestDir = 'U';
                }
            }
            if (cell.X > 0)
            {
                var next = pos - 1;
                var cost = costs[next];
                if (cost < bestCost)
                {
                    bestCost = cost;
                    bestNext = next;
                    bestDir = 'R';
                }
            }
            if (cell.X < N - 1)
            {
                var next = pos + 1;
                var cost = costs[next];
                if (cost < bestCost)
                {
                    bestCost = cost;
                    bestNext = next;
                    bestDir = 'L';
                }
            }

            sb.Insert(0, bestDir);
            pos = bestNext;
        }

        return sb.ToString();
    }

    public void UpdateWall(string route, int moveCount)
    {
        int x = 0, y = 0;

        // 通過できた場所は確実に壁が無い
        for (var i = 0; i < moveCount; i++)
        {
            var pos = y * N + x;
            var c = route[i];

            int edgeId;
            switch (c)
            {
                case 'U':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Up];
                    wallRateV[edgeId] = 0.0;
                    y--;
                    break;
                case 'D':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Down];
                    wallRateV[edgeId] = 0.0;
                    y++;
                    break;
                case 'L':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Left];
                    wallRateH[edgeId] = 0.0;
                    x--;
                    break;
                case 'R':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Right];
                    wallRateH[edgeId] = 0.0;
                    x++;
                    break;
            }
        }

        // 通過できなかった場所は壁がある、（正しく壁にぶつかったケース）
        // もしくは経路上のいずれか1箇所以上に壁がある（壁を誤認したケース）
        // (過去に通過したのにぶつかった場合は誤認であることが分かる)

        // 暫定で通過できなかった場所だけ壁率を上げる(計算も雑)
        {
            var pos = y * N + x;
            var c = route[moveCount];
            int edgeId;
            switch (c)
            {
                case 'U':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Up];
                    if (wallRateV[edgeId] != 0.0) wallRateV[edgeId] = (wallRateV[edgeId] + (100 - _p) / 100.0) / 2;
                    y--;
                    break;
                case 'D':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Down];
                    if (wallRateV[edgeId] != 0.0) wallRateV[edgeId] = (wallRateV[edgeId] + (100 - _p) / 100.0) / 2;
                    y++;
                    break;
                case 'L':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Left];
                    if (wallRateH[edgeId] != 0.0) wallRateH[edgeId] = (wallRateV[edgeId] + (100 - _p) / 100.0) / 2;
                    x--;
                    break;
                case 'R':
                    edgeId = _grid.Cells[pos].EdgeIds[Direction.Right];
                    if (wallRateH[edgeId] != 0.0) wallRateH[edgeId] = (wallRateV[edgeId] + (100 - _p) / 100.0) / 2;
                    x++;
                    break;
            }
        }

    }

}

public class Grid
{
    public int Height;
    public int Width;
    public int AreaSize;
    public Cell[] Cells;

    public Grid(int height, int width)
    {
        Height = height;
        Width = width;
        AreaSize = height * width;

        InitCells();
        Add4Connect();
        SetEdgeId();
    }

    void InitCells()
    {
        Cells = new Cell[AreaSize];
        for (var y = 0; y < Height; y++)
        {
            for (var x = 0; x < Width; x++)
            {
                var pos = y * Width + x;
                Cells[pos] = new Cell() { X = x, Y = y, Pos = pos, RelationCells = new List<Cell>() };
            }
        }
    }

    /// <summary>関係セルに4近傍の連結セルを追加する</summary>
    /// <param name="mask">立っているビットの位置のみ生成する　1:up 2:left 4:down 8:right</param>
    public void Add4Connect(int mask = 15)
    {
        for (var y = 0; y < Height; y++)
        {
            for (var x = 0; x < Width; x++)
            {
                var pos = y * Width + x;
                var baseCell = Cells[pos];
                var relation = new List<Cell>();
                baseCell.RelationCells = relation;
                // 上下左右でループしないケース用
                if ((mask & 1) != 0 && y > 0) relation.Add(Cells[pos - Width]);            // up
                if ((mask & 2) != 0 && x > 0) relation.Add(Cells[pos - 1]);                // left
                if ((mask & 4) != 0 && y < Height - 1) relation.Add(Cells[pos + Width]);   // down
                if ((mask & 8) != 0 && x < Width - 1) relation.Add(Cells[pos + 1]);        // right
            }
        }
    }

    void SetEdgeId()
    {
        for (var y = 0; y < Height; y++)
        {
            for (var x = 0; x < Width; x++)
            {
                var pos = y * Width + x;
                var cell = Cells[pos];
                cell.EdgeIds[Direction.Up] = x * (Height - 1) + y;
                cell.EdgeIds[Direction.Down] = x * (Height - 1) + y + 1;
                cell.EdgeIds[Direction.Left] = y * (Width - 1) + x;
                cell.EdgeIds[Direction.Right] = y * (Width - 1) + x + 1;
            }
        }
    }

}

public class Direction
{
    public const int Up = 0;
    public const int Down = 1;
    public const int Left = 2;
    public const int Right = 3;
}

public class Cell
{
    public int X;
    public int Y;
    public int Pos;
    /// <summary>関係セル [index]</summary>
    public List<Cell> RelationCells;
    public int[] EdgeIds = new int[4];
}
0