弱的奋斗之旅

RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14318 Accepted: 5033DescriptionBessie has moved to a small farm and sometimes enjoys returni

MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9173 Accepted: 5613DescriptionBIT has recently taken delivery of their new supercomputer,

LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11246 Accepted: 5401DescriptionLike everyone else, cows like to stand close to their friends whe

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 50118 Accepted: 18480DescriptionWhile exploring his many farms, Farmer John has discovered a

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21567 Accepted: 9843DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) convenientl

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35510 Accepted: 19711DescriptionStockbrokers are known to overreact to rumours. Y

题意  一国家由 n 个城市构成，城市之间有若干双向通路。一乐队在每个城市举办一场演出， 每次演出的票价不同。每个城市中的人，如果在自己城市看演出，只需要花票钱。否则还要加上往返路费。问对于每个城市来说，里面的人看到演出的最小票价是多少。思路  暴力做法 floyd 加 枚举。妥妥的超时（点和边上限 1e5）。   添加一个源点，到其他点的距离等于那些点的点权。则问题转化成了求其他点...