----匹配问题
文章平均质量分 87
Wang_128
这个作者很懒,什么都没留下…
展开
-
ZOJ1516-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 the s原创 2017-03-12 13:34:52 · 515 阅读 · 0 评论 -
POJ3189-Steady Cow Assignment
Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6728 Accepted: 2308DescriptionFarmer John's N (1 FJ would like to rearrange t原创 2017-03-14 23:00:33 · 245 阅读 · 0 评论 -
HUST1027-Enemy Target!
Enemy Target!时间限制:2秒 内存限制:128兆自定评测 114 次提交 34 次通过题目描述In the Game Red Alert, a group of soviet infantry marches towards our base. And we have N Prism Tanks to defend our base. Suppo原创 2017-04-10 17:00:27 · 316 阅读 · 0 评论 -
HDU4687-Boke and Tsukkomi(一般图匹配带花树)
Boke and Tsukkomi Time Limit: 3000/3000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)原创 2017-03-14 20:00:58 · 470 阅读 · 0 评论 -
URAL-1099Work Scheduling
1099. Work SchedulingTime limit: 0.5 secondMemory limit: 64 MBThere is certain amount of night guards that are available to protect the local junkyard from possible junk robberies. These原创 2017-03-14 18:31:25 · 320 阅读 · 0 评论 -
URAL1997-Those are not the droids you're looking for
1997. Those are not the droids you're looking forTime limit: 1.0 secondMemory limit: 64 MBBar owner: Hey. We don’t serve their kind here.Luke: What?Bar owner: Your droids – they’ll h原创 2017-04-11 20:13:20 · 382 阅读 · 0 评论 -
POJ2536-Gopher II
Gopher IITime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9003 Accepted: 3722DescriptionThe gopher family, having averted the canine threat, must face原创 2017-06-29 14:34:30 · 382 阅读 · 0 评论 -
POJ1325&&ZOJ1364-Machine Schedule
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14798 Accepted: 6318DescriptionAs we all know, machine scheduling is a very classical原创 2017-03-12 00:54:57 · 280 阅读 · 0 评论 -
POJ3041-Asteroids
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21806 Accepted: 11839DescriptionBessie wants to navigate her spaceship through a dangerous as原创 2017-03-12 15:57:22 · 194 阅读 · 0 评论 -
HDU2444-The Accomodation of Students
The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-06-29 22:38:16 · 294 阅读 · 0 评论 -
POJ2112-Optimal Milking
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 17153 Accepted: 6167Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K原创 2017-03-13 23:37:36 · 318 阅读 · 0 评论 -
HDU5943-Kingdom of Obsession
Kingdom of Obsession Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2017-07-02 14:29:14 · 285 阅读 · 0 评论 -
HDU1054&&POJ1463-Strategic game
Strategic GameTime Limit : 20000/10000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 26 Accepted Submission(s) : 18Font: Times New Roman | Verdana | Geor原创 2017-01-16 11:23:36 · 739 阅读 · 0 评论 -
HDU2119-Matrix
Matrix Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-11-08 22:34:03 · 221 阅读 · 0 评论 -
HDU3488-Tour
Tour Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)原创 2017-03-13 22:25:53 · 251 阅读 · 0 评论 -
ZOJ1140&&POJ1469&&HDU1083-Courses
CoursesTime Limit: 10 Seconds Memory Limit: 32768 KBConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine wheth原创 2017-03-12 13:03:37 · 520 阅读 · 0 评论 -
HDU1045&&ZOJ1002-Fire Net
Fire NetTime Limit: 2 Seconds Memory Limit: 65536 KBSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each represent原创 2016-05-01 20:01:47 · 1443 阅读 · 0 评论 -
ZOJ1137&&POJ1466-Girls and Boys
Girls and BoysTime Limit: 10 Seconds Memory Limit: 32768 KBthe second year of the university somebody started a study on the romantic relations between the students. The relation ��roma原创 2017-03-12 14:17:40 · 499 阅读 · 0 评论 -
ZOJ1525&&POJ1422&&HDU1151-Air Raid
Air RaidTime Limit: 2 Seconds Memory Limit: 65536 KBConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that start原创 2017-03-12 15:16:18 · 322 阅读 · 0 评论 -
HDU1281-棋盘游戏
棋盘游戏 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)原创 2017-03-12 21:40:11 · 310 阅读 · 1 评论 -
HDU2819-Swap
Swap Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-03-12 22:55:45 · 599 阅读 · 0 评论 -
HDU4185-Oil Skimming
Oil Skimming Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-03-12 23:46:23 · 323 阅读 · 0 评论 -
ZOJ1654-Place the Robots(二分图匹配)
Place the RobotsTime Limit: 5 Seconds Memory Limit: 32768 KBRobert is a famous engineer. One day he was given a task by his boss. The background of the task was the following:Given原创 2017-03-11 23:52:02 · 581 阅读 · 0 评论 -
POJ2594-Treasure Exploration
Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 8353 Accepted: 3423DescriptionHave you ever read any book about treasure explorati原创 2017-03-13 16:21:08 · 283 阅读 · 0 评论 -
HDU2389-Rain on your Parade(二分图匹配Hopcroft-Karp算法)
Rain on your Parade Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 655350/165535 K (Java/Others)原创 2017-03-12 23:29:45 · 371 阅读 · 0 评论 -
HDU2255-奔小康赚大钱(二分图最大权匹配KM算法)
奔小康赚大钱 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8321原创 2017-03-13 10:21:19 · 302 阅读 · 0 评论 -
POJ2289-Jamie's Contact Groups(二分图多重匹配)
Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 7582 Accepted: 2551DescriptionJamie is a very popular girl and has quite a lot o原创 2017-03-13 21:49:20 · 724 阅读 · 0 评论 -
POJ3020-Antenna Placement
Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9411 Accepted: 4646DescriptionThe Global Aerial Research Centre has been allotted the原创 2017-03-14 00:49:26 · 366 阅读 · 0 评论 -
HDU3829-Cat VS Dog
Cat VS Dog Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)原创 2017-03-13 17:09:48 · 241 阅读 · 0 评论 -
The Maximum Unreachable Node Set
In this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V,E)G=(V,E). In mathematics a directed acyclic graph (DAG)(DAG) is a directed graph with no directed cycl...原创 2018-04-19 19:21:08 · 386 阅读 · 0 评论