2015年02月_GAUSS_CLB

原创 poj3436

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

2015-02-28 23:20:55 1023

原创 poj1087 floyd+二分图最大匹配

A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14191 Accepted: 4773DescriptionYou are in charge of setting up the press room for the i

2015-02-28 19:59:40 532

原创 poj1469 二分图的完备匹配

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

2015-02-27 21:35:58 1372

原创 poj1325 二分图的最小点覆盖

Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12291 Accepted: 5250DescriptionAs we all know, machine scheduling is a very classical

2015-02-27 20:22:15 650

原创匈牙利算法 zoj1654

资料：趣味理解 byvoid大牛明天补上自己理解和例题。。。

2015-02-26 01:36:41 621

原创 poj1459

Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 23935 Accepted: 12490DescriptionA power network consists of nodes (power stations, consum

2015-02-16 14:02:20 647

原创 poj2112 二分+floyd+dinic

Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 12936 Accepted: 4679Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K

2015-02-15 21:39:03 437

原创 sgu438 动态流

438. The Glorious Karlutka River =)Time limit per test: 0.5 second(s)Memory limit: 262144 kilobytesinput: standardoutput: standardA group of M tourists are walking along the Ka

2015-02-15 15:35:24 1144 1

原创 sgu326 贪心+dinic

326. PerspectiveTime limit per test: 0.25 second(s)Memory limit: 65536 kilobytesinput: standardoutput: standardBreaking news! A Russian billionaire has bought a yet undisclosed N

2015-02-14 17:24:35 544

原创 woj1124 贪心+dinic

Problem 1124 - Football CoachTime Limit: 2000MS Memory Limit: 65536KB Total Submit: 299 Accepted: 137 Special Judge: NoDescriptionIt is not an easy job to be a coach of a footbal

2015-02-13 17:25:16 950

原创 zoj2760 dijkstra+dinic

How Many Shortest PathTime Limit: 10 Seconds Memory Limit: 32768 KBGiven a weighted directed graph, we define the shortest path as the path who has the smallest length among all the pat

2015-02-13 01:38:13 601

原创 poj3281

DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10034 Accepted: 4615DescriptionCows are such finicky eaters. Each cow has a preference for certa

2015-02-12 20:08:52 495

原创 poj2699 暴力+dinic

The Maximum Number of Strong KingsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1689 Accepted: 789DescriptionA tournament can be represented by a co

2015-02-12 01:17:58 519

原创 poj2391 二分+floyd+dinic

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

2015-02-11 21:10:38 481

原创 poj1637

Sightseeing tourTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7945 Accepted: 3327DescriptionThe city executive board in Lund wants to construct a si

2015-02-11 18:45:15 685

原创 poj1149

PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17297 Accepted: 7841DescriptionMirko works on a pig farm that consists of M locked pig-houses and

2015-02-11 14:59:14 725

原创家园

题目描述 Description由于人类对自然的疯狂破坏，人们意识到在大约2300年之后，地球不能再居住了，于是在月球上建立了新的绿地，以便在需要时移民。令人意想不到的是，2177年冬由于未知的原因，地球环境发生了连锁崩溃，人类必须在最短的时间内迁往月球。现有n个太空站处于地球与月球之间（编号1..n），m艘公共交通太空船在其中来回穿梭，每个太空站Si可容纳无限的人，每艘太空船pi只可

2015-02-10 22:03:13 1490

原创 bzoj1066

1066: [SCOI2007]蜥蜴Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 1963 Solved: 950[Submit][Status]Description在一个r行c列的网格地图中有一些高度不同的石柱，一些石柱上站着一些蜥蜴，你的任务是让尽量多的蜥蜴逃到边界外。每行每列中相邻石柱的距离为1，蜥蜴的跳跃距离是d

2015-02-10 01:20:12 560

原创 poj1273 网络流 Dinic

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 58914 Accepted: 22615DescriptionEvery time it rains on Farmer John's fields, a pond fo

2015-02-09 22:24:58 514

原创 poj1273 网络流 Edmonds_Karp

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 58912 Accepted: 22614DescriptionEvery time it rains on Farmer John's fields, a pond fo

2015-02-09 17:54:23 551

原创 poj3177 边双连通分量+缩点（并查集实现）

Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9675 Accepted: 4137DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazi

2015-02-06 00:03:38 739

原创 poj2942 点双连通图分量+二分图判定

Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 10291 Accepted: 3376DescriptionBeing a knight is a very attractive career: s

2015-02-05 22:26:41 767

原创 zoj2588 割边（含多重边）

Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KBFerry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful and

2015-02-05 14:10:09 641

原创重连通分量

所谓重连通图（点双连通图）是指不存在割点的图。重连通分量即为原图的极大重连通图，相当于把原图划分成若干个重连通图（可相交），交点是割点。求解过程是模仿割点的求解算法，但又有些不同，即low数组有区别，因为每条边只会被访问一次，也就是说b是a的孩子节点，那么访问b时不会再访问边ba，这样也就是low[b]缺少了dfn[a]的更新，但这并不影响该点是否是割点，因为不是割点取决于low[b]

2015-02-04 21:31:25 1959

原创 poj1523 割点+连通分量

SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6477 Accepted: 2965DescriptionConsider the two networks shown below. Assuming that data moves aroun

2015-02-04 15:35:28 458

GAUSS_CLB