最短路
文章平均质量分 78
NineFailure
这个作者很懒,什么都没留下…
展开
-
lightoj 1002 变形dijkstra
I am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has a cost. There are m roads. You are given the number of m原创 2016-09-22 17:20:08 · 321 阅读 · 0 评论 -
HDU - 5876(100/600)
In graph theory, the complementcomplement of a graph GG is a graph HH on the same vertices such that two distinct vertices of HH are adjacent if and only if they are notnot adjacent in GG. Now you are原创 2017-08-26 22:40:33 · 344 阅读 · 0 评论 -
poj1364(91/600)
King Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13778 Accepted: 4887 DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen pra原创 2017-08-14 16:23:41 · 293 阅读 · 0 评论 -
HDU - 5521(69/600)
Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his fences they were separated into different blocks. John’s farm are divided into nn blocks labelled from 1原创 2017-07-29 16:50:38 · 259 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2)B
B. Mike and Shortcuts time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Recently, Mike was very busy with studying for exams and contests. N原创 2017-05-01 17:56:34 · 210 阅读 · 0 评论 -
Codeforces Round #302 (Div. 2)D
D. Destroying Roads time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output In some country there are exactly n cities and m bidirectional roads c原创 2017-02-14 21:08:21 · 248 阅读 · 0 评论 -
HDU5521 双向最短路+优先队列优化
Description Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his fences they were separated into different blocks. John’s farm are divided into blocks labe原创 2016-11-26 23:53:22 · 449 阅读 · 0 评论 -
poj2449 第k短路....A*+最短路
Description“Good man never makes girls wait or breaks an appointment!” said the mandarin duck father. Softly touching his little ducks’ head, he told them a story. “Prince Remmarguts lives in his kingd原创 2016-11-29 14:48:25 · 643 阅读 · 0 评论 -
poj3255 次短路裸题
Description Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along原创 2016-11-28 20:37:35 · 293 阅读 · 0 评论 -
lightoj 1019 模板dijkstra
#include<iostream>#include<algorithm>#include<cstdio>#include<cmath>#include<memory.h>using namespace std;int dis[101];int tu[101][101];int yijing[101];int inf=0x3f3f3f3f;int main(){ int原创 2016-09-28 21:41:09 · 311 阅读 · 0 评论 -
HDU - 6166(102/600)点集之间最短路
Senior Pan fails in his discrete math exam again. So he asks Master ZKC to give him graph theory problems everyday. The task is simple : ZKC will give Pan a directed graph every time, and selects som原创 2017-08-29 12:48:34 · 593 阅读 · 0 评论