JUST CODE

解题报告 之 HDU5294 Tricks DeviceDescriptionInnocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of it. The tomb is made up of many chambers, the total number is N. And there are M channe

解题报告 之 UVA820 Internet Bandwidth 最大流 原始模型

解题报告 之 HOJ 2816 Power Line 最大流 二分

解题报告 之 SOJ2414 Leapin' LizardsYour platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking around for hidden treasures, one of the rookies steps on an innocent-looking stone and the room's floor sudd

解题报告 之 SOJ 3312 Stockholm Knights 最大流 网格 动态流 二分 The city of Stockholm is a chessboard whose size is N*M. There are some Stockholm Knights in the city.Stockholm Knights are very special Knights.They only can move from a corner of a 3*4 grid to the oppo

解题报告 之 POJ 3498 March of the Penguins 最大流

解题报告 ZOJ 2760 How Many Shortest Path 最大流 边不相交最短路的条数 Dinic

解题报告 之 POJ 2289 Jamie's Contact Groups

解题报告 之 SOJ 2835 Pick Up Points CFW牛吃草喝水模型 最大流Description Recently loy are very interested in playing a funny game. There is a board of n*m grid. Each grid has one point or not. If two adjacency grids both have one point, someone can pick them up, and

解题报告 之 UVA563 Crimewave 最大流 拆点

解题报告 之 POJ2455 Secret Milking MachineDescriptionFarmer John is constructing a new milking machine and wishes to keep it secret as long as possible. He has hidden in it deep within hi

解题报告 之 POJ1149 PIGS 最大流 网络流 建图

最大流 最小费用流 POJ3686 The Windy'sThe Windy's is a world famous toy factory that owns M top-class workshop to make toys. This year the manager receives N orders for toys. The manager knows that every order will take different amount of hours in different work

POJ2175 Evacuation Plan 最小费用流 负权消去 The City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in case of a nuclear war. Each fallout shelter has a limited capacity in terms of a numbe

解题报告 之 POJ3057 Evacuation 最大流 动态流 更新残余网络 多次增广Fires can be disastrous, especially when a fire breaks out in a room that is completely filled with people. Rooms usually have a couple of exits and emergency exits, but with everyone rushing out at the same t

解题报告 之 POJ3469 Dual Core CPU 点集拆分 最小割 最大流As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW.The routine consists of N modules, and

解题报告 之 POJ 1201 Intervals       DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn. Write a program that: reads the number of intervals, t

解题报告 之 POJ1637 Sightseeing tour 最大流The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. They want to construct the tour so that every street in the city is vis

解题报告 之 POJ 3680 Intervals 最小费用流 标号法 ACM 负权边You are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi. Your task is to pick some of the intervals to maximize the total weights under the limit that no point in the real axis is

解题报告 之 POJ 3463 ACM Computer Factory 有陷阱 拆点

解题报告 之 SOJ3353 Total Flow 最大流

解题报告 之 ZOJ 2332 Gems 构图 最大流Wealthy alsomagic! Supernatural alsomagic! But also poor alsomagic! Because he is now puzzled by a problem, and will go crazy if you can't help him.alsomagic has a lot of gems with different colors and shapes. His supernatu

解题报告 之 HDU1698 Alice's ChanceDescriptionAlice, a charming girl, have been dreaming of being a movie star for long. Her chances will come now, for several filmmaking companies invite he

解题报告 之 POJ1459 Power NetworkDescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with

解题报告 之 POJ2112 Optimal MilkingDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various leng

解题报告 之 POJ1087 A Plug for UNIX 最大流+拆点原理详解

解题报告 之 SGU 326 Perspective 最大流 满流DescriptionBreaking news! A Russian billionaire has bought a yet undisclosed NBA team. He's planning to invest huge effort and money into making that team

解题报告 之 POJ 2699 The Maximum Number of Strong Kings 最大流 二分 枚举 建图

解题报告 之 SGU 185 Two shortest 最大流 边不重复最短路Yesterday Vasya and Petya quarreled badly, and now they don't want to see each other on their way to school. The problem is that they live in one and the same house, leave the house at the same time and go at the sa

POJ2135 Farm Tour 最大流 最小费用流When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <

解题报告 之 SOJ 4429 Frog's DiceThe Problemfrog has many dices:)Each dice has six surfaces and there is a lowercase letter on each surfaces.Now, frog want to put these dices in a row so tha

解题报告 之 HDU4292 FoodProblem Description　　You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible.　　The is

解题报告 之 POJ1273 Drainage DitchesDescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for

解题报告 之 SGU 242 Student's Morning 最大流 二分匹配 残余网络 输出一组解

解题报告 之 POJ 4289 ControlProblem Description　　You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD

解题报告 之 POJ3189 Steady Cow AssignmentDescriptionFarmer John's N (1 FJ would like to rearrange the cows such that the cows are as equally happy as possible, even if that means all

解题报告 之 POJ 2391 Ombrophobic Bovines 最大流 拆点

解题报告 之 WHU1124 Football Coach 最大流 满流

解题报告 之 POJ 3281 Dining 最大流 经典构图 牛吃草问题 食物 饮料 最大分配

解题报告 之 SG438 The Glorious Karlutka River 最大流 按时间拆点 动态流