2015年02月_理想主义文艺青年

原创 poj 3308 zoj 2874 Paratroopers（最小割）

Language:DefaultParatroopersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7583 Accepted: 2282DescriptionIt is year 2500 A.D. and there is a terr

2015-02-27 19:46:08 832

原创 poj 3469 Dual Core CPU（最小割）

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 19827 Accepted: 8606Case Time Limit: 5000MSDescriptionAs more and more computers ar

2015-02-27 01:55:00 790

原创 poj 1637 Sightseeing tour（混合图欧拉路径判定最大流）

【混合图】混合图（既有有向边又有无向边的图）中欧拉环、欧拉路径的判定需要借助网络流！（1）欧拉环的判定：一开始当然是判断原图的基图是否连通，若不连通则一定不存在欧拉环或欧拉路径（不考虑度数为0的点）。其实，难点在于图中的无向边，需要对所有的无向边定向（指定一个方向，使之变为有向边），使整个图变成一个有向欧拉图（或有向半欧拉图）。若存在一个定向满足此条件，则原图是欧拉图（或半

2015-02-25 21:31:45 1158

原创 poj 3436 ACM Computer Factory（最大流Dinic拆点）

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5572 Accepted: 1912 Special JudgeDescriptionAs you know, all the computers use

2015-02-24 22:48:18 742

原创 poj 2391 Ombrophobic Bovines（最大流（拆点）+floyd+二分）

Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15705 Accepted: 3425DescriptionFJ's cows really hate getting wet so much that the m

2015-02-21 23:52:31 1239

原创 hdu 5175 Misaki's Kiss again

Misaki's Kiss againTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 727 Accepted Submission(s): 179Problem DescriptionAfter th

2015-02-17 02:52:08 938

原创 hdu 5171 GTY's birthday gift(矩阵快速幂)

GTY's birthday giftTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 554 Accepted Submission(s): 232Problem DescriptionFFZ's bi

2015-02-12 17:40:28 757

原创 Fib数模n的循环节

对于一个正整数n，我们求Fib数模n的循环节的长度的方法如下：（1）把n素因子分解，即（2）分别计算Fib数模每个的循环节长度，假设长度分别是（3）那么Fib模n的循环节长度从上面三个步骤看来，貌似最困难的是第二步，那么我们如何求Fib模的循环节长度呢？这里有一个优美的定理：Fib数模的最小

2015-02-10 23:19:23 1109

原创 hnu 13182 Drop Zone（网络流最小割）

Drop ZoneTime Limit: 3000ms, Special Time Limit:7500ms, Memory Limit:65536KBTotal submit users: 4, Accepted users: 2Problem 13182 : No special judgementProblem description

2015-02-10 19:20:58 1009

原创 2013 亚洲区域赛长沙站

Alice's Print ServiceTime Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KBTotal submit users: 22, Accepted users: 14Problem 13161 : No special judgementProblem de

2015-02-05 15:56:49 961

原创 hdu 5167 Fibonacci（dfs）

FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1003 Accepted Submission(s): 264Problem DescriptionFollowing is the

2015-02-03 17:51:08 721

原创 hnu13150（hdu 4565）SO EASY!（矩阵快速幂）

So Easy!Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 18, Accepted users: 8Problem 13150 : No special judgementProblem description

2015-02-03 01:01:14 994

youngkl博客