帮助小Tom找到国家中多个城市环游路线的最短总长度，每个环包含至少两个城市且每个城市只属于一个环。输入包含多组测试用例，每组包含城市数量和道路信息。输出每组测试用例的最短环游路线总长度，若无法形成环游路线则输出-1。
Problem Description
There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two cities, and each city belongs to one cycle exactly. Tom wants the total length of all the tours minimum, but he is too lazy to calculate. Can you help him?
Input
There are several test cases in the input. You should process to the end of file (EOF).
The first line of each test case contains two integers N (N ≤ 100) and M, indicating the number of cities and the number of roads. The M lines followed, each of them contains three numbers A, B, and C,
订阅专栏 解锁全文
扫一扫
381
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
