def service_dependency:import syssys.setrecursionlimit(10000) # 防止递归深度过大# 读取输入N = int(input)M = int(input)# 构建依赖图graph = [ for _ in range(N)]for i in range(N):parts = list(map(int, input.split))T = parts[0]dependencies = parts[1:]graph[i] = dependencies# 检测循环依赖和收集前置服务visited = [False] * Non_stack = [False] * Nresult = has_cycle = Falsedef dfs(node):nonlocal has_cycleif on_stack[node]:has_cycle = Truereturnif visited[node]:returnvisited[node] = Trueon_stack[node] = Truefor neighbor in graph[node]:if neighbor != node: # 避免自环dfs(neighbor)if neighbor not in result and neighbor != M:result.append(neighbor)on_stack[node] = Falsedfs(M)# 处理结果if has_cycle:print(-1)else:result_sorted = sorted(result)if not result_sorted:print("null")else:print(" ".join(map(str, result_sorted)))# 运行函数service_dependency摘要：def service_dependency:import syssys.setrecursionlimit(10000) # 防止递归深度过大# 读取输入N = int(input)M = int(input)# 构建依赖图graph = [ for _ i
来源：啊将登胡
