牛客242693846号

分类

/ 注册

全部文章（共30篇）

题解 | ？？？

T = int(input()) for _ in range(T): s = list(input()) t = list(input()) p1 = 0 # s的指针 p2 = 0 # t的指针 while p1 < len(s) and p...

2025-07-31

0 15

题解 | 画展布置

将原数组 A 排序；在排序后的数组中寻找长度为 M 的子段；对每个子段，计算它的不和谐度；所以只需找连续 M 个平方值中最大 - 最小最小的。 N, M = map(int, input().split()) A = list(map(int, input().split())) A.sort() ...

2025-07-31

0 25

题解 | 世界树上找米库

import sys from collections import deque def main(): sys.setrecursionlimit(1 << 25) T = int(sys.stdin.readline()) for _ in ran...

2025-07-30

0 23

题解 | 我朋友的朋友不是我的朋友

class SM: def __init__(self, name): self.name = name self.friends = set() self.degree = 0 def add_connection(sm, s, m): ...

2025-07-30

0 15

题解 | 旺仔哥哥走迷宫

from collections import deque class Node(): def __init__(self, x): self.id = x self.connect = [] def bfs(start: int, nodes: lis...

2025-07-30

0 21

题解 | 先序遍历、中序遍历和后序遍历

import sys class TreeNode: def __init__(self, x): self.id = x self.l_child = None self.r_child = None def preorder(root,...

2025-07-30

0 18

题解 | 时津风的资源收集

from collections import deque # 预处理：从起点10到所有[10,300]的最少步数 def bfs_1d(): dist = [float('inf')] * 301 dist[10] = 0 q = deque() q.append...

2025-07-29

0 20

题解 | 走一个大整数迷宫

python3超时用Pypy3运行 from collections import deque n,m,p = map(int,input().split()) A = [list(map(int,input().split())) for _ in range(n)] B = [list(map...

2025-07-28

0 25

题解 | 迷宫

from collections import deque def bfs(start_x:int, start_y:int, maze:list, n:int, m:int): dist = [[-1]*m for _ in range(n)] dist[start_x][sta...

2025-07-28

0 19

题解 | 没挡住洪水

from collections import deque def in_bound(x, y, n): return 0 <= x < n and 0 <= y < n n = int(input()) maze = [list(input()) for _ i...

2025-07-28

0 20