line0=input().split(' ')N=int(line0[2])dic={}for i in range(N):line=input().split(' ')dic[line[0]]=line[1:]flag=Trues1,s2=line0[:-1]visit={}while dic[s1][1]!='-1':visit[s1]=Trues1=dic[s1][1]while dic[s2][1]!='-1':if s2 in visit:ss=s2breaks2=dic[s2][1]else:ss='-1'print (ss)
PAT的测试算例存在问题，而牛客网上的算例都能通过
1032 Sharing（链表） 0、题目 To store English words, one method is to use linked lists an
[算法笔记总目录][Link 1] 一、链表 1. 线性表分为顺序表和链表；链表由若干结点串联而成，结点在内存中的存储位置通常不连续；结点一般由数据域和指针域构成。
Pat 1078. Hashing (25) The task of this problem is simple: insert a sequence of disti
[题目][Link 1] As an emergency rescue team leader of a city, you are given a special ma
[题目][Link 1] Given a collection of number segments, you are supposed to recover the s
[题目传送门][Link 1] 解答 line0=input().split(' ') N=int(line0[2]) dic={}
To store English words, one method is to use linked lists and store a word letter by let
To store English words, one method is to use linked lists and store a word letter by let
1032 挖掘机技术哪家强 （20 分） 为了用事实说明挖掘机技术到底哪家强，PAT 组织了一场挖掘机技能大赛。现请你根据比赛结果统计出技术最强的那个学校。 输入格式：
代码如下： 1 include<iostream> 2 include<vector> 3 include<algorithm> 4 i
比眉伴天荒
àì夳堔傛蜴生んèń
不念不忘少年蓝@
还没有评论，来说两句吧...