二分图
martinue
攻城狮
展开
-
zoj3460(二分图,拆点,二分)
DescriptionYou control N missile launching towers. Every tower has enough missiles, but for each tower only one missile can be launch at the same time. Before the launching, every missile need T1原创 2016-04-25 21:06:50 · 536 阅读 · 0 评论 -
hdu1045(二分图)
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9579 Accepted Submission(s): 5579Problem DescriptionSuppose that we h原创 2016-05-31 21:08:32 · 366 阅读 · 0 评论 -
hdu5093(二分图)
Battle shipsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1127 Accepted Submission(s): 411Problem DescriptionDear contestan原创 2016-04-30 12:19:48 · 363 阅读 · 0 评论 -
hdu5090(二分图,建图技巧)
Game with PearlsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2205 Accepted Submission(s): 806Problem DescriptionTom and Je原创 2016-06-01 17:28:46 · 445 阅读 · 0 评论 -
hdu1150(二分图最小顶点覆盖)
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7792 Accepted Submission(s): 3895Problem DescriptionAs we all原创 2016-06-01 17:51:33 · 443 阅读 · 0 评论 -
poj1904(二分图最优匹配)
Description Once upon a time there lived a king and he had N sons. And the king wanted to marry his beloved sons on the girls that they did love. So one day the king asked his sons to come原创 2016-06-26 16:37:15 · 528 阅读 · 0 评论 -
分配问题(费用流 or KM算法)
Description 有n件工作要分配给n个人做。第i 个人做第j 件工作产生的效益为ij c 。试设计一个将n件工作分配给n个人做的分配方案,使产生的总效益最大。 对于给定的n件工作和n个人,计算最优分配方案和最差分配方案。Input多组数据输入.每组输入第1 行有1 个正整数n<=50,表示有n件工作要分配给n 个人做。接下原创 2016-06-17 20:55:03 · 2167 阅读 · 0 评论 -
最小路径覆盖问题(二分图)
Description给定有向图G=(V,E)。设P 是G 的一个简单路(顶点不相交)的集合。如果V 中每个顶点恰好在P 的一条路上,则称P是G 的一个路径覆盖。P 中路径可以从V 的任何一个顶点开始,长度也是任意的,特别地,可以为0。G 的最小路径覆盖是G 的所含路径条数最少的路径覆盖。设计一个有效算法求一个有向无环图G 的最小路径覆盖。提示:设V={1,2,...; ,n},构原创 2016-03-11 16:43:06 · 1766 阅读 · 0 评论 -
飞行员配对方案问题(二分图)
飞行员配对方案问题Problem:475Time Limit:1000msMemory Limit:65536KDescription 第二次世界大战时期,英国皇家空军从沦陷国征募了大量外籍飞行员。由皇家空军派出的每一架飞机都需要配备在航行技能和语言上能互相配合的2 名飞行员,其中原创 2016-03-10 21:37:21 · 715 阅读 · 0 评论 -
fzu2141(二分图着色)
DescriptionGiven a simple undirected graph G with n vertices and m edges, your task is to select a sub-bipartite graph of G with at least m/2 edges.In the mathematical field of graph theory, a b原创 2016-07-03 15:54:42 · 686 阅读 · 0 评论 -
poj1422(二分图,最小路径覆盖)
Air RaidTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7666 Accepted: 4569DescriptionConsider a town where all the streets are one-way and each stree原创 2016-03-11 18:40:54 · 300 阅读 · 0 评论 -
hdu1151(二分图最大独立集)
Air RaidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4575 Accepted Submission(s): 3062Problem DescriptionConsider a town w原创 2016-05-31 20:18:10 · 472 阅读 · 0 评论 -
uva11383(KM算法)
Problem GGolden Tiger ClawTime Limit: 8 Second Omi, Raymondo, Clay and Kimiko are on new adventure- in search of new Shen Gong Wu. But Evil Boy Genius Jack Spicer is also there. O原创 2016-04-26 21:26:43 · 519 阅读 · 0 评论 -
hdu4751(判断二分图)
Divide GroupsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1856 Accepted Submission(s): 663Problem Description This ye原创 2016-04-18 12:58:12 · 370 阅读 · 0 评论 -
hdu3829(二分图,最大独立集)
Cat VS DogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 3326 Accepted Submission(s): 1161Problem DescriptionThe zoo have N原创 2016-03-12 17:20:05 · 364 阅读 · 0 评论 -
poj2594(二分图,最小路径覆盖变形)
Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7611 Accepted: 3126DescriptionHave you ever read any book about treasure explorati原创 2016-03-11 19:12:07 · 336 阅读 · 0 评论 -
hdu2444(判断二分图)
The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4306 Accepted Submission(s): 1975Problem Description原创 2016-03-10 20:56:00 · 413 阅读 · 0 评论 -
hdu1281(二分图,棋子,匈牙利匹配)
棋盘游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3547 Accepted Submission(s): 2099Problem Description小希和Gardon在玩一个游戏:对一个N*原创 2016-03-10 16:56:17 · 305 阅读 · 0 评论 -
hdu1083(二分图,匈牙利模板题)
CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5572 Accepted Submission(s): 2688Problem DescriptionConsider a group原创 2016-03-10 10:47:25 · 350 阅读 · 0 评论 -
hdu2063二分图(匈牙利算法模板)
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16349 Accepted Submission(s): 7159Problem DescriptionRPG girls今天和大家一起去游乐场玩原创 2016-03-10 10:17:30 · 436 阅读 · 0 评论 -
poj2771(二分图,最大独立集)
Guardian of DecencyTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5398 Accepted: 2269DescriptionFrank N. Stein is a very conservative high-school tea原创 2016-05-30 16:49:11 · 660 阅读 · 0 评论 -
poj2195(二分图最大匹配,最小费用流)
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21120 Accepted: 10668DescriptionOn a grid map there are n little men and n houses. In each u原创 2016-05-30 17:55:06 · 1517 阅读 · 0 评论 -
二分图匈牙利算法模板
最大匹配数:最大匹配的匹配边的数目最小点覆盖数:选取最少的点,使任意一条边至少有一个端点被选择最大独立数:选取最多的点,使任意所选两点均不相连最小路径覆盖数:对于一个 DAG(有向无环图),选取最少条路径,使得每个顶点属于且仅属于一条路径。路径长可以为0(即单个点)。定理1:最大匹配数 = 最小点覆盖数(这是 Konig 定理)定理2:最大匹配数 = 最大独立数定理3:最小原创 2016-05-31 20:13:57 · 1443 阅读 · 0 评论