Submission #43861705

---

Source Code Expand

import sys
import itertools
import math
import collections
import bisect
import heapq

input = sys.stdin.readline
sys.setrecursionlimit(10**7)

INF = 10**18


def main():
    N,M = list(map(int, input().split()))
    S = [list(input().strip()) for _ in range(N)]

    t = [[False]*M for _ in range(N)]

    todo = []
    todo.append((1,1))
    done = set()
    while todo:
        cur = todo.pop()
        if cur in done:
            continue
        done.add(cur)
        t[cur[0]][cur[1]] = True
        for i,j in [[0,1],[1,0],[-1,0],[0,-1]]:
            cur_i = cur[0]
            cur_j = cur[1]
            while S[cur_i+i][cur_j+j] != "#":
                cur_i += i
                cur_j += j
                t[cur_i][cur_j] = True
            if (cur_i,cur_j) not in done:
                todo.append((cur_i,cur_j))

    cnt = 0
    for i in range(0,N):
        for j in range(0,M):
            if t[i][j] == True:
                cnt +=1
    print(cnt)



main()

Submission Info

Judge Result