2016年05月_playboy307

原创 hdoj--3081--Marriage Match II（二分图+最大流）

Marriage Match IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3486 Accepted Submission(s): 1129Problem DescriptionPresumab

2016-05-28 10:29:15 373

原创 CSU-1336--Interesting Calculator(bfs)

Interesting CalculatorTime Limit: 2MS Memory Limit: 131072KB 64bit IO Format: %lld & %lluStatusDescriptionThere is an interesting calculator. It has 3 rows

2016-05-26 13:29:21 360

原创 poj--3164--Command Network（最小生成图模板）

Command NetworkTime Limit: 1000MS Memory Limit: 131072KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionAfter a long lasting war on words, a war on

2016-05-24 16:29:36 381

原创 hdoj--4009--Transfer water（最小生成图）

Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4759 Accepted Submission(s): 1693Problem DescriptionXiaoA

2016-05-24 15:35:09 336

转载双联通

[点连通度与边连通度] 在一个无向连通图中，如果有一个顶点集合，删除这个顶点集合，以及这个集合中所有顶点相关联的边以后，原图变成多个连通块，就称这个点集为割点集合。一个图的点连通度的定义为，最小割点集合中的顶点数。类似的，如果有一个边集合，删除这个边集合以后，原图变成多个连通块，就称这个点集为割边集合。一个图的边连通度的定义为，最小割边集合中的边数。

2016-05-22 17:10:32 282

原创 51nod--1483--化学变换（思维）

1483 化学变换题目来源： CodeForces基准时间限制：1 秒空间限制：131072 KB 分值: 20 难度：3级算法题有n种不同的化学试剂。第i种有ai升。每次实验都要把所有的化学试剂混在一起，但是这些试剂的量一定要相等。所以现在的首要任务是把这些化学试剂的量弄成相等。有两种操作：· 把第i种的量翻

2016-05-21 17:42:03 1407

原创 hdoj--4277--USACO ORZ（dfs+剪枝）

USACO ORZTime Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4367 Accepted Submission(s): 1446Problem DescriptionLike everyone, c

2016-05-20 21:40:40 328

原创 Codeforces--675C--Money Transfers（思维）

Money TransfersTime Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThere are n banks in the city where Vasya lives

2016-05-19 22:32:18 501

原创 Codeforces--525D--Arthur and Walls（DFS）

Arthur and WallsTime Limit: 2000MS Memory Limit: 524288KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionFinally it is a day when Arthur has enough mon

2016-05-18 22:22:00 333

原创 LightOj--1071--Baker Vai（拆点最大费用流）

Baker VaiTime Limit: 2000MS Memory Limit: 32768KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionAll of you must have heard the name of Baker Vai. Yes,

2016-05-18 21:12:40 592

原创 Codeforces--246D--Colorful Graph（STL set）（好题）

Colorful GraphTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYou've got an undirected graph, consisting of n

2016-05-17 22:09:50 464

转载二分图性质

定义：1.最大独立点集：在二分图中，求最少的点集，使得任意两个点之间没有直接边连接。2.最小路径覆盖： ①在有向无环图中，求最少的路径，使他们覆盖所有的点，且每一个点只被一条路径覆盖。 ②在有向无环图中，求最少的不相交的路径，使他们覆盖所有的点。 *最小路径覆盖数通俗点说就是给一个图，求最少要走几次才能把所有节点都遍历一

2016-05-17 17:58:27 448

原创 hdoj--3605--Escape（状态压缩+最大流）

EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 8372 Accepted Submission(s): 1893Problem Description2012 If this is the

2016-05-17 16:14:37 289

原创 hdoj--3488--Tour（最小费用）

TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2729 Accepted Submission(s): 1338Problem DescriptionIn the kingdom of Hen

2016-05-16 22:18:53 389

原创 hdoj--2282---Chocolate（最小费用流）

ChocolateTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 622 Accepted Submission(s): 312Problem DescriptionLethe loves eating

2016-05-16 21:20:45 317

原创 poj--3084--Panic Room（最小割）

Panic RoomTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionYou are the lead programmer for the Securitron 9042

2016-05-16 18:54:24 480

原创 UVAlive--4529--Dangerous Tunnels（二分+拆点最大流）

Dangerous TunnelsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionSomewhere in the world, there are two tr

2016-05-16 12:12:32 3532

原创 HZAU--19--Eat Candy（水题）

Eat CandyTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 1333 Solved: 644[Submit][Status][Web Board]Description There is a box with infinite volume. At first there are n cand

2016-05-16 11:17:13 395

原创 HZAU--20--Catching Dogs（模拟）

Catching DogsTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 1145 Solved: 300[Submit][Status][Web Board]Description Diao Yang keeps many dogs. But today his dogs all run away

2016-05-16 11:14:45 418

原创 HZAU--21--Arithmetic Sequence（二维dp）

Arithmetic SequenceTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 1815 Solved: 315[Submit][Status][Web Board]Description Giving a number sequence A with length n, you shoul

2016-05-16 11:04:22 330

原创 Codeforces--140A--New Year Table（思维）

New Year TableTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionGerald is setting the New Year table. The tabl

2016-05-12 22:20:51 478

原创 hdoj--5671--Matrix（思维）

MatrixTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 427Problem DescriptionThere is a matrix

2016-05-11 17:55:16 251

原创 Codeforces--525B--Pasha and String（思维）

Pasha and StringTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionPasha got a very beautiful string s for his bi

2016-05-10 22:36:24 440

原创 hdoj--2426--Interesting Housing Problem（最大费用流）

Interesting Housing ProblemTime Limit: 10000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2972 Accepted Submission(s): 1068Problem Descriptio

2016-05-10 17:06:32 729

原创 Codeforces--670C--Cinema（STL map）

CinemaTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionMoscow is hosting a major international conference, whic

2016-05-10 13:51:48 864

原创 Codeforces--653D--Delivery Bears（二分+最大流）

Delivery BearsTime Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionNiwel is a little golden bear. As everyone knows

2016-05-09 22:05:42 1077

原创 hdoj--3046--Pleasant sheep and big big wolf（最小割经典）

Pleasant sheep and big big wolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2699 Accepted Submission(s): 1114Problem Descrip

2016-05-09 20:57:39 603

原创 poj--1815--Friendship（最小割点集）（枚举求最小字典序）

FriendshipTime Limit: 2000MS Memory Limit: 20000KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionIn modern society, each person has his own friends.

2016-05-09 19:59:14 896

原创 hdoj--3491--Thieves(最小割点集)

ThievesTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1535 Accepted Submission(s): 692Problem DescriptionIn the kingdom of H

2016-05-08 22:20:30 605

原创 hdoj--1530--Maximum Clique（最大团）

Maximum CliqueTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3658 Accepted Submission(s): 1962Problem DescriptionGiven a g

2016-05-08 20:36:16 268

原创 UESTC--1041--Hug the princess（位运算）

Hug the princessTime Limit: 1000MS Memory Limit: 65535KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionThere is a sequence with n elements. Assuming

2016-05-08 16:19:25 477

原创 FZoj--2103--Bin & Jing in wonderland（概率）

Problem 2103 Bin & Jing in wonderlandAccept: 203 Submit: 1050Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionBin has a d

2016-05-07 14:13:00 632 1

原创 Fzoj--2110--Stra（数学几何）

Problem 2110 StarAccept: 864 Submit: 2571Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionOverpower often go t

2016-05-07 12:48:49 494

原创 hdoj--4289--Control（最小割拆点）

ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2623 Accepted Submission(s): 1133Problem Description　　You, the head of

2016-05-04 22:40:56 351

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

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionAs more and more computers are equipped with d

2016-05-04 21:50:26 953

原创福州oj--2233--~APTX4869（并查集）

Problem 2233 ~APTX4869Accept: 28 Submit: 65Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description为了帮助柯南回到一米七四，阿笠博士夜以继日

2016-05-04 20:27:39 459

原创 zzulioj--1842--LT的求助again and again(模拟||LIS)

1842: LT的求助again and againTime Limit: 1 Sec Memory Limit: 256 MBSubmit: 34 Solved: 31SubmitStatusWeb BoardDescription众所周知，我T哥打的一手好斗地主。这天LT正在101斗地主，突然WT说我来给你出道题吧（前面都是我编的）题目如

2016-05-03 22:28:00 305

原创福州oj--2232--炉石传说(最大匹配||最大流)

Problem 2232 炉石传说Accept: 19 Submit: 49Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGG学长虽然并不打炉石传说，但是由于题面需要他便学

2016-05-03 18:59:54 561

原创 zoj--3878--Convert QWERTY to Dvorak（纯暴力）

Convert QWERTY to DvorakTime Limit: 2 Seconds Memory Limit: 65536 KBEdward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Cap

2016-05-03 17:13:31 404

原创 zoj--3872--Beauty of Array（思维）

Beauty of ArrayTime Limit: 2 Seconds Memory Limit: 65536 KBEdward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the ar

2016-05-02 12:40:58 321

jsr173_1.0_api.jar rasolver.jar xbean.jar xbean_xpath.jar xmlbeans-qname.jar

空空如也