摘要:
POJ3686 The Windy'sTime Limit:5000MSMemory Limit:65536KTotal Submissions:2536Accepted:1084DescriptionThe Windy's is a world famous toy factory that ownsMtop-class workshop to make toys. This year the manager receivesNorders for toys. The manager knows that every order will take different amo 阅读全文
2011年10月18日
2011年10月17日
摘要:
POJ2516 Minimum CostTime Limit:4000MSMemory Limit:65536KTotal Submissions:9392Accepted:3108DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places 阅读全文
2011年10月15日
摘要:
EscapeTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 620Accepted Submission(s): 136Problem DescriptionLoneknight hates attending class very much. Every time he is attending class, when he feel tiresome with the class, he start planning the shortes 阅读全文
摘要:
HDU1533 Going HomeTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1116Accepted Submission(s): 565Problem DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, 阅读全文
2011年10月14日
摘要:
POJ1904 King's QuestTime Limit:15000MSMemory Limit:65536KTotal Submissions:4537Accepted:1533Case Time Limit:2000MSDescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did 阅读全文
2011年10月12日
摘要:
POJ1486 Sorting SlidesTime Limit:1000MSMemory Limit:10000KTotal Submissions:2246Accepted:822DescriptionProfessor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk, he has t 阅读全文
2011年10月11日
摘要:
POJ1944 Fiber CommunicationsTime Limit:1000MSMemory Limit:30000KTotal Submissions:2830Accepted:871DescriptionFarmer John wants to connect his N (1 <= N <= 1,000) barns (numbered 1..N) with a new fiber-optic network. However, the barns are located in a circle around the edge of a large pond, so 阅读全文
2011年10月8日
摘要:
POJ1990MooFestTime Limit:1000MSMemory Limit:30000KTotal Submissions:3400Accepted:1330DescriptionEvery year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, 阅读全文
2011年9月29日
摘要:
POJ1694 An Old Stone GameTime Limit:1000MSMemory Limit:10000KTotal Submissions:2579Accepted:1137DescriptionThere is an old stone game, played on an arbitrary general tree T. The goal is to put one stone on the root of T observing the following rules:At the beginning of the game, the player picks K s 阅读全文
摘要:
POJ1192最优连通子集Time Limit:1000MSMemory Limit:10000KTotal Submissions:1620Accepted:835Description众所周知,我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示,如果x, y都是整数,我们就把点P称为整点,否则点P称为非整点。我们把平面上所有整点构成的集合记为W。定义1 两个整点P1(x1, y1), P2(x2, y2),若|x1-x2| + |y1-y2| = 1,则称P1, P2相邻,记作P1~P2,否则称P1, P2不相邻。定义 2 设点集S是W的一个有限子集,即S.. 阅读全文