这是一篇关于利用二分搜索解决最短路径问题的博客，具体情境设定在火星国家Altanie，公民的智慧值对应于通行权。题目要求找出从城市1到城市N，总成本低于K的最低智慧值限制。输入包含城市数量、道路数量和成本上限，每条道路有连接的城市、费用和智慧值要求。对于每个测试案例，需要确定是否存在满足条件的最低智慧值，若无解则输出-1。解决方案中建议使用二分查找配合SPFA算法来求解。
G. It is all about wisdom
time limit per test
11.0 s
memory limit per test
1024 MB
input
standard input
output
standard output
Foki is the president of the Martian United States of Altanie, Altanie is a very large and strange country. Each citizen in it has a positive integer wisdom value calculated based on her/his age and educational level (of course Foki has the maximum value). Altanie has a big map for all its roads, this map has the following properties:
最低0.47元/天 解锁文章
扫一扫
1837
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
