結果

問題 No.5006 Hidden Maze
ユーザー titan23titan23
提出日時 2022-06-12 17:13:26
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 439 ms / 2,000 ms
コード長 5,143 bytes
コンパイル時間 227 ms
実行使用メモリ 103,224 KB
スコア 5,231
平均クエリ数 947.84
最終ジャッジ日時 2022-06-12 17:14:11
合計ジャッジ時間 43,974 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 427 ms
101,060 KB
testcase_01 AC 421 ms
102,404 KB
testcase_02 AC 407 ms
100,968 KB
testcase_03 AC 396 ms
100,564 KB
testcase_04 AC 382 ms
102,812 KB
testcase_05 AC 396 ms
101,352 KB
testcase_06 AC 365 ms
100,568 KB
testcase_07 AC 408 ms
101,492 KB
testcase_08 AC 374 ms
101,876 KB
testcase_09 AC 378 ms
101,664 KB
testcase_10 AC 352 ms
101,784 KB
testcase_11 AC 343 ms
101,864 KB
testcase_12 AC 406 ms
101,004 KB
testcase_13 AC 402 ms
101,792 KB
testcase_14 AC 369 ms
100,828 KB
testcase_15 AC 384 ms
100,456 KB
testcase_16 AC 376 ms
100,624 KB
testcase_17 AC 378 ms
101,228 KB
testcase_18 AC 354 ms
100,892 KB
testcase_19 AC 403 ms
101,428 KB
testcase_20 AC 264 ms
99,944 KB
testcase_21 AC 349 ms
100,784 KB
testcase_22 AC 367 ms
100,888 KB
testcase_23 AC 394 ms
101,068 KB
testcase_24 AC 391 ms
101,100 KB
testcase_25 AC 383 ms
100,600 KB
testcase_26 AC 324 ms
100,480 KB
testcase_27 AC 377 ms
100,832 KB
testcase_28 AC 374 ms
101,516 KB
testcase_29 AC 395 ms
102,156 KB
testcase_30 AC 289 ms
99,996 KB
testcase_31 AC 300 ms
100,556 KB
testcase_32 AC 345 ms
101,060 KB
testcase_33 AC 406 ms
101,232 KB
testcase_34 AC 376 ms
100,992 KB
testcase_35 AC 385 ms
101,032 KB
testcase_36 AC 378 ms
101,084 KB
testcase_37 AC 381 ms
101,424 KB
testcase_38 AC 389 ms
100,956 KB
testcase_39 AC 375 ms
100,760 KB
testcase_40 AC 388 ms
101,668 KB
testcase_41 AC 416 ms
103,224 KB
testcase_42 AC 367 ms
101,956 KB
testcase_43 AC 385 ms
101,340 KB
testcase_44 AC 393 ms
101,032 KB
testcase_45 AC 370 ms
100,672 KB
testcase_46 AC 387 ms
101,108 KB
testcase_47 AC 385 ms
101,272 KB
testcase_48 AC 391 ms
101,068 KB
testcase_49 AC 359 ms
101,428 KB
testcase_50 AC 350 ms
101,664 KB
testcase_51 AC 367 ms
102,676 KB
testcase_52 AC 425 ms
102,060 KB
testcase_53 AC 378 ms
101,552 KB
testcase_54 AC 367 ms
100,788 KB
testcase_55 AC 387 ms
101,192 KB
testcase_56 AC 389 ms
100,772 KB
testcase_57 AC 377 ms
100,920 KB
testcase_58 AC 384 ms
101,412 KB
testcase_59 AC 379 ms
101,304 KB
testcase_60 AC 406 ms
100,820 KB
testcase_61 AC 323 ms
102,312 KB
testcase_62 AC 406 ms
101,748 KB
testcase_63 AC 407 ms
102,672 KB
testcase_64 AC 373 ms
101,396 KB
testcase_65 AC 398 ms
101,664 KB
testcase_66 AC 366 ms
100,028 KB
testcase_67 AC 361 ms
101,256 KB
testcase_68 AC 370 ms
101,432 KB
testcase_69 AC 357 ms
101,772 KB
testcase_70 AC 261 ms
100,236 KB
testcase_71 AC 397 ms
102,344 KB
testcase_72 AC 373 ms
101,564 KB
testcase_73 AC 398 ms
101,680 KB
testcase_74 AC 370 ms
101,056 KB
testcase_75 AC 385 ms
100,724 KB
testcase_76 AC 374 ms
100,896 KB
testcase_77 AC 375 ms
101,640 KB
testcase_78 AC 382 ms
100,736 KB
testcase_79 AC 358 ms
101,680 KB
testcase_80 AC 275 ms
100,440 KB
testcase_81 AC 353 ms
100,968 KB
testcase_82 AC 439 ms
101,428 KB
testcase_83 AC 393 ms
102,088 KB
testcase_84 AC 374 ms
101,032 KB
testcase_85 AC 395 ms
101,340 KB
testcase_86 AC 404 ms
101,588 KB
testcase_87 AC 389 ms
101,000 KB
testcase_88 AC 369 ms
101,808 KB
testcase_89 AC 383 ms
100,964 KB
testcase_90 AC 341 ms
101,584 KB
testcase_91 AC 418 ms
102,604 KB
testcase_92 AC 409 ms
102,440 KB
testcase_93 AC 394 ms
101,852 KB
testcase_94 AC 379 ms
101,044 KB
testcase_95 AC 384 ms
100,696 KB
testcase_96 AC 390 ms
100,408 KB
testcase_97 AC 377 ms
101,088 KB
testcase_98 AC 405 ms
100,516 KB
testcase_99 AC 390 ms
101,216 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

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 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

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 get_goal(dist, nowy, nowx):
  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:
      nowy += 1
    elif nowy-1 >= 0 and v[nowy-1][nowx] == 0 and dist[nowy-1][nowx] == d-1:
      nowy -= 1
    elif nowx+1 < 20 and h[nowy][nowx] == 0 and dist[nowy][nowx+1] == d-1:
      nowx += 1
    elif nowx-1 >= 0 and h[nowy][nowx-1] == 0 and dist[nowy][nowx-1] == d-1:
      nowx -= 1
  return (nowy, nowx)



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 < 1000:
  dist = bfs(0, 0)
  indx = (0, 0)
  for i in range(20):
    for j in range(20):
      if dist[i][j] != -1:
        if (i, j) not in seen or random.random() < 0.3:
          if i+j > indx[0]+indx[1]:
            indx = (i, j)
  gy, gx = indx
  seen.add((gy, gx))
  ans = get_root(dist, gy, gx)
  # error(*dist, sep='\n')
  # error()
  # error(*h, sep='\n')
  # error()
  # error(*v, sep='\n')
  
  if dist[19][19] != -1:
    indx = (19, 19)

  for i in range(4):
    res = ans[:]
    if res and same(res[-1], DIRECT[i]): continue
    x, y = get_goal(dist, 0, 0)
    if cannot_move(x, y, DIRECT[i]) and random.random() > 0.7:
      continue
    if x == 0 and DIRECT[i] == 'L':
      continue
    if x == 19 and DIRECT[i] == 'R':
      continue
    if y == 0 and DIRECT[i] == 'U':
      continue
    if y == 19 and DIRECT[i] == 'D':
      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