The streets in Johnny's town were named by integer numbers from 1 to n, n < 1995.--------事实上边的总数超过了5万。
 The junctions were independently named by integer numbers from 1 to m, m <= 44. --------事实上点的总数超过了50。
No junction connects more than 44 streets. --------事实上有连接超过1000条边的点。

最惨痛的是，题目中这么小的数据让我觉得可以随便用STL，不需要考虑常数时间，不需要考虑高效的数据结构，于是我写了一大堆代码最后TLE了……QAQ

• Re:数据远比你想象的大… (42) HJWAJ 2018-10-07 03:15:14