1220. [S/W 문제해결 기본] 5일차 - Magnetic

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV14hwZqABsCFAYD&categoryId=AV14hwZqABsCFAYD&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=PYTHON&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

from collections import deque

for tc in range(1,2):
    N=int(input())
    board=[list(map(int,input().split()))for _  in range(N)]

    ns=[deque([]) for _ in range(N)]
    for x in range(N):
        for y in range(N):
            if board[y][x]!=0:
                ns[x].append(board[y][x])

    ans = 0
    for i in range(N):
        # 1) 우선 0을 제거한 뒤 ns[i]에는 1,2만 남도록 함
        # 2) 그 다음 아래 스캔으로 dead‐lock 개수를 셈
        flag = False
        for v in ns[i]:
            if v == 1:
                flag = True
            elif v == 2 and flag:
                ans += 1
                flag = False

    print(f"{tc} {ans}")