文章分类 -  二分匹配

摘要:Treasure ExplorationTime Limit:6000MSMemory Limit:65536KTotal Submissions:6284Accepted:2533DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would never kn 阅读全文
posted @ 2013-11-09 17:56 heaventouch 阅读(127) 评论(0) 推荐(0) 编辑
摘要:Antenna PlacementTime Limit:1000MSMemory Limit:65536KTotal Submissions:5803Accepted:2901DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new, 阅读全文
posted @ 2013-11-09 16:50 heaventouch 阅读(131) 评论(0) 推荐(0) 编辑
摘要:AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:13022Accepted:7093DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 13 #include14 int g[505][505];15 int match[505];16 int vis[505];17 int n,m;18 int dfs(int x)19 {20 .. 阅读全文
posted @ 2013-11-09 12:13 heaventouch 阅读(185) 评论(0) 推荐(0) 编辑
摘要:Repairing CompanyTime Limit:1000MSMemory Limit:131072KTotal Submissions:5915Accepted:1599DescriptionLily runs a repairing company that services theQblocks in the city. One day the company receivesMrepair tasks, theith of which occurs in blockpi, has a deadlinetion any repairman’s arrival, which is a 阅读全文
posted @ 2013-11-09 11:01 heaventouch 阅读(152) 评论(0) 推荐(0) 编辑
摘要:Machine ScheduleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4793Accepted Submission(s): 2368Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Sche 阅读全文
posted @ 2013-11-09 09:08 heaventouch 阅读(202) 评论(0) 推荐(0) 编辑
摘要:The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1743Accepted Submission(s): 843Problem DescriptionThere are a group of students. Some of them may know each other, while others don't. For example, A and B know each ot 阅读全文
posted @ 2013-11-06 16:18 heaventouch 阅读(184) 评论(0) 推荐(0) 编辑
摘要:I'm Telling the TruthTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1190Accepted Submission(s): 610Problem DescriptionAfter this year’s college-entrance exam, the teacher did a survey in his class on students’ score. There are n students in th 阅读全文
posted @ 2013-11-05 16:40 heaventouch 阅读(109) 评论(0) 推荐(0) 编辑
摘要:Selecting CoursesTime Limit:1000MSMemory Limit:65536KTotal Submissions:7961Accepted:3530DescriptionIt is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much, and at the beginning 阅读全文
posted @ 2013-11-03 10:34 heaventouch 阅读(114) 评论(0) 推荐(0) 编辑
摘要:MatrixTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1490Accepted Submission(s): 663Problem DescriptionGive you a matrix(only contains 0 or 1),every time you can select a row or a column and delete all the '1' in this row or this column .Y 阅读全文
posted @ 2013-10-26 21:43 heaventouch 阅读(128) 评论(0) 推荐(0) 编辑
摘要:Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5215Accepted Submission(s): 2935Problem DescriptionSuppose 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 representing a st 阅读全文
posted @ 2013-10-26 14:53 heaventouch 阅读(148) 评论(0) 推荐(0) 编辑
摘要:DollsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 914Accepted Submission(s): 433Problem DescriptionDo you remember the box of Matryoshka dolls last week? Adam just got another box of dolls from Matryona. This time, the dolls have different shape 阅读全文
posted @ 2013-10-26 11:32 heaventouch 阅读(139) 评论(0) 推荐(0) 编辑
摘要:过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8001 Accepted Submission(s): 3509Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partne... 阅读全文
posted @ 2013-10-22 08:10 heaventouch 阅读(102) 评论(0) 推荐(0) 编辑
摘要:Girls and BoysTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6148Accepted Submission(s): 2750Problem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically 阅读全文
posted @ 2013-09-25 23:01 heaventouch 阅读(138) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示