上一页 1 2 3 4 5 6 ··· 9 下一页

2013年12月15日

C. Counting Kangaroos is Fun 贪心

摘要: C. Counting Kangaroos is Funtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere arenkangaroos with pockets. Each kangaroo has a size (integer number). A kangaroo can go into another kangaroo's pocket if and only if the size of kangaroo who h 阅读全文

posted @ 2013-12-15 16:40 keep trying 阅读(419) 评论(0) 推荐(0) 编辑

2013年12月4日

B - Save the Students! 简单几何

摘要: B -Save the Students!Time Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionACM International Collegiate Programming Contest, Asia-Amritapuri Site, 2011Problem B: Save the Students!Hogwarts is under attack by the Dark Lord, He-Who-Must-Not-Be-Named 阅读全文

posted @ 2013-12-04 12:34 keep trying 阅读(174) 评论(0) 推荐(0) 编辑

2013年12月3日

J - Goblin Wars BFS

摘要: J -Goblin WarsTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 5992Appoint description:DescriptionACM International Collegiate Programming Contest, Asia-Amritapuri Site, 2011Problem J: Goblin WarsThe wizards and witches of Hogwarts School of Witchcraft foun 阅读全文

posted @ 2013-12-03 19:52 keep trying 阅读(372) 评论(0) 推荐(0) 编辑

二分 + DP

摘要: A -MAGRIDTime Limit:10000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionACM International Collegiate Programming Contest, Asia-Amritapuri Site, 2011Problem A: MAGRIDThanks a lot for helping Harry Potter in finding the Sorcerer's Stone of Immortality i 阅读全文

posted @ 2013-12-03 16:46 keep trying 阅读(235) 评论(0) 推荐(0) 编辑

E - Levko and Array DP + e二分

摘要: E -Levko and ArrayTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionLevko has an array that consists of integers:a1, a2, ... , an. But he doesn’t like this array at all.Levko thinks that the beauty of the arrayadirectly depends on value 阅读全文

posted @ 2013-12-03 14:13 keep trying 阅读(243) 评论(0) 推荐(0) 编辑

2013年12月2日

6277 Addictive Bubbles 水构造

摘要: 6277 Addictive BubblesAlice is a mobile game developer. She writes a new port of the Chain Shot! game (also known asSameGame, Jawbreaker, Bubble Shot, etc) called Addictive Bubbles.The game is played on a rectangular board lled with color bubbles. On each turn player selects agroup of adjacent bubb. 阅读全文

posted @ 2013-12-02 23:45 keep trying 阅读(310) 评论(0) 推荐(0) 编辑

2013年12月1日

B - Free Market 涉及背包问题 + DP

摘要: B -Free MarketTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionJohn Doe has recently found a "Free Market" in his city — that is the place where you can exchange some of your possessions for other things for free.John knows t 阅读全文

posted @ 2013-12-01 21:22 keep trying 阅读(312) 评论(0) 推荐(0) 编辑

I - The Hive 恶心模拟

摘要: I -The HiveTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusPracticeZOJ 3465DescriptionThere is a hive in the village. Like this. There are 9 columns (from A to I) in this hive. Different column may have the different number of grids. Every grid has its own coordinate, 阅读全文

posted @ 2013-12-01 18:07 keep trying 阅读(196) 评论(0) 推荐(0) 编辑

2013年11月30日

B. Valera and Contest 构造水题

摘要: B. Valera and Contesttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera loves to participate in competitions. Especially in programming contests. Today he has participated in the contest with his team, consisting ofnstudents (including Valera) 阅读全文

posted @ 2013-11-30 21:09 keep trying 阅读(156) 评论(0) 推荐(0) 编辑

C. Valera and Elections DFS

摘要: C. Valera and Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe city Valera lives in is going to hold elections to the city Parliament.The city hasndistricts andn - 1bidirectional roads. We know that from any district there is a path al 阅读全文

posted @ 2013-11-30 21:06 keep trying 阅读(259) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 ··· 9 下一页

导航