結果

問題 No.5006 Hidden Maze
ユーザー kyskys
提出日時 2022-06-12 17:58:41
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 818 ms / 2,000 ms
コード長 5,005 bytes
コンパイル時間 249 ms
実行使用メモリ 103,672 KB
スコア 0
平均クエリ数 1000.00
最終ジャッジ日時 2022-06-12 18:00:13
合計ジャッジ時間 73,343 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 711 ms
101,904 KB
testcase_01 AC 613 ms
102,732 KB
testcase_02 AC 663 ms
101,772 KB
testcase_03 AC 681 ms
101,140 KB
testcase_04 AC 773 ms
103,376 KB
testcase_05 AC 674 ms
103,168 KB
testcase_06 AC 658 ms
101,940 KB
testcase_07 AC 674 ms
102,332 KB
testcase_08 AC 660 ms
101,956 KB
testcase_09 AC 692 ms
101,620 KB
testcase_10 AC 691 ms
100,892 KB
testcase_11 AC 623 ms
101,628 KB
testcase_12 AC 679 ms
101,456 KB
testcase_13 AC 687 ms
102,672 KB
testcase_14 AC 655 ms
101,860 KB
testcase_15 AC 710 ms
101,996 KB
testcase_16 AC 685 ms
101,520 KB
testcase_17 AC 680 ms
102,012 KB
testcase_18 AC 631 ms
101,692 KB
testcase_19 AC 662 ms
102,424 KB
testcase_20 AC 698 ms
101,980 KB
testcase_21 AC 643 ms
103,036 KB
testcase_22 AC 642 ms
101,576 KB
testcase_23 AC 679 ms
102,092 KB
testcase_24 AC 723 ms
102,392 KB
testcase_25 AC 688 ms
102,068 KB
testcase_26 AC 648 ms
101,800 KB
testcase_27 AC 747 ms
103,440 KB
testcase_28 AC 706 ms
103,132 KB
testcase_29 AC 646 ms
102,084 KB
testcase_30 AC 643 ms
102,332 KB
testcase_31 AC 694 ms
101,508 KB
testcase_32 AC 667 ms
102,324 KB
testcase_33 AC 736 ms
102,636 KB
testcase_34 AC 652 ms
101,768 KB
testcase_35 AC 662 ms
103,192 KB
testcase_36 AC 609 ms
101,680 KB
testcase_37 AC 644 ms
101,528 KB
testcase_38 AC 638 ms
101,784 KB
testcase_39 AC 760 ms
102,012 KB
testcase_40 AC 686 ms
102,276 KB
testcase_41 AC 743 ms
102,124 KB
testcase_42 AC 653 ms
101,924 KB
testcase_43 AC 664 ms
102,292 KB
testcase_44 AC 626 ms
101,228 KB
testcase_45 AC 633 ms
101,360 KB
testcase_46 AC 649 ms
101,216 KB
testcase_47 AC 667 ms
102,472 KB
testcase_48 AC 661 ms
101,212 KB
testcase_49 AC 619 ms
102,104 KB
testcase_50 AC 646 ms
101,460 KB
testcase_51 AC 666 ms
101,740 KB
testcase_52 AC 631 ms
102,992 KB
testcase_53 AC 729 ms
102,288 KB
testcase_54 AC 621 ms
101,224 KB
testcase_55 AC 626 ms
101,372 KB
testcase_56 AC 670 ms
101,700 KB
testcase_57 AC 634 ms
101,436 KB
testcase_58 AC 711 ms
102,636 KB
testcase_59 AC 609 ms
100,704 KB
testcase_60 AC 666 ms
102,292 KB
testcase_61 AC 708 ms
102,460 KB
testcase_62 AC 708 ms
102,468 KB
testcase_63 AC 745 ms
102,952 KB
testcase_64 AC 687 ms
102,296 KB
testcase_65 AC 692 ms
101,556 KB
testcase_66 AC 687 ms
102,072 KB
testcase_67 AC 677 ms
101,680 KB
testcase_68 AC 720 ms
102,436 KB
testcase_69 AC 729 ms
102,092 KB
testcase_70 AC 778 ms
101,996 KB
testcase_71 AC 635 ms
101,808 KB
testcase_72 AC 752 ms
102,700 KB
testcase_73 AC 647 ms
101,292 KB
testcase_74 AC 631 ms
102,468 KB
testcase_75 AC 606 ms
101,232 KB
testcase_76 AC 658 ms
101,620 KB
testcase_77 AC 625 ms
102,284 KB
testcase_78 AC 688 ms
102,036 KB
testcase_79 AC 676 ms
101,356 KB
testcase_80 AC 631 ms
100,948 KB
testcase_81 AC 697 ms
103,172 KB
testcase_82 AC 597 ms
100,876 KB
testcase_83 AC 818 ms
103,444 KB
testcase_84 AC 724 ms
101,212 KB
testcase_85 AC 609 ms
101,340 KB
testcase_86 AC 747 ms
103,452 KB
testcase_87 AC 663 ms
101,212 KB
testcase_88 AC 738 ms
103,672 KB
testcase_89 AC 623 ms
101,768 KB
testcase_90 AC 641 ms
101,380 KB
testcase_91 AC 648 ms
101,064 KB
testcase_92 AC 700 ms
102,424 KB
testcase_93 AC 675 ms
102,544 KB
testcase_94 AC 689 ms
102,532 KB
testcase_95 AC 786 ms
102,892 KB
testcase_96 AC 664 ms
102,584 KB
testcase_97 AC 651 ms
102,328 KB
testcase_98 AC 658 ms
102,624 KB
testcase_99 AC 702 ms
102,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque
import sys
from math import sqrt

input = sys.stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(map(int, input().split()))
def miinput(): return map(int, input().split())
def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
def mi0input(): return map(lambda x: int(x) - 1, input().split())
INF = 10**20
MOD = 1000000007
from random import random, seed
seed(101010)

class UnionFindTree:
    def __init__(self, initial_size:int) -> None:
        self.n_nodes = initial_size
        self.parents = [i for i in range(initial_size)]
        self.ranks = [0 for i in range(initial_size)]
        self.size = [1 for i in range(initial_size)]
        self.n_roots = initial_size
    def root(self, n:int) -> int:
        if self.parents[n] == n:
            return n
        else:
            self.parents[n] = self.root(self.parents[n])
            return self.parents[n]
    def same(self, n:int, m:int) -> bool:
        return (self.root(n) == self.root(m))
    def unite(self, n:int, m:int) -> None:
        if self.same(n, m):
            return
        self.n_roots -= 1
        n, m = self.root(n), self.root(m)
        if self.ranks[n] < self.ranks[m]:
            self.parents[n] = m
            self.size[m] += self.size[n]
        else:
            self.parents[m] = n
            self.size[n] += self.size[m]
            if self.ranks[n] == self.ranks[m]:
                self.ranks[n] += 1
    def get_roots(self) -> set:
        return set([self.root(x) for x in range(self.n_nodes)])
    def count_roots(self) -> int:
        return self.n_roots
    def get_tree_size(self, n:int) -> int:
        return self.size[self.root(n)]

def random_direction(p):
    for i in range(3):
        p[i+1] += p[i]
    r = random()
    for i in range(4):
        if p[i] > r:
            return i

H, W, p = liinput()
# URDL
probability = [[[0.99] * W for _ in [0] * H], [[0.99] * W for _ in [0] * H], [[0.99] * W for _ in [0] * H], [[0.99] * W for _ in [0] * H]]
p /= 100
direction_inv = {'U': 0, 'R': 1, 'D': 2, 'L': 3}
direction = 'URDL'
direction_coord = [(-1, 0), (0, 1), (1, 0), (0, -1)]
uf = UnionFindTree(H * W)

for i in range(W):
    probability[0][0][i] = 0
    probability[2][-1][i] = 0

for i in range(H):
    probability[1][i][-1] = 0
    probability[3][i][0] = 0

for _ in [0] * 1000:
    place = [0, 0]
    res = []
    seen = [[False] * W for _ in [0] * H]
    seen[0][0] = True
    for _ in [0] * 400:
        prob_tmp = []
        for i in range(4):
            try:
                dr, dc = direction_coord[i]
                nx = place[0] + dr
                ny = place[1] + dc
                if nx < 0 or nx >= H or ny < 0 or ny >= W or seen[nx][ny]:
                    prob_tmp.append(probability[i][place[0]][place[1]]/10)
                else:
                    prob_tmp.append(probability[i][place[0]][place[1]])
            except IndexError:
                print('IndexError', place)
        sum_prob = sum(prob_tmp)
        for i in range(4):
            prob_tmp[i] /= sum_prob
        d = random_direction(prob_tmp)
        dr, dc = direction_coord[d]
        place[0] += dr
        place[1] += dc
        seen[place[0]][place[1]] = True
        res.append(direction[d])
    print(''.join(res), flush=True)
    thr = iinput()
    if thr == -1:
        exit()
    place = [0, 0]
    for i in range(thr):
        d = direction_inv[res[i]]
        probability[d][place[0]][place[1]] = 1
        dr, dc = direction_coord[d]
        uf.unite(place[0] * W + place[1], (place[0] + dr) * W + place[1] + dc)
        place[0] += dr
        place[1] += dc
        probability[(d+2)%4][place[0]][place[1]] = 1
    if len(res) > thr:
        d = direction_inv[res[thr]]
        q = probability[d][place[0]][place[1]]
        if q < 1:
            new_p = (p * q) / (p * q + 1 - q)
            probability[d][place[0]][place[1]] = new_p
            dr, dc = direction_coord[d]
            place[0] += dr
            place[1] += dc
            probability[(d+2)%4][place[0]][place[1]] = new_p
    if uf.same(0, H*W-1):
        seen = [[None] * W for _ in [0] * H]
        seen[0][0] = ''
        que = deque()
        que.append((0, 0))
        while que:
            x, y = que.popleft()
            for i in range(4):
                dx, dy = direction_coord[i]
                nx = x + dx
                ny = y + dy
                if nx < 0 or nx >= H or ny < 0 or ny >= W or not probability[i][x][y]:
                    continue
                if seen[nx][ny] is not None:
                    continue
                seen[nx][ny] = seen[x][y] + direction[i]
                que.append((nx, ny))
                if nx == H-1 and ny == W-1:
                    print(seen[nx][ny], flush=True)
                    g = iinput()
                    if g == -1:
                        exit()
0