[백준] 14890번 경사로 (python 정답 코드)

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

 

import sys
input = sys.stdin.readline

N, L = map(int, input().split())
lines = [list(map(int, input().split())) for _ in range(N)]
    
answer = 0

def is_ok(line):
    visited = [False for _ in range(N)]
    
    for i in range(N-1):
        if line[i] == line[i+1]:
            continue
        
        if abs(line[i] - line[i+1]) >= 2:
            return False
        
        if line[i] > line[i+1]:
            for j in range(1, L+1):
                if i + j >= N or visited[i + j] or line[i+1] != line[i + j]:
                    return False
                visited[i + j] = True 
        
        
        if line[i] < line[i+1]:
            for j in range(L):
                if i - j < 0 or visited[i - j] or line[i] != line[i - j]:
                    return False
                visited[i - j] = True
        
    return True

# 가로 탐색
for i in range(N):
    if is_ok(lines[i]):
        answer += 1

# 세로 탐색
for j in range(N):
    if is_ok([lines[i][j] for i in range(N)]):
        answer += 1

print(answer)