图论
文章平均质量分 82
yyPurpose_forever
FIGHTING
展开
-
二分图的最大匹配、完美匹配和匈牙利算法
转载自:http://www.renfei.org/blog/bipartite-matching.html二分图:简单来说,如果图中点可以被分为两组,并且使得所有边都跨越组的边界,则这就是一个二分图。准确地说:把一个图的顶点划分为两个不相交集 UU 和VV ,使得每一条边都分别连接UU、VV中的顶点。如果存在这样的划分,则此图为一个二分图。二分图的一个等价定义是:不含有「含奇数条边的转载 2017-08-01 14:00:42 · 212 阅读 · 0 评论 -
codeforces 734e(连通分量缩点)
E. Anton and Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is growing a tree in his garden. In原创 2017-10-23 13:45:05 · 356 阅读 · 0 评论 -
poj2446(二分匹配)
ChessboardTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19296 Accepted: 6088DescriptionAlice and Bob often play games on chessboard. One day, Alice原创 2017-10-15 10:54:02 · 241 阅读 · 0 评论 -
codeforces919d(拓扑排序)
D. Substringtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a graph with n nodes and m direc原创 2018-02-01 11:26:10 · 276 阅读 · 0 评论 -
codeforces915d(拓扑排序)
D. Almost Acyclic Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a directed graph consi原创 2018-02-11 16:34:42 · 344 阅读 · 0 评论 -
poj3352(边双连通分量)
Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12818 Accepted: 6479DescriptionIt's almost summer time, and that means that it's almo原创 2018-02-06 20:04:36 · 511 阅读 · 0 评论 -
poj3177(边双连通分量)
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16931 Accepted: 7063DescriptionIn order to get from one of the F (1 <= F <= 5,000) graz原创 2018-02-06 20:53:23 · 211 阅读 · 0 评论 -
hdu2458(二分图最小点覆盖、最大独立集)
KindergartenTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1346 Accepted Submission(s): 714Problem DescriptionIn a kindergar原创 2018-02-12 19:03:46 · 422 阅读 · 0 评论 -
hdu4292(网络流)
FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6741 Accepted Submission(s): 2279Problem Description You, a part-time di原创 2018-02-12 15:15:52 · 165 阅读 · 0 评论 -
hdu3592 & poj1716 & zoj4028(差分约束)
World ExhibitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1957 Accepted Submission(s): 971Problem DescriptionNowadays,原创 2018-05-03 21:13:28 · 191 阅读 · 0 评论 -
lindström–gessel–viennot lemma应用
对于一张无边权的DAG图,给定n个起点和对应的n个终点,这n条不相交路径的方案数为det() (该矩阵的行列式)其中e(a,b)为图上a到b的方案数 codeforces 348D[给定一张n*m带障碍的图,求从左上角到右下角不相交两条路径的方案][a1=(1,2) a2=(2,1) b1=(n-1,m) b2=(n,m-1) 应用该定理即可]#include&...原创 2018-07-20 20:38:25 · 912 阅读 · 0 评论 -
hdu6370(杭电多校第六场9)环套树
WerewolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1575 Accepted Submission(s): 439Problem Description"The Werewolves" is a pop...原创 2018-08-09 22:41:57 · 235 阅读 · 0 评论 -
hdu2018多校七
Age of MoyuTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1029 Accepted Submission(s): 286Problem DescriptionMr.Quin love fishes so...原创 2018-08-13 21:22:18 · 681 阅读 · 0 评论 -
codeforces 862b
B. Mahmoud and Ehab and the bipartitenesstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud and Ehab原创 2017-10-06 15:11:05 · 427 阅读 · 0 评论 -
codefirces 420e(强连通分量)
E. Strictly Positive Matrixtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have matrix a of size n × n.原创 2017-10-19 15:12:08 · 336 阅读 · 0 评论 -
poj2139(最短路)
Six Degrees of Cowvin BaconTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5996 Accepted: 2810DescriptionThe cows have been making movies lately, so t原创 2017-08-02 16:24:28 · 386 阅读 · 0 评论 -
poj3259(判断有无负环)
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 52961 Accepted: 19743DescriptionWhile exploring his many farms, Farmer John has discovered a原创 2017-08-02 17:42:44 · 255 阅读 · 0 评论 -
poj3268(单源最短路)
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23064 Accepted: 10550DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) convenient原创 2017-08-02 20:08:30 · 327 阅读 · 0 评论 -
poj1258(最小生成树)
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 60241 Accepted: 24975DescriptionFarmer John has been elected mayor of his town! One of his cam原创 2017-08-02 20:32:30 · 331 阅读 · 0 评论 -
poj2377
Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15864 Accepted: 6481DescriptionBessie has been hired to build a cheap internet network原创 2017-08-03 13:51:29 · 218 阅读 · 0 评论 -
poj2395(最小生成树)
Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17710 Accepted: 6969DescriptionThe cows have run out of hay, a horrible event that must be r原创 2017-08-03 14:16:29 · 202 阅读 · 0 评论 -
zoj3204(最小生成树)
Connect themTime Limit: 1 Second Memory Limit: 32768 KBYou have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections a原创 2017-08-17 20:23:56 · 417 阅读 · 0 评论 -
hdu1285(拓扑排序)
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28719 Accepted Submission(s): 11439Problem Description有N个比赛队(1原创 2017-08-19 20:34:23 · 209 阅读 · 0 评论 -
hdu6152
Friend-GraphTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 783 Accepted Submission(s): 414Problem DescriptionIt is well kno原创 2017-08-20 12:20:59 · 264 阅读 · 0 评论 -
zoj2997(拓扑排序)
Black and WhiteTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeWrite a program which reads three positive integers n, p, q. Decide whether or not there exists a sequence原创 2017-09-09 22:50:24 · 246 阅读 · 0 评论 -
hdu6201(拓扑+dp)
transaction transaction transactionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 239 Accepted Submission(s): 102Problem Descr原创 2017-09-10 21:20:48 · 286 阅读 · 0 评论 -
codeforces 427c(强连通分量)
C. Checkpoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYour city has n junctions. There are m one-wa原创 2017-10-19 10:17:18 · 516 阅读 · 0 评论 -
牛客国庆集训派对Day3 I(多源多汇最短路dijkstra变种)
链接:https://www.nowcoder.com/acm/contest/203/I来源:牛客网Metropolis时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 524288K,其他语言1048576K64bit IO Format: %lld题目描述魔方国有n座城市,编号为。城市之间通过n-1条无向道路连接,形成一个树形结构。在若干年之后,其中p...原创 2018-10-04 21:55:11 · 294 阅读 · 0 评论