Прямоугольник m×n составлен из единичных квадратов

def is_correct_coord(coord):
    return 0 <= coord[0] < n and 0 <= coord[1] < m
 
def is_begin_of_segment(i, j):
    L = '\\'
    R = '/'
    H = '-'
    V = '|'
 
    prev_coord_of_symb =    {
                                L:(i-1,j-1),
                                R:(i-1,j+1),
                                H:(i,j-1),
                                V:(i-1,j)
                            }
    symb = arr[i][j]
    if not symb in prev_coord_of_symb:
        return False
    prev_coord = prev_coord_of_symb[symb]
    return not (is_correct_coord(prev_coord) and arr[prev_coord[0]][prev_coord[1]] == symb)
 
n, m = [int(x) for x in input('n,m->').split()]
arr = []
for i in range(n):
    arr.append(input(f'строка {i+1}->'))
 
res = 0
for i in range(n):
    for j in range(m):
        res += is_begin_of_segment(i,j)
print(res)

n, m = map(int, input().split())
a = [input() for i in range(n)]
ans = 0
for i in range(n):
    for j in range(m):
        if a[i][j] == '.':
            continue
        if j + 1 < m and a[i][j] == '-' and a[i][j + 1] == '-':
            continue
        if i + 1 < n and a[i][j] == '|' and a[i + 1][j] == '|':
            continue
        ans += 1
print(ans)

def is_correct_coord(coord):
    return 0 <= coord[0] < n and 0 <= coord[1] < m
 
def is_begin_of_segment(i, j):
    prev_coord_of_symb =    {
                                chr(92): (i - 1, j - 1),
                                '/': (i - 1, j + 1),
                                '-': (i, j - 1),
                                '|': (i - 1, j)
                            }
    symb = arr[i][j]
    if not symb in prev_coord_of_symb:
        return False
    prev_coord = prev_coord_of_symb[symb]
    return not (is_correct_coord(prev_coord) and arr[prev_coord[0]][prev_coord[1]] == symb)
 
n, m = [int(x) for x in input().split()]
arr = []
for i in range(n):
    arr.append(input())
 
res = 0
for i in range(n):
    for j in range(m):
        res += is_begin_of_segment(i, j)
print(res)