
强连通
左眼皮跳跳~
这个作者很懒,什么都没留下…
展开
-
hdu 1269 迷宫城堡(强连通 tarjan )
Problem Description为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N Input输入包含多组数据,输入的第一行有两个数:N和M,接下来的M行每行有两个数a和b,表示了一条通道可以从A房间来到B房间。文件最后以两个0结束。 Output对于输入的每组数据,如果任意两个房间都是相互连接的,输出"Yes",否则输出"No原创 2015-03-01 22:33:50 · 564 阅读 · 0 评论 -
poj Popular Cows(tarjan +缩点)
Language:DefaultPopular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24384 Accepted: 10007DescriptionEvery cow's dream is to become the mos原创 2015-03-02 23:20:49 · 516 阅读 · 0 评论 -
POJ 1904 King's Quest(强连通)
Language:DefaultKing's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 7635 Accepted: 2769Case Time Limit: 2000MSDescriptionOnce upon原创 2015-03-20 11:02:11 · 758 阅读 · 0 评论 -
HDU 4685 Prince and Princess(二分图 + 强连通)
Problem DescriptionThere are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love.For all princes,give all the princesses that they love.原创 2015-03-20 22:38:23 · 718 阅读 · 0 评论 -
poj 3352 Road Construction(双联通)
Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10191 Accepted: 5061DescriptionIt's almost summer time, and that means that it's al原创 2015-11-21 19:11:33 · 338 阅读 · 0 评论 -
poj2186 Popular Cows(强连通缩点)
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 28016 Accepted: 11294DescriptionEvery cow's dream is to become the most popular cow in the h原创 2015-11-22 21:11:02 · 353 阅读 · 0 评论 -
poj 3177 Redundant Paths(求最少加几条边将图变为边双连通图)
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11145 Accepted: 4774DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazin原创 2015-11-21 11:34:17 · 418 阅读 · 0 评论