結果
問題 | No.2412 YOU Grow Bigger! |
ユーザー | flygon |
提出日時 | 2023-08-11 23:45:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,466 ms / 6,000 ms |
コード長 | 1,677 bytes |
コンパイル時間 | 338 ms |
コンパイル使用メモリ | 82,352 KB |
実行使用メモリ | 88,648 KB |
最終ジャッジ日時 | 2024-05-01 06:38:22 |
合計ジャッジ時間 | 12,273 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
55,948 KB |
testcase_01 | AC | 46 ms
56,356 KB |
testcase_02 | AC | 46 ms
55,672 KB |
testcase_03 | AC | 1,466 ms
88,648 KB |
testcase_04 | AC | 1,275 ms
87,848 KB |
testcase_05 | AC | 1,158 ms
85,916 KB |
testcase_06 | AC | 1,376 ms
87,072 KB |
testcase_07 | AC | 1,271 ms
87,324 KB |
testcase_08 | AC | 1,221 ms
86,184 KB |
testcase_09 | AC | 68 ms
73,080 KB |
testcase_10 | AC | 105 ms
77,080 KB |
testcase_11 | AC | 58 ms
67,540 KB |
testcase_12 | AC | 49 ms
62,012 KB |
testcase_13 | AC | 147 ms
78,224 KB |
testcase_14 | AC | 71 ms
72,212 KB |
testcase_15 | AC | 53 ms
64,732 KB |
testcase_16 | AC | 65 ms
70,140 KB |
testcase_17 | AC | 68 ms
72,912 KB |
testcase_18 | AC | 263 ms
78,648 KB |
testcase_19 | AC | 52 ms
64,440 KB |
testcase_20 | AC | 65 ms
69,340 KB |
testcase_21 | AC | 126 ms
77,632 KB |
testcase_22 | AC | 144 ms
78,028 KB |
testcase_23 | AC | 420 ms
79,472 KB |
testcase_24 | AC | 637 ms
80,544 KB |
testcase_25 | AC | 363 ms
78,592 KB |
testcase_26 | AC | 126 ms
78,140 KB |
testcase_27 | AC | 69 ms
72,136 KB |
testcase_28 | AC | 172 ms
78,184 KB |
testcase_29 | AC | 54 ms
65,248 KB |
testcase_30 | AC | 44 ms
55,756 KB |
ソースコード
import sys sys.setrecursionlimit(5*10**5) input = sys.stdin.readline from collections import defaultdict, deque, Counter from heapq import heappop, heappush from bisect import bisect_left, bisect_right from math import gcd h,w = map(int,input().split()) s = [input().rstrip() for i in range(h)] g = [[0]*(w-2) for i in range(h-2)] for i in range(1,h-1): for j in range(1, w-1): ok = 1 for dx in [0,-1,1]: for dy in [0,-1,1]: ok &= s[i+dx][j+dy] == "." g[i-1][j-1] = ok def bfs(x,y,g): que = deque([(x,y)]) depth = [[-1]*(w-2) for i in range(h-2)] depth[x][y] = 0 while que: x,y = que.popleft() for dx in [1,0,-1]: for dy in [1,0,-1]: if dx == 0 and dy == 0: continue nx, ny = x+dx, y+dy if not (0<= nx < h-2 and 0<=ny<w-2): continue if not g[nx][ny]: continue if depth[nx][ny] == -1: depth[nx][ny] = depth[x][y]+1 que.append((nx,ny)) return depth d = bfs(0,0,g) if d[-1][-1] == -1: print(0) else: for i in range(h-2): for j in range(w-2): d1 = max(i,j) d2 = max(h-3-i, w-3-j) if d1 <= 1 or d2 <= 1: continue gg = [g[i][::1] for i in range(h-2)] for di in [-1,0,1]: for dj in [-1,0,1]: ni = i+di nj = j+dj if not (0<=ni<=h-3 and 0<=nj<=w-3): continue gg[i+di][j+dj] = 0 if bfs(0,0,gg)[-1][-1] == -1: print(1) exit() print(2)