xdlove

PIGS Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 18057   Accepted: 8210 Description Mirko works on a pig farm that consists of M locked pig-houses and Mirk

HDU-2732 (Leapin' Lizards) 网络流

Random Maze Problem Description In the game “A Chinese Ghost Story”, there are many random mazes which have some characteristic： 1.There is only one entrance and one exit. 2.All the road in the maze

跟着风神学图论Task Schedule(Hdu3572网络流)

MZL's City Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 496    Accepted Submission(s): 164 Problem Description MZL is an active gi

MZL's endless loop Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 751    Accepted Submission(s): 138 Special Judge Problem Descripti

好题这道题不难，只要注意到在求最小费用的时候不要让流影响到费用就行，最直接的方法就是让图直接满流，然后求最小费用/* *********************************************** Author :xdlove Created Time :2015年08月18日 星期二 13时18分54秒 File Name :xd.cpp ********

在风神的博客里这道题是费用流的入门题，给风神跪了。。。个人觉得这道题目挺好的，作为入门题还是有点难的吧？ 这道题的做法很多，我是直接裸的跑费用流，跑了八百多毫秒。。。么么哒题意： 我都看得懂，这就不用说了。。。。 题解： 建立源点，汇点，源点往小矮人连一条流量为1,费用为0的边，每个房间往汇点连一条流量为1,费用为0的边。然后每个点往其右和下一个点建一条流量为INF,费用为1的无向边，表示每一个点

Harry Potter and the Forbidden Forest Time Limit:3000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u Description Harry Potter notices some Death Eaters try to slip into Cast

无源汇有上下界最大流模板题了 SGU194 194. Reactor Cooling time limit per test: 0.5 sec. memory limit per test: 65536 KB input: standard o