Farm Tour
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 19376 | Accepted: 7527 |
Description
When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <= M <= 10000) paths that connect the fields in various ways. Each path connects two different fields and has a nonzero length smaller than 35,000.
To show off his farm in the best way, he walks a tour that starts at his house, potentially travels through some fields, and ends at the barn. Later, he returns (potentially through some fields) back to his house again.
He wants his tour to be as short as possib
最低0.47元/天 解锁文章
818
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
