Floyd测试点3,4超时
sexs = {} #记录每个人性别,方便后续找异性
#floyd模板
n = int(input())
g = [[0 if i == j else float('inf') for i in range(n+1)] for j in range(n+1)]
for i in range(1,n+1):
temp = input().split()
sexs[i] = temp[0]
for j in range(int(temp[1])):
idx = temp[2+j].index(':')
g[i][int(temp[2+j][:idx])] = min(g[i][int(temp[2+j][:idx])],int(temp[2+j][idx+1:]))
for k in range(1,n+1):
for i in range(1,n+1):
for j in range(1,n+1):
g[i][j] = min(g[i][j],g[i][k] + g[k][j])
#记录每个性别的异性缘
M = []
F = []
for i in range(1,n+1):
sex = sexs[i]
maxD = 0 #维护最短距离的最大值
for j in range(1,n+1):
if sexs[j] != sexs[i] and g[j][i] > maxD:
maxD = g[j][i]
#加入异性缘,编号
if sex == 'F':
F.append([1/maxD,i])
else:
M.append([1/maxD,i])
#排序
F.sort(key=lambda x:(-x[0],x[1]))
M.sort(key=lambda x:(-x[0],x[1]))
#输出
res = []
for i in range(len(F)):
if F[i][0] == F[0][0]:
res.append(F[i][1])
print(*res)
res = []
for i in range(len(M)):
if M[i][0] == M[0][0]:
res.append(M[i][1])
print(*res)