09 2016 档案

POJ 3422Kaka's Matrix Travels（最小费用最大流）
摘要：Kaka's Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9460 Accepted: 3844 Description On an N × N chessboard with a non-neg 阅读全文
posted @ 2016-09-29 22:47 贱人方 阅读(295) 评论(0) 推荐(0)
bzoj 1061 志愿者招募(最小费用最大流)
摘要：[Noi2008]志愿者招募 Time Limit: 20 Sec Memory Limit: 162 MBSubmit: 3792 Solved: 2314[Submit][Status][Discuss] Description 申奥成功后，布布经过不懈努力，终于成为奥组委下属公司人力资源部门的 阅读全文
posted @ 2016-09-23 20:13 贱人方 阅读(195) 评论(0) 推荐(0)
POJ 3114 Countries in War（强连通）（缩点）（最短路）
摘要：Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3672 Accepted: 1057 Description In the year 2050, after different attempts 阅读全文
posted @ 2016-09-22 17:10 贱人方 阅读(713) 评论(0) 推荐(1)
POJ2375 Cow Ski Area （强连通）（缩点）
摘要：Cow Ski Area Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3323 Accepted: 919 Description Farmer John's cousin, Farmer Ron, who lives in 阅读全文
posted @ 2016-09-21 18:25 贱人方 阅读(330) 评论(0) 推荐(0)
POJ1236 Network of Schools （强连通）（缩点）
摘要：Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16343 Accepted: 6484 Description A number of schools are connected to a 阅读全文
posted @ 2016-09-20 19:41 贱人方 阅读(123) 评论(0) 推荐(0)
hiho一下116周 网络流
摘要：网络流二·最大流最小割定理 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 小Hi：在上一周的Hiho一下中我们初步讲解了网络流的概念以及常规解法，小Ho你还记得内容么？ 小Ho：我记得！网络流就是给定了一张图G=(V,E)，以及源点s和汇点t。每一条边e(u,v)具有 阅读全文
posted @ 2016-09-20 11:33 贱人方 阅读(171) 评论(0) 推荐(0)
HDU5889 Barricade（最短路）（网络流）
摘要：Barricade Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 604 Accepted Submission(s): 172 Problem 阅读全文
posted @ 2016-09-18 18:14 贱人方 阅读(981) 评论(1) 推荐(0)
POJ 2186 Popular Cows（强连通）
摘要：Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 30999 Accepted: 12580 Description Every cow's dream is to become the most popu 阅读全文
posted @ 2016-09-17 10:42 贱人方 阅读(222) 评论(0) 推荐(0)
timus 1109 Conference(二分图匹配)
摘要：Conference Time limit: 0.5 secondMemory limit: 64 MB On the upcoming conference were sent M representatives of country A and N representatives of coun 阅读全文
posted @ 2016-09-16 10:23 贱人方 阅读(290) 评论(0) 推荐(0)
URAL 1205 By the Underground or by Foot?（SPFA）
摘要：By the Underground or by Foot? Time limit: 1.0 secondMemory limit: 64 MB Imagine yourself in a big city. You want to get from point A to point B. To d 阅读全文
posted @ 2016-09-15 21:14 贱人方 阅读(352) 评论(0) 推荐(0)
URAL 1242 Werewolf（DFS）
摘要：Werewolf Time limit: 1.0 secondMemory limit: 64 MB Knife. Moonlit night. Rotten stump with a short black-handled knife in it. Those who know will unde 阅读全文
posted @ 2016-09-15 18:39 贱人方 阅读(343) 评论(0) 推荐(0)
timus 1033 Labyrinth(BFS)
摘要：Labyrinth Time limit: 1.0 secondMemory limit: 64 MB Administration of the labyrinth has decided to start a new season with new wallpapers. For this pu 阅读全文
posted @ 2016-09-15 09:40 贱人方 阅读(280) 评论(0) 推荐(0)
URAL 1208 Legendary Teams Contest（DFS）
摘要：Legendary Teams Contest Time limit: 1.0 secondMemory limit: 64 MB Nothing makes as old as years. A lot of cool contests are gone, a lot of programmers 阅读全文
posted @ 2016-09-14 18:21 贱人方 阅读(284) 评论(0) 推荐(0)
URAL 1930 Ivan's Car（BFS）
摘要：Ivan's Car Time limit: 1.5 secondMemory limit: 64 MB The world is in danger! Awful earthquakes are detected all over the world. Houses are destroyed, 阅读全文
posted @ 2016-09-13 00:08 贱人方 阅读(375) 评论(0) 推荐(0)
hiho一下115周 网络流
摘要：小Hi和小Ho住在P市，P市是一个很大很大的城市，所以也面临着一个大城市都会遇到的问题：交通拥挤。 小Ho：每到周末回家感觉堵车都是一种煎熬啊。 小Hi：平时交通也还好，只是一到上下班的高峰期就会比较拥挤。 小Ho：要是能够限制一下车的数量就好了，不知道有没有办法可以知道交通系统的最大承受车流量，这 阅读全文
posted @ 2016-09-11 11:31 贱人方 阅读(156) 评论(0) 推荐(0)
URAL(timus) 1272 Non-Yekaterinburg Subway(最小生成树)
摘要：Non-Yekaterinburg Subway Time limit: 1.0 secondMemory limit: 64 MB A little town started to construct a subway. The peculiarity of the town is that it 阅读全文
posted @ 2016-09-09 20:40 贱人方 阅读(240) 评论(0) 推荐(0)
URAL(timus) 1280 Topological Sorting(模拟)
摘要：Topological Sorting Time limit: 1.0 secondMemory limit: 64 MB Michael wants to win the world championship in programming and decided to study N subjec 阅读全文
posted @ 2016-09-09 13:05 贱人方 阅读(284) 评论(0) 推荐(0)
URAL（timus）1709 Penguin-Avia（并查集）
摘要：Penguin-Avia Time limit: 1.0 secondMemory limit: 64 MB The Penguin-Avia airline, along with other Antarctic airlines, experiences financial difficulti 阅读全文
posted @ 2016-09-09 09:35 贱人方 阅读(343) 评论(0) 推荐(0)
timus 1210 Kind Spirits(最短路)（动态规划）
摘要：Kind Spirits Time limit: 1.0 secondMemory limit: 64 MB Ivanushka the Fool lives at the planet of 0-level. It's very unpleasant to live there. An awful 阅读全文
posted @ 2016-09-08 22:34 贱人方 阅读(460) 评论(0) 推荐(0)
timus 1022 Genealogical Tree(拓扑排序)
摘要：Genealogical Tree Time limit: 1.0 secondMemory limit: 64 MB Background The system of Martians’ blood relations is confusing enough. Actually, Martians 阅读全文
posted @ 2016-09-08 15:22 贱人方 阅读(260) 评论(0) 推荐(0)
timus 1982 Electrification Plan(最小生成树)
摘要：Electrification Plan Time limit: 0.5 secondMemory limit: 64 MB Some country has n cities. The government has decided to electrify all these cities. At 阅读全文
posted @ 2016-09-07 20:32 贱人方 阅读(246) 评论(0) 推荐(0)
timus 1136 Parliament(二叉树)
摘要：Parliament Time limit: 1.0 secondMemory limit: 64 MB A new parliament is elected in the state of MMMM. Each member of the parliament gets his unique p 阅读全文
posted @ 2016-09-07 19:39 贱人方 阅读(279) 评论(0) 推荐(0)
timus 1136 Parliament(e)
摘要：Parliament Time limit: 1.0 secondMemory limit: 64 MB A new parliament is elected in the state of MMMM. Each member of the parliament gets his unique p 阅读全文
posted @ 2016-09-07 19:38 贱人方 阅读(165) 评论(0) 推荐(0)
timus 1106 Two Teams(二部图)
摘要：Two Teams Time limit: 1.0 secondMemory limit: 64 MB The group of people consists of N members. Every member has one or more friends in the group. You 阅读全文
posted @ 2016-09-07 17:07 贱人方 阅读(313) 评论(0) 推荐(0)
POJ3308 Paratroopers(网络流）（最小割）
摘要：Paratroopers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8443 Accepted: 2541 Description It is year 2500 A.D. and there is a terrible w 阅读全文
posted @ 2016-09-03 17:03 贱人方 阅读(245) 评论(0) 推荐(0)
POJ1637 Sightseeing tour (混合图欧拉回路）（网络流）
摘要：Sightseeing tour Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9100 Accepted: 3830 Description The city executive board in Lund wants to 阅读全文
posted @ 2016-09-03 09:29 贱人方 阅读(193) 评论(0) 推荐(0)
POJ2391 Ombrophobic Bovines（网络流）（拆点）
摘要：Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18205 Accepted: 3960 Description FJ's cows really hate getting wet so m 阅读全文
posted @ 2016-09-02 20:32 贱人方 阅读(250) 评论(0) 推荐(0)
POJ1087 A Plug for UNIX（网络流）
摘要：A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16083 Accepted: 5513 Description You are in charge of setting up the press 阅读全文
posted @ 2016-09-02 10:49 贱人方 阅读(518) 评论(0) 推荐(0)
POJ1459 Power Network（网络最大流）
摘要：Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 27229 Accepted: 14151 Description A power network consists of nodes (power st 阅读全文
posted @ 2016-09-01 18:51 贱人方 阅读(300) 评论(0) 推荐(0)
I’m stuck!（BFS）
摘要：I’m stuck! 给定一个R行C列的地图，地图的每一个方格可能是'#', '+', '-', '|', '.', 'S', 'T'七个字符中的一个，分别表示如下意思： '#': 任何时候玩家都不能移动到此方格； '+': 当玩家到达这一方格后，下一步可以向上下左右四个方向相邻的任意一个非'#'方 阅读全文
posted @ 2016-09-01 13:01 贱人方 阅读(398) 评论(0) 推荐(0)
POJ2112 Optimal Milking （网络流）（Dinic）
摘要：Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 16461 Accepted: 5911 Case Time Limit: 1000MS Description FJ has moved his K 阅读全文
posted @ 2016-09-01 10:49 贱人方 阅读(181) 评论(0) 推荐(0)