图论
ummmmm
这个作者很懒,什么都没留下…
展开
-
[KM算法 O(n^ 3) ] 带权二分图最大匹配
奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18257Accepted Submission(s): 7702Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长...原创 2019-11-05 20:09:48 · 261 阅读 · 0 评论 -
[2-SAT] 输出路径 POJ3683 Priest John's Busiest Day
Priest John's Busiest DayTime Limit:2000MS Memory Limit:65536K Total Submissions:13255 Accepted:4495 Special Judge DescriptionJohn is the only priest in his town. S...原创 2019-10-30 21:00:43 · 192 阅读 · 0 评论 -
[tarjan缩点 + 割点 / 割边 + 重边] 无向图求割点
#include <iostream>#include <cstdio>#include <cmath>#include <stack>#include <cstring>#define ll long long#define db doubleusing namespace std;const int mn = ...原创 2019-04-15 20:34:58 · 418 阅读 · 0 评论 -
[拓扑排序] 横纵涂色 ZOJ3780
E - Paint the Grid AgainZOJ - 3780Leo has a grid withN×Ncells. He wants to paint each cell with a specific color (either black or white).Leo has a magical brush which can paint any row wit...原创 2019-04-12 17:52:23 · 127 阅读 · 0 评论 -
[tarjan模板] 需要几个点覆盖整张图+需要增加几条边 使全图强联通
A - Network of SchoolsPOJ - 1236A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it d...原创 2019-04-15 16:01:57 · 123 阅读 · 0 评论 -
[tarjan + lca] 动态加边求桥
D - NetworkPOJ - 3694A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or ...原创 2019-04-19 13:53:47 · 270 阅读 · 0 评论 -
[DAG支配树(拓扑排序+LCA)] HDU6604 Blow up the city
Blow up the cityTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 742Accepted Submission(s): 393Problem DescriptionCountry A and B ...原创 2019-09-21 20:37:42 · 365 阅读 · 0 评论