![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
建图
文章平均质量分 85
J_Sure
唯苦修深思方能顿悟
展开
-
POJ-3026 Borg Maze
Borg MazeTime Limit: 1000MS Memory Limit: 65536KDescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collec原创 2014-08-09 23:39:30 · 938 阅读 · 0 评论 -
【最大流】ZOJ-2788 Panic Room
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原创 2014-10-10 16:14:52 · 775 阅读 · 0 评论 -
【最小割+判定唯一性】ZOJ-2587 Unique Attack
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原创 2014-10-09 21:42:14 · 1404 阅读 · 0 评论 -
POJ-2585 Window Pains
Window PainsTime Limit: 1000MS Memory Limit: 65536KDescriptionBoudreaux likes to multitask, especially when it comes to using his computer. Never satisfied with just running原创 2014-08-07 13:43:01 · 937 阅读 · 0 评论 -
【有源汇有上下界可行流】POJ-2396(ZOJ-1994) Budget
BudgetTime Limit: 3000MS Memory Limit: 62M Special JudgeDescriptionWe are supposed to make a budget proposal for this multi-site competition. The budget pr原创 2014-10-12 16:22:25 · 780 阅读 · 0 评论 -
【有源汇有上下界最小流】SGU-176 Flow constructions
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原创 2014-10-14 17:12:30 · 795 阅读 · 0 评论 -
【有源汇有上下界最大流】ZOJ-3229 Shoot the Bullet
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原创 2014-10-16 22:34:05 · 891 阅读 · 0 评论 -
【最小割+枚举】POJ-1815 Friendship
FriendshipTime Limit: 2000MS Memory Limit: 20000K DescriptionIn modern society, each person has his own friends. Since all the people are very busy, they commun原创 2014-09-27 21:00:38 · 639 阅读 · 0 评论 -
【二分图|最小点权覆盖】POJ-2125 Destroying The Graph
Destroying The GraphTime Limit: 2000MS Memory Limit: 65536K Special JudgeDescriptionAlice and Bob play the following game. First, Alice draws some directed原创 2014-11-03 22:08:55 · 846 阅读 · 0 评论 -
【最大费用最大流】POJ-3422 Kaka's Matrix Travels
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原创 2014-10-18 20:31:01 · 1085 阅读 · 0 评论 -
ZOJ-1857(POJ-2607) Fire Station
Fire StationTime Limit: 2 Seconds Memory Limit: 65536 KBA city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest st原创 2014-08-16 16:35:15 · 1109 阅读 · 0 评论 -
【有上下界最大费用可行流】HDU-4862 Jump
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,原创 2014-10-20 16:17:45 · 1180 阅读 · 0 评论 -
【二分图|最大匹配】ZOJ-1516 Uncle Tom's Inherited Land
Uncle Tom's Inherited LandTime Limit: 2 Seconds Memory Limit: 65536 KBYour old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in t原创 2014-11-06 18:24:20 · 2088 阅读 · 0 评论 -
【二分图|最小路径覆盖】POJ-1422 Air Raid
Air RaidTime Limit: 1000MS Memory Limit: 10000K DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to anot原创 2014-11-08 18:27:25 · 967 阅读 · 0 评论 -
【连通图|双连通+二分图判定】POJ-2942 Knights of the Round Table
Knights of the Round Table原创 2014-12-26 02:13:28 · 992 阅读 · 0 评论 -
POJ-1659 Frogs' Neighborhood
Frogs' NeighborhoodTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 7106 Accepted: 3067 Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名原创 2014-07-28 20:29:30 · 996 阅读 · 0 评论 -
POJ-3684 Labeling Balls
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KDescriptionWindy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 toN in s原创 2014-08-08 11:17:44 · 860 阅读 · 0 评论 -
【费用流消圈】POJ-2175 Evacuation Plan
Evacuation PlanTime Limit: 1000MS Memory Limit: 65536K Special JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelter原创 2014-10-27 19:59:30 · 915 阅读 · 0 评论 -
【最小费用最大流】POJ-2516 Minimum Cost
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原创 2014-10-25 21:58:43 · 876 阅读 · 0 评论 -
【最大流】POJ-1149 PIGS
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原创 2014-09-17 18:20:54 · 609 阅读 · 0 评论 -
【最大流+最短路+二分】POJ-2112 Optimal Milking
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000K Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the c原创 2014-09-19 13:05:26 · 785 阅读 · 0 评论 -
【最大流】POJ-1087 A Plug for UNIX
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原创 2014-09-19 16:37:34 · 714 阅读 · 0 评论 -
ZOJ-1053 FDNY to the Rescue!
FDNY to the Rescue!Time Limit: 2 Seconds Memory Limit: 65536 KB The Fire Department of New York (FDNY) has always been proud of their response time to fires in New York City, but they原创 2014-08-11 20:15:09 · 916 阅读 · 0 评论 -
POJ-3268 Silver Cow Party
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12731 Accepted: 5684DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2014-08-13 20:54:55 · 874 阅读 · 0 评论 -
【最大流】LightOJ-1153 Internet Bandwidth
1153 - Internet BandwidthPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBOn the Internet, machines (nodes) are richly interconnect原创 2014-09-21 23:14:11 · 1251 阅读 · 0 评论 -
【最大流+输出路径】POJ-3436 ACM Computer Factory
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KSpecial Judge DescriptionAs you know, all the computers used for ACM contests must be identical,原创 2014-09-22 22:07:11 · 1134 阅读 · 0 评论 -
POJ-1780 Code
CodeTime Limit: 1000MS Memory Limit: 65536K DescriptionKEY Inc., the leading company in security hardware, has developed a new kind of safe. To unlock it, you d原创 2014-09-12 11:12:52 · 981 阅读 · 0 评论 -
ZOJ-3088 Easter Holidays
Easter HolidaysTime Limit: 1 Second Memory Limit: 32768 KB Special JudgeScandinavians often make vacation during the Easter holidays in the largest ski resort Are. Are provides fanta原创 2014-08-15 15:11:59 · 944 阅读 · 0 评论 -
SGU-101 Domino
101. Dominotime limit per test: 0.25 sec. memory limit per test: 4096 KBDominoes – game played with small, rectangular blocks of wood or other material, each identified by a number of dots,原创 2014-09-13 00:48:33 · 696 阅读 · 0 评论 -
【最大流+混合图欧拉回路】POJ-1637 Sightseeing tour
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原创 2014-09-23 23:48:43 · 729 阅读 · 0 评论 -
【最小割】POJ-3469 Dual Core CPU
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072K Case Time Limit: 5000MSDescriptionAs more and more computers are equipped with dual core CPU, Setag原创 2014-09-24 16:34:12 · 680 阅读 · 0 评论 -
【最小割】POJ-3308 Paratroopers
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原创 2014-09-26 13:14:31 · 743 阅读 · 0 评论 -
【二分图|推理+最大匹配】POJ-1043 What's In A Name?
What's In A Name?Time Limit: 1000MS Memory Limit: 10000K DescriptionThe FBI is conducting a surveillance of a known criminal hideout which serves as a communica原创 2014-11-07 21:26:07 · 949 阅读 · 0 评论 -
【线性规划+最小费用最大流】Vijos-1825 志愿者招募
P1825志愿者招募Accepted标签:NOI2008描述申奥成功后,布布经过不懈努力,终于成为奥组委下属公司人力资源部门的主管。布布刚上任就遇到了一个难题:为即将启动的奥运新项目招募一批短期志愿者。经过估算,这个项目需要N 天才能完成,其中第i 天至少需要Ai 个人。布布通过了解得知,一共有M 类志愿者可以原创 2014-10-23 18:27:03 · 1062 阅读 · 0 评论 -
【连通图|二分匹配+强连通分量】POJ-1904 King's Quest
给出一个二分图以及其中一个完备匹配,求对于每个X点,所有可以与之匹配的Y点,使得最终仍然能得到一个完备匹配。原创 2015-03-11 16:21:44 · 1036 阅读 · 0 评论