heaventouch

摘要： 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 .. 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5517Accepted Submission(s): 2280Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He dec 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2493Accepted Submission(s): 1103Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和 阅读全文

摘要： 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 阅读全文

摘要： A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4842Accepted Submission(s): 1758Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a 阅读全文

摘要： ZipperTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5593Accepted Submission(s): 2039Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The firs 阅读全文

摘要： 还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21144Accepted Submission(s): 9419Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用 阅读全文

摘要： 前m大的数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8100Accepted Submission(s): 2898Problem Description还记得Gardon给小希布置的那个作业么？（上次比赛的1005）其实小希已经找回了原来的那张数表，现在她想确认一下她的答案是否正确，但是整个的答案是很庞大的表，小希只想让你把答案中最大的M个数告诉她就可以了。给定一个包含N(N12 int s[10005];13 int a[3005]; 阅读全文

摘要： Drainage DitchesTime Limit:1000MSMemory Limit:10000KTotal Submissions:50321Accepted:19105DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. 阅读全文

摘要： USACO 4.2.1 Ditch 网络最大流问题算法小结转自：http://dantvt.is-programmer.com/posts/7974.html 輝夜(tadvent) posted @ 2009年4月06日 22:58 in 算法研究 with tags 最大流 Dinic SAP usaco 算法 , 5500 阅读通过 USACO 4.2.1 Ditch 学习一下最大流算法 。可惜它给的测试数据几乎没有任何杀伤力，后面测试时我们采用 DD_engi 写的程序生成的加强版数据。总体上来说，最大流算法分为两大类：增广路 (Augmenting Path) 和预流推进重标号 (P 阅读全文

摘要： 畅通工程续Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21439Accepted Submission(s): 7472Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。Input本题目包含多 阅读全文