本文讨论了Bertown城市地铁建设的情况，其中每个车站都有一条通往特定目的地的列车，并且每站都有一个回程站。为了提高地铁的便利性，市长考虑在总统参观前最多改变两条路线。便利性定义为乘客可以从任一站出发并到达另一站的有序对数量。题目要求计算通过最多两次调整所能达到的最大便利性。给出的解决方案包括计算每个连通块的大小，将最大的两个连通块合并，并计算总的可能性。
C. Bertown Subway
time limit per test：1 second
memory limit per test：256 megabytes
input：standard input
output：standard output
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
- For each station i there exists exactly one train that goes from this station. Its destination station is pi, possibly pi = i;
- For each station i there exists exactly one station
最低0.47元/天 解锁文章
187
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
