Submission #5852963


Source Code Expand

import numpy as np

H,W = map(int,input().split())
temp = np.array([list(input()) for _ in range(H)])
# 周りに壁を、0,1化
map = np.zeros((H+2,W+2),dtype=np.int32)
map[1:-1,1:-1][temp == '.'] = 1

# x軸正方向の集計
def F():
  x = map.copy()
  for row in range(1,H+1):
    zero_idx = np.nonzero(x[row]==0)[0]
    x[row, zero_idx[1:]] = 1-np.diff(zero_idx) # cumsumで求められるように変形
  x = x.cumsum(axis = 1)
  return x

# y軸
def G():
  x = map.T.copy()
  for row in range(1,W+1):
    zero_idx = np.nonzero(x[row]==0)[0]
    x[row, zero_idx[1:]] = 1-np.diff(zero_idx) # cumsumで求められるように変形
  x = x.cumsum(axis = 1)
  return x.T

answer = np.zeros_like(map)
# x軸
answer += F()
# 逆順
map = map[:,::-1]
answer += F()[:,::-1]
map = map[:,::-1]

# y軸
answer += G()
# 逆順
map = map[::-1,:]
answer += G()[::-1,:]

answer = np.max(answer) - 3
print(answer)

Submission Info

Submission Time
Task D - Lamp
User maspy
Language Python (3.4.3)
Score 400
Code Size 949 Byte
Status AC
Exec Time 1665 ms
Memory 141856 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 17
Set Name Test Cases
Sample 01.txt, 02.txt
All 01.txt, 02.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt
Case Name Status Exec Time Memory
01.txt AC 298 ms 20400 KiB
02.txt AC 148 ms 12384 KiB
11.txt AC 1101 ms 139580 KiB
12.txt AC 1577 ms 137772 KiB
13.txt AC 1457 ms 137488 KiB
14.txt AC 1201 ms 139620 KiB
15.txt AC 961 ms 130752 KiB
16.txt AC 1041 ms 137520 KiB
17.txt AC 1312 ms 139580 KiB
18.txt AC 1535 ms 139620 KiB
19.txt AC 929 ms 137424 KiB
20.txt AC 245 ms 12752 KiB
21.txt AC 148 ms 12384 KiB
22.txt AC 181 ms 13868 KiB
23.txt AC 1665 ms 141856 KiB
24.txt AC 242 ms 12624 KiB
25.txt AC 251 ms 12712 KiB