[파이썬] [분할정복] 백준 1992 쿼드트리

문제

https://www.acmicpc.net/problem/1992

1992번: 쿼드트리

 

코드

import sys
input=sys.stdin.readline

n=int(input())
array=[list(map(int, list(input().rstrip()))) for _ in range(n)]

result=[]

def make(n,movie):
    count=0
    global result
    for i in range(n):
        count+=sum(movie[i])

    if count==0:
        result.append("0")
    elif count==n*n:
        result.append("1")
    else:
        result.append("(")
        temp=[movie[i][:n//2] for i in range(n//2)]
        make(n//2,temp)
        temp=[movie[i][n//2:] for i in range(n//2)]
        make(n//2,temp)
        temp=[movie[i][:n//2] for i in range(n//2,n)]
        make(n//2,temp)
        temp = [movie[i][n//2:] for i in range(n // 2, n)]
        make(n // 2, temp)
        result.append(")")
    return "".join(result)

print(make(n,array))