皓首不倦 不负少年

import syssys.stdin = open('data.txt', 'r')'''BFS 状态拓展应用'''from collections import dequetarget = list( map(int, input().split()) )def hash(arr): ans = 0 base = 1 for i in range(8): ans += arr[i] * base base *= 10 .

import syssys.stdin = open('data.txt', 'r')'''简单BFS找最短路长度'''from collections import dequem, n = map(int, input().split())def bfs(m, n): que = deque() que.append(m) visited = {m} step = 0 while len(que) > 0: node..

import syssys.stdin = open('data.txt', 'r')from collections import dequegrid = []m, n = map(int, input().split())for i in range(m): grid.append( list(map(int, input().split())) )def bfs(i, j) -> int: que = deque() que.append((i, j.

import syssys.stdin = open('data.txt', 'r')from collections import dequegrid = []m, n = map(int, input().split())for i in range(m): s = input() grid.append( [val for val in s] )def bfs(i, j): que = deque() que.append((i, j)) .

import syssys.stdin = open('data.txt', 'r')'''简单bfs应用'''from collections import dequegrid = []n = int(input())for i in range(n): grid.append( list(map(int, input().split())) )prev = {(0, 0): None} # 记录路径que = deque()que.append((0, 0).

import syssys.stdin = open('data.txt', 'r')'''BFS层次遍历，求最短路径长度'''from collections import dequen, m = map(int, input().split())si, sj = -1, -1ei, ej = -1, -1grid = []for i in range(m): s = input() grid.append( [ch for ch in s] ) ..

import syssys.stdin = open('data.txt', 'r')'''多源BFS应用'''from collections import dequem, n = map(int, input().split())one_pos = []for i in range(m): s = input() for j in range(n): if s[j] == '1': one_pos.append((i, ..