結果
問題 | No.5006 Hidden Maze |
ユーザー | Risen |
提出日時 | 2022-06-12 16:46:16 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 803 ms / 2,000 ms |
コード長 | 8,563 bytes |
コンパイル時間 | 7,144 ms |
実行使用メモリ | 69,120 KB |
スコア | 47,573 |
平均クエリ数 | 525.27 |
最終ジャッジ日時 | 2022-06-12 16:47:13 |
合計ジャッジ時間 | 57,051 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 195 ms
66,824 KB |
testcase_01 | AC | 404 ms
69,056 KB |
testcase_02 | AC | 230 ms
68,184 KB |
testcase_03 | AC | 252 ms
68,292 KB |
testcase_04 | AC | 263 ms
68,376 KB |
testcase_05 | AC | 327 ms
68,924 KB |
testcase_06 | AC | 640 ms
68,488 KB |
testcase_07 | AC | 743 ms
68,244 KB |
testcase_08 | AC | 751 ms
68,684 KB |
testcase_09 | AC | 756 ms
68,072 KB |
testcase_10 | AC | 150 ms
55,924 KB |
testcase_11 | AC | 212 ms
67,960 KB |
testcase_12 | AC | 227 ms
68,188 KB |
testcase_13 | AC | 266 ms
68,324 KB |
testcase_14 | AC | 678 ms
68,576 KB |
testcase_15 | AC | 535 ms
68,356 KB |
testcase_16 | AC | 405 ms
68,692 KB |
testcase_17 | AC | 302 ms
69,120 KB |
testcase_18 | AC | 719 ms
68,540 KB |
testcase_19 | AC | 782 ms
68,296 KB |
testcase_20 | AC | 198 ms
66,928 KB |
testcase_21 | AC | 251 ms
68,396 KB |
testcase_22 | AC | 167 ms
60,672 KB |
testcase_23 | AC | 437 ms
68,356 KB |
testcase_24 | AC | 590 ms
68,128 KB |
testcase_25 | AC | 725 ms
68,312 KB |
testcase_26 | AC | 785 ms
68,948 KB |
testcase_27 | AC | 177 ms
62,092 KB |
testcase_28 | AC | 750 ms
68,556 KB |
testcase_29 | AC | 202 ms
66,776 KB |
testcase_30 | AC | 247 ms
68,120 KB |
testcase_31 | AC | 222 ms
68,136 KB |
testcase_32 | AC | 236 ms
68,236 KB |
testcase_33 | AC | 313 ms
68,376 KB |
testcase_34 | AC | 258 ms
68,816 KB |
testcase_35 | AC | 248 ms
69,016 KB |
testcase_36 | AC | 217 ms
68,760 KB |
testcase_37 | AC | 282 ms
67,828 KB |
testcase_38 | AC | 777 ms
68,328 KB |
testcase_39 | AC | 158 ms
57,720 KB |
testcase_40 | AC | 174 ms
61,884 KB |
testcase_41 | AC | 378 ms
68,780 KB |
testcase_42 | AC | 730 ms
68,556 KB |
testcase_43 | AC | 803 ms
69,028 KB |
testcase_44 | AC | 333 ms
69,104 KB |
testcase_45 | AC | 330 ms
68,680 KB |
testcase_46 | AC | 485 ms
68,844 KB |
testcase_47 | AC | 388 ms
68,044 KB |
testcase_48 | AC | 734 ms
68,924 KB |
testcase_49 | AC | 746 ms
68,104 KB |
testcase_50 | AC | 338 ms
68,180 KB |
testcase_51 | AC | 237 ms
68,144 KB |
testcase_52 | AC | 395 ms
68,632 KB |
testcase_53 | AC | 288 ms
68,560 KB |
testcase_54 | AC | 750 ms
68,760 KB |
testcase_55 | AC | 247 ms
67,960 KB |
testcase_56 | AC | 335 ms
68,280 KB |
testcase_57 | AC | 726 ms
68,964 KB |
testcase_58 | AC | 766 ms
68,500 KB |
testcase_59 | AC | 718 ms
68,260 KB |
testcase_60 | AC | 152 ms
56,916 KB |
testcase_61 | AC | 211 ms
67,888 KB |
testcase_62 | AC | 486 ms
68,900 KB |
testcase_63 | AC | 253 ms
68,168 KB |
testcase_64 | AC | 463 ms
68,756 KB |
testcase_65 | AC | 749 ms
68,344 KB |
testcase_66 | AC | 141 ms
54,312 KB |
testcase_67 | AC | 209 ms
68,024 KB |
testcase_68 | AC | 734 ms
68,132 KB |
testcase_69 | AC | 738 ms
68,824 KB |
testcase_70 | AC | 192 ms
65,732 KB |
testcase_71 | AC | 202 ms
65,956 KB |
testcase_72 | AC | 316 ms
68,256 KB |
testcase_73 | AC | 707 ms
68,540 KB |
testcase_74 | AC | 323 ms
68,836 KB |
testcase_75 | AC | 744 ms
68,512 KB |
testcase_76 | AC | 719 ms
68,560 KB |
testcase_77 | AC | 797 ms
68,280 KB |
testcase_78 | AC | 734 ms
68,424 KB |
testcase_79 | AC | 783 ms
68,436 KB |
testcase_80 | AC | 207 ms
67,856 KB |
testcase_81 | AC | 240 ms
68,260 KB |
testcase_82 | AC | 248 ms
68,096 KB |
testcase_83 | AC | 154 ms
57,160 KB |
testcase_84 | AC | 147 ms
55,036 KB |
testcase_85 | AC | 352 ms
68,540 KB |
testcase_86 | AC | 335 ms
68,200 KB |
testcase_87 | AC | 502 ms
68,956 KB |
testcase_88 | AC | 762 ms
68,296 KB |
testcase_89 | AC | 777 ms
68,600 KB |
testcase_90 | AC | 277 ms
67,976 KB |
testcase_91 | AC | 518 ms
68,584 KB |
testcase_92 | AC | 322 ms
68,344 KB |
testcase_93 | AC | 237 ms
68,256 KB |
testcase_94 | AC | 737 ms
68,800 KB |
testcase_95 | AC | 539 ms
68,944 KB |
testcase_96 | AC | 183 ms
62,932 KB |
testcase_97 | AC | 754 ms
68,480 KB |
testcase_98 | AC | 741 ms
68,796 KB |
testcase_99 | AC | 789 ms
68,760 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/
ソースコード
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) { 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) { 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); } } }