JSure的代码库

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000K   DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch

Evacuation PlanTime Limit: 1000MS Memory Limit: 65536K    Special JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelter

Reactor CoolingTime Limit: 5 Seconds      Memory Limit: 32768 KB      Special JudgeThe terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reactor t

BudgetTime Limit: 3000MS Memory Limit: 62M    Special JudgeDescriptionWe are supposed to make a budget proposal for this multi-site competition. The budget pr

176. Flow constructiontime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardYou have given the net consisting of nodes and pipes; pipes conn

FriendshipTime Limit: 2000MS Memory Limit: 20000K   DescriptionIn modern society, each person has his own friends. Since all the people are very busy, they commun

Shoot the BulletTime Limit: 2 Seconds      Memory Limit: 32768 KB      Special JudgeGensokyo is a world which exists quietly beside ours, separated by a mystical border. It is a utopia where h

转自相对于一般的网络流，有上下界的网络流的某些边多出了流量下界的限制，如边u->v，上下界为high、low，如果有流经过这条边，这个流必须在[low，high]这个区间内。这类题目主要要求解决下面三个问题，“有源汇、无源汇的可行流”、“有源汇的最大流”、“有源汇的最小流”，注意这里所说的源汇是原网络中的源汇，分别记为s、t。　　这类题目的难点在于下界的限制很难处理，我们将所有有下

Destroying The GraphTime Limit: 2000MS Memory Limit: 65536K    Special JudgeDescriptionAlice and Bob play the following game. First, Alice draws some directed

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536K   DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix t

JumpTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 930    Accepted Submission(s): 377Problem DescriptionThere are n*m grids,

转自：夏天的风【HDU】1532Drainage Ditches(入门)    [最大流]3549 Flow Problem(入门)    [最大流]3572 Task Schedule(基础)    [最大流]任务分配,判断满流2732 Leapin' Lizards(较难)    [最大流]3338 Kakuro Extension(较难，好题)    [最大流][

void init() { memset(head, -1, sizeof(head)); tot = 0;}void add(int u, int v, int w){ edge[tot].v = v; edge[tot].w = w; edge[tot].next = head[u]; head[u] = tot++;}bool bfs() {

Unique AttackTime Limit: 5 Seconds      Memory Limit: 32768 KBN supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pai

Panic RoomTime Limit: 2 Seconds      Memory Limit: 65536 KBIntroductionYou are the lead programmer for the Securitron 9042, the latest and greatest in home security software from Jellern Inc

Going HomeTime Limit: 1000MS Memory Limit: 65536K   DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one

Optimal MilkingTime Limit: 2000MS Memory Limit: 30000K   Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the c

Power NetworkTime Limit: 2000MS Memory Limit: 32768K   DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power

PIGSTime Limit: 1000MS Memory Limit: 10000K   DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse becaus

A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536K   DescriptionYou are in charge of setting up the press room for the inaugural meeting of the United Nations

Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536K   DescriptionFJ's cows really hate getting wet so much that the mere thought of getting caught in the r

ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KSpecial Judge    DescriptionAs you know, all the computers used for ACM contests must be identical,

1153 - Internet BandwidthPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBOn the Internet, machines (nodes) are richly interconnect

Sightseeing tourTime Limit: 1000MS Memory Limit: 10000K   DescriptionThe city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so tha

ParatroopersTime Limit: 1000MS Memory Limit: 65536K   DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Re

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072K   Case Time Limit: 5000MSDescriptionAs more and more computers are equipped with dual core CPU, Setag

P1825志愿者招募Accepted标签：NOI2008描述申奥成功后，布布经过不懈努力，终于成为奥组委下属公司人力资源部门的主管。布布刚上任就遇到了一个难题：为即将启动的奥运新项目招募一批短期志愿者。经过估算，这个项目需要N 天才能完成，其中第i 天至少需要Ai 个人。布布通过了解得知，一共有M 类志愿者可以

const int N = 1000, M = 1e5;struct Node { int u, v, w, c; int next;}edge[M];int pre[N], path[N], dis[N];bool inq[N];bool spfa(int S, int T, int n){ int u; for(int i = 0; i < n ; i++) { in

Minimum CostTime Limit: 4000MS Memory Limit: 65536K   DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale are

由一个总部、若干个城市、中继站以及一些网段构成一个容量网络。每个网段是单向的且存在一定带宽。城市会无限制的上传数据，求出该图中的这样一些网段：增加这些网段的带宽可以提高总部收到的总带宽。