信息学集训队作业

1、Fiber Network的解（100）O(v+e) O(n3) BFS 最快（O(v2+ve)Fiber Network的解（100）O(v+e) O(n3) BFS 最快（O(v2+ve) 根本不用进行26次判断，仅仅需要1次计算就and，or BFS 为对于不同的图，BFS的运算顺序是不一样的。DijkstraFloyd-Warshall 把每条边上的字母用数字表示（a=20 ，b=21 ，c=22 ，等等然后进行 dataij dataijordataikand让为1k的结的子图中i能通向j，1k-1 1k-1 FiberTimelimit:1Memorylimit:Several s

2、tartup companies have decided to build a ernet, called the FiberNet. have alreadyTimelimit:1Memorylimit:Several startup companies have decided to build a ernet, called the FiberNet. have already installed many t routers all around the world. y, started to quarrel about the connecting lines, andended

3、 up with everycompany laying its own of cablesnsomeofthe Now, service providers, who want to send data from node A to node B are curious, company is able to provide the sary connections. Help the providers by answering The ontainsseveraltestcases.Eachtestcasestartswiththenumbernodesofthenetworkn.Inp

4、utisterminatedbyn=0.Otherwise,1=n=Nodeshavethenumbers1,.,n.Thenfollows alistofconnections.connectionstartswithtwonumbersA,B.ThelistofconnectionsisterminatedA=B=0.Otherwise,1=A,B=n,andtheydenotethestartoftheunidirectionalconnection,respectively.Foreveryconnection,theB.Acompanyisidentifiedbyalower-caseletter.Thesetofcompanieshavingconnectionisjustawordedof lower-caseAfterthelistofconnections,eachtestcaseiscompletedbyalistofqueries.byA =B =0.Otherwise,1=A,B =n,andtheydenotethe startandidenticalstartandidenticalstartandendnodeofthequery.Iftherearenocompanies,output-Outp