結果

問題 No.5006 Hidden Maze
ユーザー RisenRisen
提出日時 2022-06-12 22:58:39
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 616 ms / 2,000 ms
コード長 8,930 bytes
コンパイル時間 11,984 ms
実行使用メモリ 69,412 KB
スコア 53,145
平均クエリ数 469.55
最終ジャッジ日時 2022-06-12 22:59:33
合計ジャッジ時間 49,903 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 296 ms
68,636 KB
testcase_01 AC 312 ms
68,640 KB
testcase_02 AC 249 ms
68,640 KB
testcase_03 AC 221 ms
68,320 KB
testcase_04 AC 272 ms
68,312 KB
testcase_05 AC 218 ms
68,064 KB
testcase_06 AC 267 ms
68,528 KB
testcase_07 AC 594 ms
68,584 KB
testcase_08 AC 569 ms
68,608 KB
testcase_09 AC 562 ms
68,564 KB
testcase_10 AC 206 ms
68,096 KB
testcase_11 AC 229 ms
68,280 KB
testcase_12 AC 316 ms
68,096 KB
testcase_13 AC 165 ms
63,428 KB
testcase_14 AC 616 ms
69,000 KB
testcase_15 AC 191 ms
67,496 KB
testcase_16 AC 187 ms
68,112 KB
testcase_17 AC 607 ms
68,140 KB
testcase_18 AC 423 ms
69,412 KB
testcase_19 AC 161 ms
56,444 KB
testcase_20 AC 182 ms
66,208 KB
testcase_21 AC 163 ms
62,260 KB
testcase_22 AC 440 ms
69,280 KB
testcase_23 AC 199 ms
68,200 KB
testcase_24 AC 400 ms
68,468 KB
testcase_25 AC 413 ms
68,204 KB
testcase_26 AC 450 ms
68,508 KB
testcase_27 AC 523 ms
68,836 KB
testcase_28 AC 163 ms
59,656 KB
testcase_29 AC 600 ms
68,792 KB
testcase_30 AC 184 ms
68,584 KB
testcase_31 AC 287 ms
68,328 KB
testcase_32 AC 276 ms
68,744 KB
testcase_33 AC 366 ms
68,548 KB
testcase_34 AC 112 ms
50,380 KB
testcase_35 AC 317 ms
68,584 KB
testcase_36 AC 587 ms
68,956 KB
testcase_37 AC 610 ms
68,744 KB
testcase_38 AC 577 ms
68,280 KB
testcase_39 AC 603 ms
68,444 KB
testcase_40 AC 173 ms
65,808 KB
testcase_41 AC 166 ms
65,352 KB
testcase_42 AC 219 ms
68,436 KB
testcase_43 AC 451 ms
68,288 KB
testcase_44 AC 307 ms
68,288 KB
testcase_45 AC 231 ms
68,492 KB
testcase_46 AC 590 ms
69,012 KB
testcase_47 AC 262 ms
68,956 KB
testcase_48 AC 235 ms
68,252 KB
testcase_49 AC 600 ms
69,080 KB
testcase_50 AC 205 ms
68,328 KB
testcase_51 AC 302 ms
68,144 KB
testcase_52 AC 373 ms
68,420 KB
testcase_53 AC 374 ms
68,844 KB
testcase_54 AC 253 ms
68,840 KB
testcase_55 AC 616 ms
69,252 KB
testcase_56 AC 206 ms
68,648 KB
testcase_57 AC 579 ms
68,708 KB
testcase_58 AC 588 ms
68,368 KB
testcase_59 AC 172 ms
67,028 KB
testcase_60 AC 176 ms
67,712 KB
testcase_61 AC 141 ms
59,140 KB
testcase_62 AC 308 ms
68,480 KB
testcase_63 AC 214 ms
68,920 KB
testcase_64 AC 381 ms
68,692 KB
testcase_65 AC 331 ms
68,584 KB
testcase_66 AC 152 ms
60,436 KB
testcase_67 AC 124 ms
54,512 KB
testcase_68 AC 558 ms
68,524 KB
testcase_69 AC 335 ms
68,764 KB
testcase_70 AC 148 ms
60,068 KB
testcase_71 AC 157 ms
60,464 KB
testcase_72 AC 145 ms
55,100 KB
testcase_73 AC 274 ms
68,396 KB
testcase_74 AC 200 ms
68,304 KB
testcase_75 AC 386 ms
68,856 KB
testcase_76 AC 111 ms
50,964 KB
testcase_77 AC 191 ms
68,796 KB
testcase_78 AC 316 ms
68,588 KB
testcase_79 AC 605 ms
69,040 KB
testcase_80 AC 268 ms
68,020 KB
testcase_81 AC 205 ms
68,408 KB
testcase_82 AC 132 ms
55,232 KB
testcase_83 AC 117 ms
51,468 KB
testcase_84 AC 329 ms
68,688 KB
testcase_85 AC 454 ms
68,504 KB
testcase_86 AC 92 ms
45,528 KB
testcase_87 AC 413 ms
68,904 KB
testcase_88 AC 393 ms
68,772 KB
testcase_89 AC 569 ms
68,180 KB
testcase_90 AC 206 ms
68,928 KB
testcase_91 AC 295 ms
67,980 KB
testcase_92 AC 301 ms
68,544 KB
testcase_93 AC 298 ms
68,484 KB
testcase_94 AC 158 ms
61,824 KB
testcase_95 AC 573 ms
68,588 KB
testcase_96 AC 224 ms
67,804 KB
testcase_97 AC 580 ms
68,576 KB
testcase_98 AC 569 ms
68,448 KB
testcase_99 AC 286 ms
68,120 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 122 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.Diagnostics;
using System.Linq;
using System.Text;
using static Constants;

public static class Constants
{
    public static readonly int N = 20;

    public static readonly Point[] Dirs =
    {
        new Point(-1, 0), // 左
        new Point(0, -1), // 上
        new Point(1, 0), // 右
        new Point(0, 1), // 下
    };
}

public class PriorityQueue<TKey, TValue>
{
    SortedDictionary<TKey, Stack<TValue>> dict = new SortedDictionary<TKey, Stack<TValue>>();
    int count;

    public int Count
    {
        get
        {
            return count;
        }
    }

    public void Enqueue(TKey key, TValue value)
    {
        Stack<TValue> set;
        if (!dict.TryGetValue(key, out set))
        {
            set = new Stack<TValue>();
            dict[key] = set;
        }

        set.Push(value);
        count++;
    }

    public KeyValuePair<TKey, TValue> Dequeue()
    {
        var queue = dict.First();
        if (queue.Value.Count <= 1)
        {
            dict.Remove(queue.Key);
        }

        var val = queue.Value.Pop();
        count--;
        return new KeyValuePair<TKey, TValue>(queue.Key, val);
    }

    public KeyValuePair<TKey, TValue> Peek()
    {
        var queue = dict.First();
        var val = queue.Value.Peek();
        return new KeyValuePair<TKey, TValue>(queue.Key, val);
    }
}

public struct Point
{
    public int X;
    public int Y;

    public static readonly Point Invalid = new Point(-1, -1);
    public static readonly Point Left = new Point(-1, 0);
    public static readonly Point Up = new Point(0, -1);
    public static readonly Point Right = new Point(1, 0);
    public static readonly Point Down = new Point(0, 1);

    public Point(Point p)
    {
        X = p.X;
        Y = p.Y;
    }

    public Point(int x, int y)
    {
        X = x;
        Y = y;
    }

    public static bool operator ==(Point a, Point b)
    {
        return (a.X == b.X && a.Y == b.Y);
    }

    public static bool operator !=(Point a, Point b)
    {
        return !(a == b);
    }

    //objと自分自身が等価のときはtrueを返す
    public override bool Equals(object obj)
    {
        if (!(obj is Point))
        {
            return false;
        }

        Point p = (Point)obj;
        return (X == p.X && Y == p.Y);
    }

    //Equalsがtrueを返すときに同じ値を返す
    public override int GetHashCode()
    {
        return (X << 16) ^ Y;
    }

    public Point Clone()
    {
        return new Point(X, Y);
    }

    public void Reverse()
    {
        X = -X;
        Y = -Y;
    }

    public static Point operator +(Point a, Point b)
    {
        return new Point(a.X + b.X, a.Y + b.Y);
    }

    public static Point operator -(Point a, Point b)
    {
        return new Point(a.X - b.X, a.Y - b.Y);
    }

    public static Point operator *(Point a, int i)
    {
        return new Point(a.X * i, a.Y * i);
    }

    public static Point operator /(Point a, int i)
    {
        return new Point(a.X / i, a.Y / i);
    }
    public static Point operator +(Point a)
    {
        return new Point(+a.X, +a.Y);
    }

    public static Point operator -(Point a)
    {
        return new Point(-a.X, -a.Y);
    }

    public override string ToString()
    {
        return string.Format("({0},{1})", Y, X);
    }

    public Point Sign()
    {
        return new Point(Math.Sign(X), Math.Sign(Y));
    }

    public int Distance(Point p)
    {
        return Math.Abs(this.X - p.X) + Math.Abs(this.Y - p.Y);
    }

    public char ToDirStr()
    {
        if (X < 0)
        {
            return 'L';
        }
        if (X > 0)
        {
            return 'R';
        }
        if (Y < 0)
        {
            return 'U';
        }
        return 'D';
    }

    public bool InRange()
    {
        return 0 <= X && X < N && 0 <= Y && Y < N;
    }
}

public class Solver
{
    readonly double P;
    int[,] RWall; // -1:壁はない 0以上:移動失敗回数
    int[,] DWall;
    List<Point>[,] Neighbors;

    public Solver(double p)
    {
        P = p;
        RWall = new int[N, N];
        DWall = new int[N, N];
        InitNeighbors();
    }

    void InitNeighbors()
    {
        Neighbors = new List<Point>[N, N];
        for (int y = 0; y < N; y++)
        {
            for (int x = 0; x < N; x++)
            {
                Neighbors[y, x] = new List<Point>();
                var p = new Point(x, y);
                foreach (var dir in Dirs)
                {
                    var nei = p + dir;
                    if (nei.InRange())
                    {
                        Neighbors[y, x].Add(nei);
                    }
                }
            }
        }
    }

    int GetWallValue(Point cur, Point next)
    {
        var dir = next - cur;
        if (dir.Y == 0)
        {
            return RWall[cur.Y, Math.Min(cur.X, next.X)];

        }
        return DWall[Math.Min(cur.Y, next.Y), cur.X];
    }

    double GetProb(Point cur, Point next)
    {
        const double wallProb = 150.0 / 760.0; // 100~200 / 全壁
        var dir = next - cur;
        var wall = GetWallValue(cur, next);
        if (wall == 0)
        {
            return 1.01;
        }
        if (wall == -1)
        {
            return 1;
        }

        // X:k回移動失敗としたとき，ベイズの定理より
        // P(壁|X) = P(X|壁)P(壁) / (P(X|壁)P(壁) + P(X|非壁)P(非壁))
        // ここで，P(X|壁)=1 より
        // P(壁|X) = P(壁) / (P(壁) + p^k*(1-P(壁))
        return 1 - wallProb / (wallProb + Math.Pow(P, wall) * (1 - wallProb));
    }

    public (string, List<Point>) GetAction()
    {
        var start = new Point(0, 0);
        var goal = new Point(N - 1, N - 1);
        var prev = new Dictionary<Point, Point>();
        var queue = new PriorityQueue<double, Point>(); // 確率の降順

        queue.Enqueue(-1, start);
        prev[start] = start;
        while (queue.Count > 0)
        {
            var kv = queue.Dequeue();
            var cur = kv.Value;
            var prob = -kv.Key;
            foreach (var next in Neighbors[cur.Y, cur.X])
            {
                if (prev.ContainsKey(next))
                {
                    continue;
                }

                var nextProb = prob * GetProb(cur, next) * (1 - P);
                queue.Enqueue(-nextProb, next);
                prev[next] = cur;
                if (next == goal)
                {
                    break;
                }
            }
        }

        var way = new List<Point>();
        for (var p = goal; p != start; p = prev[p])
        {
            way.Add(p);
        }
        way.Add(start);
        way.Reverse();
        var acts = new StringBuilder();
        var pr = start;
        foreach (var p in way.Skip(1))
        {
            var dir = p - pr;
            acts.Append(dir.ToDirStr());
            pr = p;
        }
        return (acts.ToString(), way);
    }

    public void SetResult(List<Point> way, int step)
    {
        for (int i = 0; i < step; i++)
        {
            var cur = way[i];
            var next = way[i + 1];
            var dir = next - cur;
            if (dir.Y == 0)
            {
                var y = cur.Y;
                var x = Math.Min(cur.X, next.X);
                RWall[y, x] = -1;
            }
            else
            {
                var y = Math.Min(cur.Y, next.Y);
                var x = cur.X;
                DWall[y, x] = -1;
            }
        }
        {
            var cur = way[step];
            var next = way[step + 1];
            var dir = next - cur;
            if (dir.Y == 0)
            {
                var y = cur.Y;
                var x = Math.Min(cur.X, next.X);
                if (RWall[y, x] >= 0)
                {
                    RWall[y, x]++;
                }
            }
            else
            {
                var y = Math.Min(cur.Y, next.Y);
                var x = cur.X;
                if (DWall[y, x] >= 0)
                {
                    DWall[y, x]++;
                }
            }
        }
    }
}

public static class Solution
{
    public static void Main()
    {
        var vals = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        var h = vals[0];
        var w = vals[1];
        var p = vals[2] * 0.01;

        var solver = new Solver(p);
        try
        {
            while (true)
            {
                (var acts, var way) = solver.GetAction();
                Console.WriteLine(acts);
                var step = int.Parse(Console.ReadLine());
                if (step < 0)
                {
                    break;
                }
                solver.SetResult(way, step);
            }
        }
        catch (Exception e)
        {
            Console.Error.WriteLine(e);
        }
    }
}
0