Network flow problem Set

HDU
1532 Drainage ditches
3549 Flow problem
3572 Task Schedule
2732 Leapin ' lizards

3338Kakuro Extension (more difficult, good question)

2883 Kebab
3605 Escape
4183 Pahom on water
4240 Route Redundancy
3081 Marriage Match II
3277 Marriage Match III
3416 Marriage Match IV
3468 Treasure Hunting (medium) [max Flow] (binary match) + shortest
3998 Sequence (more difficult) [dp+ maximum flow] longest ascending subsequence
4309 Seikimatsu Occult Tonneru (medium) [Max Stream] enumeration state + Max Stream

3472HS BDC (difficult) [mixed Euler]

4280
----------------------------------------------------------------------------------------------
1533 going Home (entry) [Fee flow]
3488 Tour (base) [Expense flow] Circle
3435 A New Graph Game (base) [Expense flow] Circle
1853 Cyclic Tour (base) [Expense flow] Circle
2686 Matrix (base) [Expense flow]
3376 Matrix Again (base) [Cost flow]
3667 Transportation (medium) [cost flow] split edge
3315 My Brute (medium, good topic) [Cost flow] (usable km)
3395 Special Fish (medium, good title) [Cost Flow] (available km matching)
2448 Mining Station on the Sea (medium) [cost flow] (shortest path +km match available)
4067 Random Maze (difficult) [cost flow]

3947River problem (difficult) [cost flow] magical cost flow, traffic inequality mapping

4406 GPA [good title] [the official problem is the so-called upper and lower boundary cost flow]

4411 arrest [good title] [the official problem is the so-called upper and lower boundary cost flow]

---------------------------------------------------------------------------------------------
3046 pleasant sheep and Big big wolf
1565 squares Fetch number (1)

1569 Squares Fetch number (2)
3820 Golden Eggs (more difficult, good question) [min Cut] grid enhancement
3491 Thieves (medium) [min Cut] min. cut set
3657 Game (medium) [min Cut] Maximum point weight independent set
3313 Key Vertex (medium) [min Cut]
3251 Being a Hero (medium) [min Cut]
3452 Bonsai (Basic) [min Cut] a tree with a right edge, minimal cut root and leaf node not connected
3987 Harry Potter and the Forbidden Forest (more difficult, good question) [minimum cut] minimum cut of the case, the minimum need to cut off the number of edges.
2435 There is a war (harder, good title) [min Cut] build Invincible bridge
3917 Road Constructions (medium) [Maximum weight closure] maximum profit
3879 Base Station (medium) [Maximum weight closure] maximum profit
3061 Battle (medium) [Maximum weight closure] maximum profit
3996 Gold Mine (medium) [Maximum weight closure] maximum profit

4307Matrix (difficult, good question) [Minimum cut] [project allocation problem]

4265 science! (More difficult)

4289 Control

4292 Food

4322 Candy (difficult) [Good topic] [Maximum flow] ========================================================================================= ===============

"POJ"

3436
1087A Plug for UNIX
1274 the Perfect Stall
1325 Machine Schedule
1698 Alice ' s chance
2239 Selecting Courses
2446 Chessboard
2536 Gopher II
2771 Guardian of Decency
3041 asteroids
2584 T-shirt Gumbo

3189 Steady Cow Assignment

1149 PIGS (difficult)     [maximum flow] Absolute classic composition problem 1273 drainage ditches
1459 Power Network
3281 Dining
2112 Op Timal Milking
2289 Jamie's contact Groups
2391 ombrophobic bovines
2455 Secret milking machine
3228 Gold T Ransportation
2699 The Maximum number of strong Kings (more difficult)     [enumerator + max Flow]
3498 March of the Penguin S (medium)     [Max Stream] Enumerate meeting points, network flows that meet the point capacity limit
1637 Sightseeing tour (difficult)     [mixed Euler]
------------ -------------------------------------------------------------------------------------------
2135 Farm Tour (basic     [expense flow] (shortest to and fro)
2175 evacuation Plan (harder)     [expense flow] cc
2195 going Home (Getting started)      [expense flow]
2516 Minimum Cost (medium)     [fee flow]
3422 Kaka's Matrix Travels (medium)      [expense flow] split
3680 intervals (difficult, good title)     [cost flow] classic, cost flow + discretization
3686 The windy ' s (difficult, good)      [fee flow] (km match)

3762The Bonus salary!   (More difficult) [Expense Flow]-------------------------------------------------------------------------------------------------------
1815 Friendship (medium) [min Cut] min. cut set
1966 Cable TV Network (medium) [min Cut] min. cut set
2125 destroying the Graph (difficult) [min Cut] minimum point weight coverage
3084 Panic Room (medium, Good topic) [min Cut] edge connectivity
3204 Ikki's Story i-road Reconstruction (medium) [min Cut] seek critical edge
3308 paratroopers (more difficult) [min Cut] product take logarithm, minimum point weight coverage
3436 ACM computer Factory [min Cut] collection flow, residue collection find edges
3469 Dual Core CPU (medium) [min Cut] Project assignment issues
3921 destroying the bus stations [min Cut] point connectivity [DELETE!!!]
2987 firing (more difficult, good title) [Maximum weight closure]
3155 Hard Life (very challenging) [Maximum density sub-chart]
=============================================================================================

"Other OJ"

Lightoj above already have classification, so oneself can find the problem of network flow above cut bar ...

Zoj3348schedule (Basic, good question) [maximum flow] It's been a few more than a few. Ask DD if he can win the championship.
zoj2760 how many shortest path (base) [Max Stream] disjoint shortest path
zoj3460 Missile (medium) [max Flow] split each point at different times to determine if it is a perfect match.
zoj3362 Beer problem (medium) [cost flow] maximum cost flow, per augmentation. Until the cost is returned, break;
zoj2532 Internship (medium) [min Cut] increase the flow of which side, can increase the maximum flow. (for critical cutting edges)
ZOJ2587 unique Attack (medium) [Minimum Cut] (the uniqueness of the minimum cut)
ZOJ2539 Energy minimization (more difficult, good question) [min Cut] project allocation problem
ZOJ2071 Technology Trader (difficult, good question) [maximum weight closure] Output selection scheme
ZOJ2332 Gems (medium) [Maximum flow]

SGU326 Perspective (composition problem, similar to WHU 1124)
SGU438 the glorious Karlutka river =) (Split by Time)
SGU242 Student ' s morning (output a set of solutions)
SGU185 Two shortest (Dijkstra preprocessing, two-time augmentation, must be implemented with adjacency array, otherwise MLE)

HOJ2816 Power Line
HOJ2634 How to earn more
HOJ2811 earthquake Damage (minimum point cut set)
HOJ2715 Matrix3
HOJ2739 the Chinese Postman problem
HOJ2543 Stone IV

WHU1124 Football Coach (composition problem)
JOJ2453 Candy (composition problem)
TJU2944 mussy Paper (maximum weight closed sub-graph)
BUAA1032 destroying a Painting
BASHU2445 (absolute Classic fee stream) napkin problem

SPOJ 839 Optimal Marks (convert XOR operation to minimum cut per bit)
spoj660:http://www.spoj.pl/problems/quest4/
spoj377:http://www.spoj.pl/problems/taxi/

[UVA]

753, 820, 10330, 10735

11248 [Maximum flow] first the maximum flow from the starting point to the end point, and then in the residual network, the maximum flow from the starting point to each point, and the maximum flow for each point to the end. Then enumerate each edge to increase the capacity to meet test instructions.

[TC]: Single Round Match @ Round 1–division I, Level Three
Single Round Match 236 Round 1–division I, Level Three
Single Round Match 399 Round 1–division I, Level Three
2003 TCO semifinal Round 4–division I, Level Three
2004 TCCC Championship Round–division I, Level Three
2005 TCO Sponsor track Round 3–division I, Level One

[Rqnoj] 306 destruction of the oil transport system
338 [NOI08] volunteer recruitment
529 [NOI09] Plants vs Zombies
556 [NOI06] Maximum profit

606 [NOI2010] elevation =============================================================================================
"Upper and lower bounds network Flow"
ZOJ 2314 Feasible Flow
Zoj 3229 Maximum Flow
Zoj 1994 Feasible Flow

Pku 2396 Feasible Flow

POJ 2594 Minimum flow Hdu3157 minimum flow
Sgu176 Minimum Flow
hust1342 Minimum Flow
=============================================================================================
"Non-graph minimum cut"
hdu3691
hdu3002
poj2914
poj1966
zoj2753

=============================================================================================