提出 #33863865

---

ソースコード 拡げる

from select import select
import sys
import collections
import math
import itertools
sys.setrecursionlimit(50000)
deb = 0


H, W = map(int,input().split())
MAP = [ [0 for i in range(W+2)] for i in range(H+2)]


def main():
    cnt = 0
    for j in range(1,W+1) :
        for i in range(1,H+1) :
            if MAP[i][j] == 0 : 
                occupy((i,j))
                cnt += 1
    return cnt

def occupy(c):
    if c[0]-1 >= 1 and c[1] - 1 >= 1 :
        dx = [-1,0]
        dy = [-1,0]
        for d in itertools.product(dx,dy) : 
            x = c[0] + d[0]
            y = c[1] + d[1]
            MAP[x][y] = -1
    if c[0]-1 >= 1 and c[1] + 1 <= W :
        dx = [-1,0]
        dy = [+1,0]
        for d in itertools.product(dx,dy) : 
            x = c[0] + d[0]
            y = c[1] + d[1]
            MAP[x][y] = -1
    if c[0]+1 <= H and c[1] - 1 >= 1 :
        dx = [+1,0]
        dy = [-1,0]
        for d in itertools.product(dx,dy) : 
            x = c[0] + d[0]
            y = c[1] + d[1]
            MAP[x][y] = -1
    if c[0]+1 <= H and c[1] + 1 <= W :
        dx = [+1,0]
        dy = [+1,0]
        for d in itertools.product(dx,dy) : 
            x = c[0] + d[0]
            y = c[1] + d[1]
            MAP[x][y] = -1

    return True
            
if __name__ == "__main__": 
    print(main())

提出情報

ジャッジ結果