結果

問題 No.5006 Hidden Maze
ユーザー titan23titan23
提出日時 2022-06-12 15:21:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 321 ms / 2,000 ms
コード長 4,403 bytes
コンパイル時間 399 ms
実行使用メモリ 100,252 KB
スコア 0
平均クエリ数 991.42
最終ジャッジ日時 2022-06-12 15:21:58
合計ジャッジ時間 31,809 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 245 ms
99,456 KB
testcase_01 AC 239 ms
98,936 KB
testcase_02 AC 260 ms
98,816 KB
testcase_03 AC 291 ms
99,848 KB
testcase_04 AC 255 ms
98,692 KB
testcase_05 AC 269 ms
99,168 KB
testcase_06 AC 245 ms
99,044 KB
testcase_07 AC 265 ms
99,320 KB
testcase_08 AC 256 ms
98,484 KB
testcase_09 AC 246 ms
99,232 KB
testcase_10 AC 304 ms
99,148 KB
testcase_11 AC 303 ms
98,976 KB
testcase_12 AC 251 ms
99,744 KB
testcase_13 AC 245 ms
99,628 KB
testcase_14 AC 254 ms
99,228 KB
testcase_15 AC 256 ms
99,128 KB
testcase_16 AC 283 ms
99,352 KB
testcase_17 AC 260 ms
99,068 KB
testcase_18 AC 260 ms
99,256 KB
testcase_19 AC 250 ms
99,308 KB
testcase_20 AC 239 ms
99,144 KB
testcase_21 AC 219 ms
98,508 KB
testcase_22 AC 282 ms
99,528 KB
testcase_23 AC 269 ms
99,044 KB
testcase_24 AC 321 ms
99,584 KB
testcase_25 AC 271 ms
98,992 KB
testcase_26 AC 254 ms
98,888 KB
testcase_27 AC 236 ms
98,048 KB
testcase_28 AC 255 ms
99,152 KB
testcase_29 AC 267 ms
99,984 KB
testcase_30 AC 296 ms
100,252 KB
testcase_31 AC 280 ms
99,860 KB
testcase_32 AC 257 ms
99,508 KB
testcase_33 AC 274 ms
99,548 KB
testcase_34 AC 308 ms
99,564 KB
testcase_35 AC 263 ms
99,396 KB
testcase_36 AC 254 ms
99,056 KB
testcase_37 AC 217 ms
98,516 KB
testcase_38 AC 251 ms
99,428 KB
testcase_39 AC 264 ms
98,432 KB
testcase_40 AC 293 ms
99,352 KB
testcase_41 AC 267 ms
99,368 KB
testcase_42 AC 301 ms
99,816 KB
testcase_43 AC 306 ms
99,884 KB
testcase_44 AC 273 ms
99,628 KB
testcase_45 AC 272 ms
98,396 KB
testcase_46 AC 233 ms
98,380 KB
testcase_47 AC 276 ms
98,960 KB
testcase_48 AC 258 ms
99,148 KB
testcase_49 AC 250 ms
99,740 KB
testcase_50 AC 254 ms
98,824 KB
testcase_51 AC 318 ms
99,608 KB
testcase_52 AC 271 ms
98,536 KB
testcase_53 AC 238 ms
98,112 KB
testcase_54 AC 258 ms
99,036 KB
testcase_55 AC 275 ms
98,708 KB
testcase_56 AC 272 ms
99,424 KB
testcase_57 AC 282 ms
98,612 KB
testcase_58 AC 255 ms
99,364 KB
testcase_59 AC 253 ms
99,264 KB
testcase_60 AC 306 ms
99,736 KB
testcase_61 AC 285 ms
99,680 KB
testcase_62 AC 274 ms
98,376 KB
testcase_63 AC 265 ms
98,360 KB
testcase_64 AC 259 ms
99,060 KB
testcase_65 AC 273 ms
99,252 KB
testcase_66 AC 269 ms
98,860 KB
testcase_67 AC 232 ms
98,456 KB
testcase_68 AC 245 ms
99,396 KB
testcase_69 AC 287 ms
99,196 KB
testcase_70 AC 314 ms
99,492 KB
testcase_71 AC 301 ms
99,432 KB
testcase_72 AC 279 ms
99,240 KB
testcase_73 AC 292 ms
99,484 KB
testcase_74 AC 262 ms
98,824 KB
testcase_75 AC 280 ms
99,300 KB
testcase_76 AC 265 ms
98,724 KB
testcase_77 AC 254 ms
98,584 KB
testcase_78 AC 241 ms
98,680 KB
testcase_79 AC 232 ms
98,588 KB
testcase_80 AC 300 ms
98,624 KB
testcase_81 AC 260 ms
98,456 KB
testcase_82 AC 286 ms
99,172 KB
testcase_83 AC 287 ms
99,736 KB
testcase_84 AC 260 ms
99,188 KB
testcase_85 AC 255 ms
99,220 KB
testcase_86 AC 260 ms
99,268 KB
testcase_87 AC 242 ms
97,984 KB
testcase_88 AC 240 ms
99,072 KB
testcase_89 AC 253 ms
99,004 KB
testcase_90 AC 286 ms
99,292 KB
testcase_91 AC 285 ms
99,564 KB
testcase_92 AC 256 ms
99,916 KB
testcase_93 AC 266 ms
98,964 KB
testcase_94 AC 263 ms
98,548 KB
testcase_95 AC 301 ms
98,768 KB
testcase_96 AC 275 ms
99,360 KB
testcase_97 AC 242 ms
99,088 KB
testcase_98 AC 269 ms
98,764 KB
testcase_99 AC 262 ms
98,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
import math
from bisect import bisect_right, bisect_left
from itertools import *
from collections import *
from heapq import heapify, heappush, heappop
inf = float('inf')
# mod = 1000000007
# mod = 998244353
input = lambda: sys.stdin.readline().rstrip()
def error(*args, sep=' ', end='\n'):
  print(*args, sep=sep, end=end, file=sys.stderr)
# sys.setrecursionlimit(10**6)
import random

random.seed = 148


##################

def can_move(x, y, d):
  if d == 'U':
    if y and v[y-1][x] == 0:
      return 1
  elif d == 'D':
    if y < 19 and v[y][x] == 0:
      return 1
  elif d == 'L':
    if x and h[y][x-1] == 0:
      return 1
  elif d == 'R':
    if x < 19 and h[y][x] == 0:
      return 1
  return 0

def cannot_move(x, y, d):
  if d == 'U':
    if y and v[y-1][x] == 1:
      return 1
  elif d == 'D':
    if y < 19 and v[y][x] == 1:
      return 1
  elif d == 'L':
    if x and h[y][x-1] == 1:
      return 1
  elif d == 'R':
    if x < 19 and h[y][x] == 1:
      return 1
  return 0

def change_yx(y, x, d):
  if d == 'U': y -= 1
  if d == 'D': y += 1
  if d == 'L': x -= 1
  if d == 'R': x += 1
  return (y, x)

def wall_nasi(res):
  dq = deque(res)
  nowy, nowx = 0, 0
  while dq:
    d = dq.popleft()
    move(nowx, nowy, d)
    nowy, nowx = change_yx(nowy, nowx, d)

def move(x, y, d):
  if d == 'U':
    v[y-1][x] = 0
  if d == 'D':
    v[y][x] = 0
  if d == 'L':
    h[y][x-1] = 0
  if d == 'R':
    h[y][x] = 0

def wall_ari(res):
  dq = deque(res)
  nowy, nowx = 0, 0
  while dq:
    d = dq.popleft()
    if cannot_move(nowx, nowy, d):
      move1(nowx, nowy, d)
      break
    nowy, nowx = change_yx(nowy, nowx, d)

def move1(x, y, d):
  if d == 'U':
    v[y-1][x] = 1
  if d == 'D':
    v[y][x] = 1
  if d == 'L':
    h[y][x-1] = 1
  if d == 'R':
    h[y][x] = 1


H, W, P = map(int, input().split())
h = [[-1]*20 for _ in range(20)]
v = [[-1]*20 for _ in range(20)]
DIRECT = ['U', 'D', 'L', 'R']
dx = [0, 0, -1, 1]
dy = [1, -1, 0, 0]

def bfs(si, sj):
  dist = [[-1]*20 for _ in range(20)]
  dq = deque([(si, sj)])
  dist[si][sj] = 0 
  while dq:
    nowy, nowx = dq.popleft()
    d = dist[nowy][nowx] + 1
    if can_move(nowx, nowy, 'D') and dist[nowy+1][nowx] == -1:
      dq.append((nowy+1, nowx))
      dist[nowy+1][nowx] = d
    if can_move(nowx, nowy, 'U') and dist[nowy-1][nowx] == -1:
      dq.append((nowy-1, nowx))
      dist[nowy-1][nowx] = d
    if can_move(nowx, nowy, 'R') and dist[nowy][nowx+1] == -1:
      dq.append((nowy, nowx+1))
      dist[nowy][nowx+1] = d
    if can_move(nowx, nowy, 'L') and dist[nowy][nowx-1] == -1:
      dq.append((nowy, nowx-1))
      dist[nowy][nowx-1] = d
  return dist
def get_root(dist, nowy, nowx):
  root = []
  while True:
    d = dist[nowy][nowx]
    if d == 0:
      break
    if   nowy+1 < 20 and v[nowy][nowx] == 0 and dist[nowy+1][nowx] == d-1:
      root.append('U')
      nowy += 1
    elif nowy-1 >= 0 and v[nowy-1][nowx] == 0 and dist[nowy-1][nowx] == d-1:
      root.append('D')
      nowy -= 1
    elif nowx+1 < 20 and h[nowy][nowx] == 0 and dist[nowy][nowx+1] == d-1:
      root.append('L')
      nowx += 1
    elif nowx-1 >= 0 and h[nowy][nowx-1] == 0 and dist[nowy][nowx-1] == d-1:
      root.append('R')
      nowx -= 1
  return list(reversed(root))

def same(d1, d2):
  if d1 == 'D' and d2 == 'U': return True
  if d1 == 'U' and d2 == 'D': return True
  if d1 == 'L' and d2 == 'R': return True
  if d1 == 'R' and d2 == 'L': return True
  return False

breakflag = False
ok = []
trynum = 0
seen = set()
while trynum < 990:
  dist = bfs(0, 0)
  # solve?
  if dist[19][19] != -1:
    print(get_root(dist, 19, 19), flush=True)
    resnum = input()
    if resnum == -1:
      break

  # search
  indx = (0, 0, 0)
  for i in range(20):
    for j in range(20):
      if dist[i][j] != -1:
        if (i, j) not in seen:
          indx = max(indx, (i+j, i, j))
  gy, gx = indx[1], indx[2]
  seen.add((gy, gx))
  ans = get_root(dist, gy, gx)
  # error(*dist, sep='\n')
  # error()
  # error(*h, sep='\n')
  # error()
  # error(*v, sep='\n')
  for i in range(4):
    res = ans[:]
    if res and same(res[-1], DIRECT[i]): continue
    res.append(DIRECT[i])
    pred = len(res)
    print(''.join(res), flush=True)
    trynum += 1
    resnum = int(input())
    if resnum == -1:
      breakflag = True
      break
    if pred == resnum:
      wall_nasi(res)
    else:
      wall_ari(res)  
  if breakflag:
    break
0