
图论
相知无悔
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
hdu 5313 Bipartite Graph 完全二分图 深搜 bitset应用
Bipartite GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 577 Accepted Submission(s): 154Problem DescriptionSoda has a bipar原创 2015-07-27 01:17:12 · 1581 阅读 · 0 评论 -
poj1094 拓扑排序
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24092 Accepted: 8321DescriptionAn ascending sorted sequence of distinct values is one in原创 2013-07-29 09:07:48 · 937 阅读 · 0 评论 -
poj2240 bellman 求最短路
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12918 Accepted: 5441DescriptionArbitrage is the use of discrepancies in currency exchange rates t原创 2013-07-29 09:27:07 · 710 阅读 · 0 评论 -
Codeforces Round #309 (Div. 1) D. Nudist Beach 二分 贪心
D. Nudist Beachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNudist Beach is planning a military operati原创 2015-07-18 10:14:40 · 1149 阅读 · 0 评论 -
Codeforces Round #315 (Div. 1) C. New Language 字典序 2-sat 求解
C. New Languagetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLiving in Byteland was good enough to begin原创 2015-08-12 17:52:36 · 1886 阅读 · 0 评论 -
poj2838 Graph Connectivity 邻接表加上并查集
Graph ConnectivityTime Limit: 8000MS Memory Limit: 131072KTotal Submissions: 3381 Accepted: 883Case Time Limit: 3000MSDescriptionLet us consider an undirect原创 2015-05-19 01:59:47 · 1606 阅读 · 0 评论 -
Codeforces Round #317 [AimFund Thanks-Round] (Div. 1) C. CNF 2 无向图找环
C. CNF 2time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output'In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal norma原创 2015-08-28 23:19:35 · 1092 阅读 · 0 评论 -
Codeforces Round #286 (Div. 2) D. Mr. Kitayuta's Technology 强连通分量 有向图求环
D. Mr. Kitayuta's Technologytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputShuseki Kingdom is the world's原创 2015-08-21 18:08:26 · 3548 阅读 · 0 评论 -
hdu 5423 Rikka with Tree 树的性质
Rikka with TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 165 Accepted Submission(s): 85Problem DescriptionAs we know, Rikka原创 2015-08-29 23:38:44 · 1444 阅读 · 0 评论 -
hdu 5424 Rikka with Graph II 哈密顿通路
Rikka with Graph IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 367 Accepted Submission(s): 90Problem DescriptionAs we know, R原创 2015-08-29 23:34:27 · 1377 阅读 · 0 评论 -
hihoCoder挑战赛14 题目2 : 赛车 树的性质
题目2 : 赛车时间限制:20000ms单点时限:1000ms内存限制:256MB描述幻想乡有一个赛车场。赛车场里有N个地点。同时地点之间还有单向的道路存在。这些道路使得赛车场形成了一个外向树的结构。也就是说,道路将这N个地点连成了一个有根树。并且所有的边都是从父亲指向孩子的。由于幽香喜欢刺激,每次她去赛车场都会从根节点出发,选择原创 2015-08-30 21:12:53 · 952 阅读 · 0 评论 -
Codeforces Round #316 (Div. 2) D. Tree Requests 树 离线在线 算法
D. Tree Requeststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRoman planted a tree consisting of n verti原创 2015-08-18 01:07:20 · 809 阅读 · 0 评论 -
Codeforces Round #287 (Div. 2) E. Breaking Good 最短路
E. Breaking Good time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Breaking Good is a new video game which a lot of gamers want to have. The原创 2015-07-10 10:21:24 · 923 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) D. Vitaly and Cycle 图论 二分图
D. Vitaly and Cycle time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output After Vitaly was expelled from the university, he became interested in原创 2015-07-11 17:48:20 · 1329 阅读 · 0 评论 -
Codeforces Round #285 (Div. 2) C. Misha and Forest 树
C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as a non-directed原创 2015-08-21 11:28:43 · 832 阅读 · 0 评论 -
poj1258 最小生成树 prim算法
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33106 Accepted: 13191DescriptionFarmer John has been elected mayor of his town! One of his campaig原创 2013-07-29 09:11:55 · 890 阅读 · 0 评论 -
poj2253 Dijkstra 求最短路
FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20940 Accepted: 6799DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly原创 2013-07-29 09:29:18 · 884 阅读 · 0 评论 -
hdu 5418 Victor and World 状态压缩dp spfa最短路 floyed最短路
Victor and WorldTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 132 Accepted Submission(s): 66Problem DescriptionAfter trying h原创 2015-08-22 21:49:46 · 980 阅读 · 0 评论 -
Round A APAC Test 2016 Problem C. gCampus 最短路
Problem C. gCampusThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guide t原创 2015-08-24 19:27:26 · 1408 阅读 · 0 评论 -
poj3687 拓扑排序
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9028 Accepted: 2444DescriptionWindy has N balls of distinct weights from 1 unit to N uni原创 2013-07-30 17:19:23 · 921 阅读 · 0 评论 -
poj3894 System Engineer 二分图匹配(匈牙利算法的DFS实现)
System EngineerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 491 Accepted: 208DescriptionBob is a skilled system engineer. He is always facing challengi原创 2013-07-18 15:16:34 · 872 阅读 · 0 评论 -
poj2186 Popular Cows 有向图 强连通分量
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20718 Accepted: 8438DescriptionEvery cow's dream is to become the most popular cow in the herd原创 2013-09-20 11:17:20 · 1179 阅读 · 0 评论 -
hdu 4725 The Shortest Path in Nya Graph dijkstra 求最短路
The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1279 Accepted Submission(s): 286Problem DescriptionThis i原创 2013-09-14 08:50:54 · 1207 阅读 · 0 评论 -
poj1125 floyed 求最短路
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23350 Accepted: 12787DescriptionStockbrokers are known to overreact to rumours. You h原创 2013-07-29 09:09:34 · 708 阅读 · 0 评论 -
poj1062 Dijkstra 求最短路
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31623 Accepted: 8930Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探原创 2013-07-29 09:04:59 · 764 阅读 · 0 评论 -
Good Bye 2014 D. New Year Santa Network 树形dp
D. New Year Santa Networktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming in Tree World!原创 2015-08-22 16:19:40 · 640 阅读 · 0 评论 -
poj1860 bellman 最短路
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16184 Accepted: 5626DescriptionSeveral currency exchange points are working in our city.原创 2013-07-29 09:24:08 · 829 阅读 · 0 评论 -
poj1523 SPF 无向连通图 求割点 关节点 tarjan算法
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5103 Accepted: 2347DescriptionConsider the two networks shown below. Assuming that data moves around th原创 2013-09-18 19:20:19 · 1242 阅读 · 0 评论 -
zoj Burning Bridges 无向连通图 求割点 桥 tarjan
Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KB Ferry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful and ar原创 2013-09-18 21:17:24 · 1172 阅读 · 0 评论 -
hdu4612 Warm up 树形dp 桥 强连通分量
Warm upTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2530 Accepted Submission(s): 592Problem Description N planets are connected by原创 2013-08-29 14:29:19 · 885 阅读 · 0 评论 -
poj3259 bellman_ford 算法 判环 最短路
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24864 Accepted: 8869DescriptionWhile exploring his many farms, Farmer John has discovered a num原创 2013-07-30 17:20:59 · 884 阅读 · 0 评论 -
Good Bye 2014 B. New Year Permutation 并查集 最短路 floyed算法
B. New Year Permutationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputUser ainta has a permutation p1, p2原创 2015-08-22 13:54:30 · 754 阅读 · 0 评论