Dijkstra on 111qqz's bloghttps://111qqz.com/en/tags/dijkstra/Recent content in Dijkstra on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzThu, 14 Jul 2016 17:25:24 +0000hdu 3873 Invade the Mars (有限制条件的最短路。。)https://111qqz.com/en/post/acm-icpc/2016/2016-07-14-hdu-3873/Thu, 14 Jul 2016 17:25:24 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-14-hdu-3873/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=3873" target="_blank" rel="noreferrer">hdu3873题目链接</a></p> <p>题意：n个点的图。。。每个点可能被若干其他点保护。。。被保护的意思是。。。如果想访问某个点。。那么必须先访问保护该点的所有点。。。问从点1到点n的最小代价。。</p>codeforces 567 E President and Roads (优先队列＋迪杰斯特拉＋tarjan)https://111qqz.com/en/post/acm-icpc/2015/2015-08-16-codeforces567epresidentandroadse4bc98e58588e9989fe58897efbc8be8bfaae69db0e696afe789b9e68b89efbc8btarjan/Sun, 16 Aug 2015 19:26:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-16-codeforces567epresidentandroadse4bc98e58588e9989fe58897efbc8be8bfaae69db0e696afe789b9e68b89efbc8btarjan/<p>题意是说，给定一个有向图，对于每一条边，问是否是s到t的最短路上一定会经过的边．</p>