33 lines
864 B
Python
33 lines
864 B
Python
def DaC(paper) :
|
|
n = len(paper)
|
|
firstColor = paper[0][0]
|
|
isMixed = False
|
|
for i in range(n):
|
|
for j in range(n):
|
|
if paper[i][j] != firstColor :
|
|
isMixed = True
|
|
break
|
|
if isMixed :
|
|
break
|
|
|
|
if not isMixed :
|
|
if firstColor == 0 :
|
|
return (1,0)
|
|
else :
|
|
return (0,1)
|
|
|
|
half = n//2
|
|
area1 = [row[0:half] for row in paper[0:half]]
|
|
area2 = [row[half:n] for row in paper[0:half]]
|
|
area3 = [row[0:half] for row in paper[half:n]]
|
|
area4 = [row[half:n] for row in paper[half:n]]
|
|
w1, b1 = DaC(area1)
|
|
w2, b2 = DaC(area2)
|
|
w3, b3 = DaC(area3)
|
|
w4, b4 = DaC(area4)
|
|
|
|
return (w1+w2+w3+w4, b1+b2+b3+b4)
|
|
|
|
paper = [list(map(int, input().split())) for _ in range(int(input()))]
|
|
print('\n'.join(map(str,DaC(paper))))
|