結果
| 問題 | No.5006 Hidden Maze |
| ユーザー |
 titan23
|
| 提出日時 | 2022-06-12 16:28:47 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
RE
|
| 実行時間 | - |
| コード長 | 5,450 bytes |
| コンパイル時間 | 244 ms |
| 実行使用メモリ | 106,824 KB |
| スコア | 0 |
| 平均クエリ数 | 120.83 |
| 最終ジャッジ日時 | 2022-06-12 16:29:16 |
| 合計ジャッジ時間 | 28,635 ms |
|
ジャッジサーバーID （参考情報） |
judge10 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | RE | - |
| testcase_01 | RE | - |
| testcase_02 | RE | - |
| testcase_03 | AC | 461 ms
101,428 KB |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | AC | 448 ms
102,276 KB |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | RE | - |
| testcase_42 | RE | - |
| testcase_43 | RE | - |
| testcase_44 | RE | - |
| testcase_45 | RE | - |
| testcase_46 | RE | - |
| testcase_47 | RE | - |
| testcase_48 | RE | - |
| testcase_49 | RE | - |
| testcase_50 | RE | - |
| testcase_51 | RE | - |
| testcase_52 | RE | - |
| testcase_53 | RE | - |
| testcase_54 | RE | - |
| testcase_55 | AC | 481 ms
103,080 KB |
| testcase_56 | RE | - |
| testcase_57 | RE | - |
| testcase_58 | RE | - |
| testcase_59 | RE | - |
| testcase_60 | RE | - |
| testcase_61 | AC | 473 ms
102,976 KB |
| testcase_62 | RE | - |
| testcase_63 | RE | - |
| testcase_64 | RE | - |
| testcase_65 | RE | - |
| testcase_66 | RE | - |
| testcase_67 | RE | - |
| testcase_68 | RE | - |
| testcase_69 | RE | - |
| testcase_70 | RE | - |
| testcase_71 | RE | - |
| testcase_72 | RE | - |
| testcase_73 | RE | - |
| testcase_74 | RE | - |
| testcase_75 | RE | - |
| testcase_76 | RE | - |
| testcase_77 | RE | - |
| testcase_78 | RE | - |
| testcase_79 | RE | - |
| testcase_80 | RE | - |
| testcase_81 | RE | - |
| testcase_82 | RE | - |
| testcase_83 | RE | - |
| testcase_84 | RE | - |
| testcase_85 | RE | - |
| testcase_86 | RE | - |
| testcase_87 | RE | - |
| testcase_88 | RE | - |
| testcase_89 | RE | - |
| testcase_90 | RE | - |
| testcase_91 | RE | - |
| testcase_92 | RE | - |
| testcase_93 | RE | - |
| testcase_94 | RE | - |
| testcase_95 | RE | - |
| testcase_96 | RE | - |
| testcase_97 | RE | - |
| testcase_98 | RE | - |
| testcase_99 | AC | 446 ms
101,832 KB |
ソースコード
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 True
elif d == 'D':
if y < 19 and v[y][x] == 1:
return True
elif d == 'L':
if x and h[y][x-1] == 1:
return True
elif d == 'R':
if x < 19 and h[y][x] == 1:
return True
return False
def can_or_cannot_move(x, y, d):
if d == 'U':
if y and v[y-1][x] == -1:
return True
elif d == 'D':
if y < 19 and v[y][x] == -1:
return True
elif d == 'L':
if x and h[y][x-1] == -1:
return True
elif d == 'R':
if x < 19 and h[y][x] == -1:
return True
return False
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 can_or_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
def is_edge(y, x, d):
if x == 0 and d == 'L': return True
if x == 19 and d == 'R': return True
if y == 0 and d == 'U': return True
if y == 19 and d == 'D': return True
return False
breakflag = False
ok = []
trynum = 0
seen = set()
while trynum < 1000:
dist = bfs(0, 0)
indx = []
for i in range(20):
for j in range(20):
if dist[i][j] != -1:
if (i, j) not in seen or random.random()*100 < P:
indx.append((i, j))
gy, gx = random.choice(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')
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()*100 < P:
continue
if is_edge(y, x, 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