#77973 (PyPy3) No.331 CodeRunnerでやれ

• 問題: No.331 CodeRunnerでやれ
• ユーザー: soupesuteaka
• 提出日時: 2016-02-25 20:07:51
• 言語: PyPy3 (7.3.15)
• 結果: TLE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 3,261 bytes
• コンパイル時間: 363 ms
• コンパイル使用メモリ: 81,876 KB
• 実行使用メモリ: 176,784 KB
• 平均クエリ数: 0.06
• 最終ジャッジ日時: 2024-07-16 22:57:26
• 合計ジャッジ時間: 7,747 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	TLE * 1
other	AC * 1 -- * 15

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#coding: UTF-8
import sys
import re
import itertools
from collections import deque
""" defs """
def searching_forward(x,y,drct,unsearch,searched_point,maze):
    s = input()
    if (s=='Merry Christmas!'):
        return True
    elif (int(s)==20151224):
        while (s!='Merry Christmas!'):
            print('F')
            s = input()
        return True
    else:
        floor_count = int(s)
        if (drct==0):
            for c in range(1,floor_count+1):
                maze[y][x+c] = 1
                if (searched_point[y][x+c]==0):
                    unsearch.append((x+c,y))
        elif (drct==1):
            for c in range(1,floor_count+1):
                maze[y-c][x] = 1
                if (searched_point[y-c][x]==0):
                    unsearch.append((y-c,x))
        elif (drct==2):
            for c in range(1,floor_count+1):
                maze[y][x-c] = 1
                if (searched_point[y][x-c]==0):
                    unsearch.append((y,x-c))
        elif (drct==3):
            for c in range(1,floor_count+1):
                maze[y+c][x] = 1
                if (searched_point[y+c][x]==0):
                    unsearch.append((y+c,x))
def search(x, y, drct,unsearch,searched_point,maze):
    end = searching_forward(x,y,drct,unsearch,searched_point,maze)
    if (end==True):
        return True
    print('L')
    drct = (drct+1) % 4
#   for row in maze:
#       print(row)
    end = searching_forward(x,y,drct,unsearch,searched_point,maze)
    if (end==True):
        return True
    print('L')
    drct = (drct+1) % 4
#   for row in maze:
#       print(row)
        
    end = searching_forward(x,y,drct,unsearch,searched_point,maze)
    if (end==True):
        return True
    print('L')
    drct = (drct+1) % 4
#   for row in maze:
#       print(row)
        
    end = searching_forward(x,y,drct,unsearch,searched_point,maze)
    if (end==True):
        return True
    print('L')
    drct = (drct+1) % 4
#   for row in maze:
#       print(row)
        
    return False
def select_unserch_point(unsearch, searched_point):
    (x,y) = unsearch.popleft()
    searched_point[y][x] = 1
    return x,y
def move_unsearch_point(sx,sy,drct,dx,dy,maze):
    que = deque()
    route = list( [-2]*50 for _ in range(50) )
    que.append((sx,sy,-1))
    while True:
        (x,y,prevdrct) = que.popleft()
        if (route[y][x] != -2):
            continue
        route[y][x] = prevdrct
        if(x==dx and y==dy):
            break
        if(maze[y][x+1]==1):
            que.append((x+1,y,0))
        if(maze[y-1][x]==1):
            que.append((x,y-1,1))
        if(maze[y][x-1]==1):
            que.append((x-1,y,2))
        if(maze[y+1][x]==1):
            que.append((x,y+1,3))
#   for row in route:
#       print(row)
    action = deque()
    nx=dx
    ny=dy
#   print('sx->',sx,'sy->',sy)
    while True:
        if (nx==sx and ny==sy):
            break
#       print(nx,ny)
        nd=route[ny][nx]
        action.appendleft(nd)
        if(nd==0):
            nx -= 1
        elif(nd==1):
            ny += 1
        elif(nd==2):
            nx += 1
        else:
            ny -= 1
#   print(action)
    nx = sx
    ny = sy
    nd = drct
    while True:
        if(nx==dx and ny==dy):
            break
        ac = action.popleft()
        while (ac!=nd):
            print('L')
            nd = (nd+1)%4
        print('F')
        if (nd==0):
            nx += 1
        elif(nd==1):
            ny -=1
        elif(nd==2):
            nx -= 1
        elif(nd==3):
            ny += 1
    return nx,ny,nd
""" main """
maze = list( [0]*50 for _ in range(50) )
#search point
searched_point = list( [0]*50 for _ in range(50) )
#unsearch point
unsearch = deque()
x=25
y=25
searched_point[y][x]=1
#direction 0..right, 1...up, 2...left, 3...down
drct = 0
while True:
    goal = search(x,y,drct,unsearch,searched_point,maze)
    if (goal):
        break
    dx,dy = select_unserch_point(unsearch,searched_point)
    x,y,drct = move_unsearch_point(x,y,drct,dx,dy,maze)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX