[백준] 14601번: 샤워실 바닥 깔기 | 파이썬

트로미노 알고리즘 문제

 

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

14601번: 샤워실 바닥 깔기 (Large)

 

내 코드😉

import sys
input = sys.stdin.readline

k = int(input())
x, y = map(int, input().split())

num = 0
length = pow(2, k)
map = [[0] * length for _ in range(length)]
map[x - 1][y - 1] = -1

def checkHole(x, y, len):
  for i in range(x, x + len):
    for j in range(y, y + len):
      if map[i][j] != 0:
        return False

  return True

def tromino(x, y, len):
  num += 1
  halfLen = len // 2
  if (checkHole(x, y, halfLen)):
    map[x + halfLen - 1][y + halfLen - 1] = num
  if (checkHole(x, y + halfLen, halfLen)):
    map[x + halfLen - 1][y + halfLen] = num
  if (checkHole(x + halfLen, y, halfLen)):
    map[x + halfLen][y + halfLen - 1] = num
  if (checkHole(x + halfLen, y + halfLen, halfLen)):
    map[x + halfLen][y + halfLen] = num
  if halfLen == 2:
    return

  tromino(x, y, halfLen)
  tromino(x, y +  halfLen, halfLen)
  tromino(x + halfLen, y, halfLen)
  tromino(x + halfLen, y + halfLen, halfLen)

tromino(0, 0, length)

for i in range(length):
  for j in range(length):
    print(map[i][j], end=' ')
  print()

 

 

 

백준 문제 풀이 깃허브 주소입니다 :)

https://github.com/Yiseull/baekjoon

GitHub - Yiseull/baekjoon