阅读背景:

codeforces 602C- The Two Routes 最短路

来源:互联网 

The Two Routes CodeForces - 602C

In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y, there is a bidirectional road between towns x and y if and only if there is no railway between them. Travelling to a different town using one railway or one road always takes exactly one hour.In Absurdist




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: