結果

問題 No.5006 Hidden Maze
ユーザー RisenRisen
提出日時 2022-06-12 16:07:48
言語 C#
(.NET 8.0.203)
結果
TLE  
実行時間 -
コード長 7,967 bytes
コンパイル時間 7,065 ms
実行使用メモリ 77,388 KB
スコア 29,650
平均クエリ数 644.44
最終ジャッジ日時 2022-06-12 16:16:23
合計ジャッジ時間 149,268 ms
ジャッジサーバーID
（参考情報） 		judge16 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 816 ms
72,524 KB
testcase_01 TLE -
testcase_02 AC 691 ms
73,084 KB
testcase_03 AC 1,436 ms
73,280 KB
testcase_04 AC 587 ms
75,400 KB
testcase_05 AC 1,901 ms
72,964 KB
testcase_06 AC 1,212 ms
75,428 KB
testcase_07 AC 1,841 ms
73,372 KB
testcase_08 AC 1,960 ms
75,304 KB
testcase_09 AC 1,943 ms
74,772 KB
testcase_10 AC 176 ms
53,528 KB
testcase_11 AC 1,317 ms
72,616 KB
testcase_12 AC 1,827 ms
72,808 KB
testcase_13 AC 620 ms
72,800 KB
testcase_14 AC 1,897 ms
71,600 KB
testcase_15 AC 1,800 ms
75,328 KB
testcase_16 AC 1,885 ms
75,144 KB
testcase_17 AC 507 ms
72,284 KB
testcase_18 TLE -
testcase_19 AC 1,834 ms
73,288 KB
testcase_20 AC 572 ms
73,448 KB
testcase_21 AC 1,836 ms
73,380 KB
testcase_22 AC 113 ms
48,788 KB
testcase_23 AC 1,018 ms
73,348 KB
testcase_24 AC 1,757 ms
73,340 KB
testcase_25 AC 1,817 ms
74,748 KB
testcase_26 TLE -
testcase_27 AC 1,870 ms
73,540 KB
testcase_28 AC 1,842 ms
72,984 KB
testcase_29 AC 729 ms
74,972 KB
testcase_30 AC 780 ms
72,732 KB
testcase_31 AC 907 ms
72,992 KB
testcase_32 TLE -
testcase_33 AC 1,754 ms
70,632 KB
testcase_34 AC 326 ms
66,660 KB
testcase_35 AC 786 ms
73,468 KB
testcase_36 AC 1,895 ms
74,944 KB
testcase_37 TLE -
testcase_38 AC 1,824 ms
75,012 KB
testcase_39 AC 339 ms
64,268 KB
testcase_40 AC 664 ms
73,612 KB
testcase_41 AC 1,768 ms
73,636 KB
testcase_42 AC 1,820 ms
73,456 KB
testcase_43 AC 1,999 ms
75,092 KB
testcase_44 AC 741 ms
72,840 KB
testcase_45 AC 1,922 ms
73,392 KB
testcase_46 AC 1,984 ms
77,388 KB
testcase_47 AC 485 ms
74,584 KB
testcase_48 AC 1,911 ms
72,612 KB
testcase_49 AC 1,955 ms
73,396 KB
testcase_50 AC 1,549 ms
72,872 KB
testcase_51 AC 1,682 ms
72,968 KB
testcase_52 AC 1,881 ms
75,244 KB
testcase_53 AC 1,612 ms
75,908 KB
testcase_54 AC 1,779 ms
73,224 KB
testcase_55 AC 936 ms
73,240 KB
testcase_56 AC 488 ms
73,276 KB
testcase_57 AC 1,847 ms
73,164 KB
testcase_58 AC 1,778 ms
74,888 KB
testcase_59 AC 1,792 ms
72,952 KB
testcase_60 AC 302 ms
63,216 KB
testcase_61 AC 394 ms
73,416 KB
testcase_62 AC 1,800 ms
72,824 KB
testcase_63 AC 841 ms
73,088 KB
testcase_64 AC 1,889 ms
72,948 KB
testcase_65 AC 487 ms
73,204 KB
testcase_66 AC 272 ms
61,356 KB
testcase_67 AC 445 ms
72,596 KB
testcase_68 AC 1,893 ms
72,940 KB
testcase_69 AC 1,748 ms
73,344 KB
testcase_70 AC 188 ms
54,440 KB
testcase_71 AC 644 ms
73,376 KB
testcase_72 AC 878 ms
74,612 KB
testcase_73 AC 1,944 ms
73,072 KB
testcase_74 AC 1,844 ms
74,856 KB
testcase_75 AC 1,888 ms
75,300 KB
testcase_76 AC 1,794 ms
72,624 KB
testcase_77 AC 1,878 ms
72,596 KB
testcase_78 AC 1,940 ms
75,308 KB
testcase_79 TLE -
testcase_80 AC 647 ms
72,884 KB
testcase_81 AC 1,305 ms
73,396 KB
testcase_82 AC 1,842 ms
72,972 KB
testcase_83 AC 145 ms
50,592 KB
testcase_84 AC 186 ms
54,468 KB
testcase_85 AC 1,994 ms
75,216 KB
testcase_86 AC 732 ms
75,316 KB
testcase_87 AC 1,731 ms
73,860 KB
testcase_88 AC 1,944 ms
72,896 KB
testcase_89 AC 1,934 ms
75,212 KB
testcase_90 AC 843 ms
72,692 KB
testcase_91 AC 546 ms
72,820 KB
testcase_92 AC 1,937 ms
72,776 KB
testcase_93 AC 477 ms
72,504 KB
testcase_94 AC 1,877 ms
73,036 KB
testcase_95 AC 1,799 ms
73,388 KB
testcase_96 AC 151 ms
51,420 KB
testcase_97 AC 1,940 ms
72,820 KB
testcase_98 AC 1,882 ms
71,448 KB
testcase_99 AC 1,795 ms
73,052 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 117 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.Last();
        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.Last();
        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)
    {
        var dir = next - cur;
        var wall = GetWallValue(cur, next);
        if (wall == 0)
        {
            return 1.01;
        }
        if (wall == -1)
        {
            return 1;
        }
        return Math.Pow(1 - P, wall);
    }

    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);
                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)
    {
        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