随笔分类 - 最短路
摘要：Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly
阅读全文
摘要：在郊区有 N 座通信基站，P 条双向电缆，第 i 条电缆连接基站AiAi和BiBi。 特别地，1 号基站是通信公司的总站，N 号基站位于一座农场中。 现在，农场主希望对通信线路进行升级，其中升级第 i 条电缆需要花费LiLi。 电话公司正在举行优惠活动。 农产主可以指定一条从 1 号基站到 N 号基
阅读全文
摘要：Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly
阅读全文
摘要：Recently, Shua Shua had a big quarrel with his GF. He is so upset that he decides to take a trip to some other city to avoid meeting her. He will trav
阅读全文
摘要：Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give To
阅读全文
摘要：最短路（vector+Dijkstra优先队列优化） #include<cstdio> #include<iostream> #include<cstring> #include<algorithm> #include<queue> #include<stack> #include<set> #in
阅读全文
摘要：Bessie and the rest of Farmer John's cows are taking a trip this winter to go skiing. One day Bessie finds herself at the top left corner of an R (1 <
阅读全文
摘要：Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchang
阅读全文
摘要：BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical commun
阅读全文
摘要：Description 小明来到青岛上学已经一年了，他给青岛这座城市画了一张地图。在这个地图上有n个点，小明的起始点为1号点，终点为n号点，并且地图上的所有边都是单向的。小明知道从i号点到j号点的时间花费为w分钟，那么问题来了，求从1号点到n号的最小时间花费是多少？这个最少花费的路径有多少条？ In
阅读全文
摘要：Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Be
阅读全文