坤sir - 博客园

UVA 11624(两次bfs)

摘要： "UVA 11624 " Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape 阅读全文

posted @ 2018-12-12 20:21 坤sir 阅读(160) 评论(0) 推荐(0)

P2296 寻找道路（dfs+spfa）

摘要： "洛谷 P2296 寻找道路" 题目描述在有向图 GG 中，每条边的长度均为 11，现给定起点和终点，请你在图中找一条从起点到终点的路径，该路径满足以下条件：路径上的所有点的出边所指向的点都直接或间接与终点连通。在满足条件 1 1的情况下使路径最短。注意：图 GG 中可能存在重边和自环，题目阅读全文

posted @ 2018-12-12 14:31 坤sir 阅读(190) 评论(0) 推荐(0)

Hdu 1259 World Exhibition（差分约束）

摘要： "hud 1259" World Exhibition Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2168 Accepted Submis 阅读全文

posted @ 2018-11-27 08:47 坤sir 阅读(215) 评论(0) 推荐(0)

POJ 1201 Intervals（差分约束）

摘要： "POJ 1201" Intervals Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30971 Accepted: 11990 Description You are given n closed, integer inte 阅读全文

posted @ 2018-11-22 16:28 坤sir 阅读(146) 评论(0) 推荐(0)

ZOJ 2770 Burn the Linked Camp（裸差分约束）

摘要： "ZOJ 2770" Burn the Linked Camp Time Limit: 2 Seconds Memory Limit: 65536 KB It is well known that, in the period of The Three Empires, Liu Bei, the e 阅读全文

posted @ 2018-11-22 09:19 坤sir 阅读(206) 评论(0) 推荐(0)

POJ 1511 Invitation Cards （堆优化Dijstra）

摘要： "POJ 1511" Invitation Cards Time Limit: 5 Seconds Memory Limit: 65536 KB In the age of television, not many people attend theater performances. Antiqu 阅读全文

posted @ 2018-10-25 16:59 坤sir 阅读(200) 评论(0) 推荐(0)

ZOJ 2008 堆优化的Dijstra

摘要： "ZOJ 2008" Invitation Cards Time Limit: 5 Seconds Memory Limit: 65536 KB In the age of television, not many people attend theater performances. Antiqu 阅读全文

posted @ 2018-10-25 16:57 坤sir 阅读(147) 评论(0) 推荐(0)

POJ 1122 FDNY to the Rescue!（最短路）

摘要： "题目链接" FDNY to the Rescue! Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3405 Accepted: 1063 Description The Fire Department of New York 阅读全文

posted @ 2018-10-24 17:39 坤sir 阅读(195) 评论(0) 推荐(0)

ZOJ 1053 FDNY to the Rescue!(最短路)

摘要： "题目链接" FDNY to the Rescue! Time Limit: 2 Seconds Memory Limit: 65536 KB The Fire Department of New York (FDNY) has always been proud of their response 阅读全文

posted @ 2018-10-24 17:32 坤sir 阅读(208) 评论(0) 推荐(0)

HDU - 1875 （最小生成树）

摘要： "题目链接" 思路：把每个顶点编号，点之间的距离 =10且 include include using namespace std; const int N = 110; struct node{ int u, v; double w; }q[N N]; int n, m, cnt; int xx[ 阅读全文

posted @ 2018-10-23 18:48 坤sir 阅读(170) 评论(0) 推荐(0)