2015年08月_阿阿阿阿_欢

原创 HDU 3667-- Transportation【最小费最大流 && 拆边建图 && 经典】

TransportationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2441 Accepted Submission(s): 1041Problem DescriptionThere are N cit

2015-08-29 01:07:34 1426

原创 ZOJ 3885--The Exchange of Items【最小费用最大流 && 建图】

The Exchange of ItemsTime Limit: 2 Seconds Memory Limit: 65536 KB Bob lives in an ancient village, where transactions are done by one item exchange with another. Bob is very clever an

2015-08-29 00:23:18 1578

原创 HPU 2686--Matrix【最大费用最大流 && 经典建图】

MatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2062 Accepted Submission(s): 1074Problem DescriptionYifenfei very like play

2015-08-29 00:07:12 1218

原创 POJ--Kaka's Matrix Travels【最大费用最大流 && 经典建图 && 好题】

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8741 Accepted: 3504DescriptionOn an N × N chessboard with a non-negative number i

2015-08-28 13:04:22 898

原创 HDU 3376--Matrix Again【最大费用最大流 && 经典建图】

Matrix AgainTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 3457 Accepted Submission(s): 1020Problem DescriptionStarvae very li

2015-08-28 11:37:07 1982

原创 HDU 1853--Cyclic Tour【最小费用最大流 && 有向环最小权值覆盖】

Cyclic TourTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 1950 Accepted Submission(s): 984Problem DescriptionThere are N cities

2015-08-28 00:26:34 1286

原创 HDU 3488--Tour【最小费用最大流 && 有向环最小权值覆盖 && 经典】

TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2308 Accepted Submission(s): 1156Problem DescriptionIn the kingdom of Henryy,

2015-08-28 00:17:26 2832 1

原创 HDU 1533--Going Home【最小费用最大流 && 模板】

Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3452 Accepted Submission(s): 1771Problem DescriptionOn a grid map ther

2015-08-28 00:06:35 1599 1

原创 POJ 3228 -- Gold Transportation【二分 && 最大流】

Gold TransportationTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3079 Accepted: 1101DescriptionRecently, a number of gold mines have been discovered

2015-08-27 18:08:59 898

原创 POJ 2455--Secret Milking Machine【二分枚举 && 最大流 && 经典】

Secret Milking MachineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10625 Accepted: 3111DescriptionFarmer John is constructing a new milking machine

2015-08-27 16:42:43 942

原创 POJ 1698--Alice's Chance【最大流 && 经典】

Alice's ChanceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6384 Accepted: 2607DescriptionAlice, a charming girl, have been dreaming of being a movi

2015-08-27 15:11:47 787

原创 POJ 3189--Steady Cow Assignment【二分图多重匹配 && 最大流求解 && 枚举 && 经典】

Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6023 Accepted: 2078DescriptionFarmer John's N (1 FJ would like to rearrange t

2015-08-27 13:10:10 952

原创 POJ 2289--Jamie's Contact Groups【二分图多重匹配问题 &&二分查找最大值的最小化 && 最大流求解】

Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 6902 Accepted: 2261DescriptionJamie is a very popular girl and has quite a lot o

2015-08-27 10:20:03 1601

原创 POJ 1274--The Perfect Stall【二分图 && 最大匹配数 && 水题】

The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20795 Accepted: 9386DescriptionFarmer John completed his new barn just last week, com

2015-08-26 21:00:01 605

原创 POJ 2239--Selecting Courses【二分图 && 最大匹配数 && 水题】

Selecting CoursesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9363 Accepted: 4164DescriptionIt is well known that it is not easy to select courses

2015-08-26 18:59:18 772

原创 HDU 3081--【二分图 && 传递闭包 && 完美匹配次数 && 经典】

Marriage Match IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2794 Accepted Submission(s): 938Problem DescriptionPresumably, y

2015-08-26 11:51:51 1014

原创 POJ 2594--Treasure Exploration【二分图 && 最小路径覆盖 && 点可以重复走 && 传递闭包】

Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7343 Accepted: 3002DescriptionHave you ever read any book about treasure explorati

2015-08-26 10:32:45 777

原创 POJ 3041--Asteroids【二分图 && 最小点数覆盖】

AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17861 Accepted: 9729DescriptionBessie wants to navigate her spaceship through a dangerous ast

2015-08-25 21:27:33 512

原创 POJ 1422 && ZOJ 1525 --Air Raid【二分图 && 最小路径覆盖】

Air RaidTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7451 Accepted: 4434DescriptionConsider a town where all the streets are one-way and each stree

2015-08-25 21:03:33 697

原创 POJ 1466 && ZOJ 1137--Girls and Boys【二分图 && 最大点独立集】

Girls and BoysTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 11134 Accepted: 4981DescriptionIn the second year of the university somebody started a s

2015-08-25 20:36:48 789

原创 ZOJ 1516--Uncle Tom's Inherited Land【二分图 && 求最大匹配数 && 经典建图】

Uncle Tom's Inherited LandTime Limit: 2 Seconds Memory Limit: 65536 KB Your old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in th

2015-08-24 12:34:02 1687

原创 POJ 1469 && ZOJ 1140 --COURSES【二分图 && 最大匹配】

COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19581 Accepted: 7709DescriptionConsider a group of N students and P courses. Each student visit

2015-08-24 10:53:54 463

原创 POJ 1325 && ZOJ 1364--Machine Schedule【二分图 && 最小点覆盖数】

由题意可知，本意要求的是二分图的最小点覆盖集问题，即最小的顶点集合，“覆盖”所有的边，可以转化成二分图的最大匹配问题。二分图的最小点覆盖数 == 最大匹配数。

2015-08-24 10:02:28 1015

原创 ZOJ 1654--Place the Robots【二分匹配 && 经典建图】

Place the RobotsTime Limit: 5 Seconds Memory Limit: 32768 KB Robert is a famous engineer. One day he was given a task by his boss. The background of the task was the following:Giv

2015-08-24 09:15:50 1414

原创 HPU 3639--Hawk-and-Chicken【SCC缩点反向建图 && 求传递的最大值】

Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2409 Accepted Submission(s): 712Problem DescriptionKids in kinder

2015-08-22 01:14:57 2771 4

原创 HDU 3072--Intelligence System【SCC缩点新构图 && 求连通所有SCC的最小费用】

Intelligence SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1859 Accepted Submission(s): 799Problem DescriptionAfter a day

2015-08-21 18:09:59 958

原创小谈并查集及其算法实现

并查集一、算法介绍：并查集（Union-find Sets）是一种非常精巧而实用的数据结构，它主要用于处理一些不相交集合的合并问题。并查集的基本操作有两个：1：合并union(x, y)：把元素 x 和元素 y 所在的集合合并，要求 x 和 y 所在的集合不相交，如果两个集合相交则不合并。2：查询find(x)：找到元素 x 所在的集合的代表，该操作常用于判

2015-08-21 14:49:36 4364

原创 POJ 3592--Instantaneous Transference【SCC缩点新建图 && SPFA求最长路 && 经典】

Instantaneous TransferenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6177 Accepted: 1383DescriptionIt was long ago when we played the game Red Al

2015-08-21 14:10:53 1565

原创 HDU 3861--The King’s Problem【scc缩点构图 && 二分匹配求最小路径覆盖】

The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2137 Accepted Submission(s): 763Problem DescriptionIn the Kingd

2015-08-21 09:29:11 1084

原创 Light oj 1149--Factors and Multiples【二分匹配 && 经典建图】

1149 - Factors and MultiplesPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou will be given two sets of integers. Let's call the

2015-08-20 23:35:23 640

原创 Light oj 1138 - Trailing Zeroes (III) 【二分查找 && N！中末尾连续0的个数】

1138 - Trailing Zeroes (III)PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou task is to find minimal natural number N, so that

2015-08-20 21:16:04 850

原创 Light oj 1019 - Brush (V)【最短路裸题】

1019 - Brush (V)PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBTanvir returned home from the contest and got angry after seeing h

2015-08-20 19:06:54 719

原创 POJ 3126 --Father Christmas flymouse【scc缩点构图 && SPFA求最长路】

Father Christmas flymouseTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3007 Accepted: 1021DescriptionAfter retirement as contestant from WHU ACM

2015-08-20 18:02:34 867 1

原创 POJ 1236--Network of Schools【scc缩点构图 && 求scc入度为0的个数 && 求最少加几条边使图变成强联通】

Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13325 Accepted: 5328DescriptionA number of schools are connected to a computer netwo

2015-08-20 11:10:04 1149

原创 POJ 2553--The Bottom of a Graph【scc缩点构图 && 求出度为0的scc && 输出scc中的点】

The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9575 Accepted: 3984DescriptionWe will use the following (standard) definitions fr

2015-08-20 09:20:38 682

原创 HDU 3836--Equivalent Sets【求有向图最少增加多少边使图强连通 && Scc缩点新建图】

Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 3502 Accepted Submission(s): 1211Problem DescriptionTo prove tw

2015-08-19 21:27:02 586

原创 HDU 2767--Proving Equivalences【scc缩点构图 && 求向图中最少增加多少条边才可以使新图强连通】

Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4129 Accepted Submission(s): 1466Problem DescriptionConsider

2015-08-19 17:35:50 1173

原创 POJ 2186 -- Popular Cows【强连通分支 && Tarjan缩点】

Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27198 Accepted: 10963DescriptionEvery cow's dream is to become the most popular cow in the

2015-08-19 16:41:18 690

原创 POJ 2762--Going from u to v or from v to u?【scc缩点新建图 && 判断是否是弱连通图】

Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15755 Accepted: 4172DescriptionIn order to make their sons brave, Jia

2015-08-19 12:35:03 754

原创 HDU 1827--Summer Holiday【强连通缩点新建图】

Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2199 Accepted Submission(s): 1023Problem DescriptionTo see a World

2015-08-19 11:14:21 562

空空如也

空空如也