随笔分类 -  ACM(HOJ)题目解题报告

上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 27 下一页

HDU 3853 LOOPS(概率DP)
摘要:LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 649Accepted Submission(s): 267Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the plot of the 阅读全文

posted @ 2012-10-03 23:00 kuangbin 阅读(3275) 评论(5) 推荐(0)

HDU 4035 Maze(概率DP)
摘要:MazeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 957Accepted Submission(s): 307Special JudgeProblem DescriptionWhen wake up, lxhgww find himself in a huge maze.The maze consisted by N rooms and tunnels connecting these rooms. Each pair of rooms 阅读全文

posted @ 2012-10-03 22:10 kuangbin 阅读(4842) 评论(1) 推荐(7)

HDU 4089 Activation(概率DP)
摘要:ActivationTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 520Accepted Submission(s): 179Problem DescriptionAfter 4 years' waiting, the game "Chinese Paladin 5" finally comes out. Tomato is a crazy fan, and luckily he got the first r 阅读全文

posted @ 2012-10-03 18:46 kuangbin 阅读(4272) 评论(1) 推荐(6)

HDU 4405 Aeroplane chess(概率DP求期望)
摘要:Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 361Accepted Submission(s): 255Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文

posted @ 2012-10-03 18:08 kuangbin 阅读(2372) 评论(0) 推荐(0)

HDU 4082 Hou Yi's secret (几何,求相似三角形个数,暴力枚举,map记录)
摘要:Hou Yi's secretTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 877Accepted Submission(s): 285Problem DescriptionLong long ago, in the time of Chinese emperor Yao, ten suns rose into the sky. They burned the crops and scorched the bushes and tre 阅读全文

posted @ 2012-10-03 13:13 kuangbin 阅读(915) 评论(0) 推荐(0)

HDU 4285 circuits 第37届ACM/ICPC天津赛区网络赛(插头DP)
摘要:circuitsTime Limit: 30000/15000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 418Accepted Submission(s): 141Problem Description Given a map of N * M (2 <= N, M <= 12) , '.' means empty, '*' means walls. You need to build K circuits and no circuit 阅读全文

posted @ 2012-10-02 13:51 kuangbin 阅读(1300) 评论(2) 推荐(0)

HDU 1693 Eat the Trees(插头DP,多条回路)
摘要:Eat the TreesTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1663Accepted Submission(s): 783Problem DescriptionMost of us know that in the game called DotA(Defense of the Ancient), Pudge is a strong hero in the first period of the game. When the ga 阅读全文

posted @ 2012-10-01 17:44 kuangbin 阅读(3217) 评论(3) 推荐(1)

HDU 3377 Plan (插头DP)
摘要:PlanTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 449Accepted Submission(s): 151Problem DescriptionOne day, Resty comes to an incredible world to seek Eve -- The origin of life. Lilith, the sister of Eve, comes with him. Although Resty wants to f 阅读全文

posted @ 2012-10-01 16:12 kuangbin 阅读(1193) 评论(0) 推荐(0)

HDU 1964 Pipes(插头DP)
摘要:PipesTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 301Accepted Submission(s): 154Problem DescriptionThe construction of office buildings has become a very standardized task. Pre-fabricated modules are combined according to the customer’s needs, s 阅读全文

posted @ 2012-09-30 20:59 kuangbin 阅读(1097) 评论(0) 推荐(0)

HDU 4417 Super Mario 第37届ACM/ICPC 杭州赛区网络赛第1008题 (划分树)
摘要:Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 120Accepted Submission(s): 73Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble aga 阅读全文

posted @ 2012-09-23 20:44 kuangbin 阅读(1448) 评论(3) 推荐(0)

HDU 4417 Super Mario 第37届ACM/ICPC 杭州赛区网络赛1008题(树状数组或者线段树)
摘要:Super MarioTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 80Accepted Submission(s): 42Problem DescriptionMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble agai 阅读全文

posted @ 2012-09-23 19:39 kuangbin 阅读(2047) 评论(8) 推荐(0)

HDU 4419 Colourful Rectangle 第37届ACM/ICPC 杭州赛区网络赛 1010题 (线段树)
摘要:Colourful RectangleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12Accepted Submission(s): 3Problem DescriptionWe use Red, Green and Blue to make new colours. See the picture below:Now give you n rectangles, the colour of them is red or green or 阅读全文

posted @ 2012-09-23 17:14 kuangbin 阅读(1376) 评论(0) 推荐(0)

HDU 3829 Cat VS Dog (二分匹配求最大独立集)
摘要:Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1770Accepted Submission(s): 600Problem DescriptionThe zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the chil 阅读全文

posted @ 2012-09-23 10:25 kuangbin 阅读(991) 评论(0) 推荐(0)

HDU 2710 Max Factor (水题)
摘要:Max FactorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2238Accepted Submission(s): 684Problem DescriptionTo improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 5,000) cows with a distinct serial number in the 阅读全文

posted @ 2012-09-23 09:25 kuangbin 阅读(1463) 评论(0) 推荐(0)

HDU 4405 Aeroplane chess 第37届ACM/ICPC 金华赛区网络赛(递推求期望)
摘要:Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 229Accepted Submission(s): 158Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文

posted @ 2012-09-22 22:48 kuangbin 阅读(984) 评论(0) 推荐(0)

HDU 4407 Sum 第37届ACM/ICPC 金华赛区 第1008题 (容斥原理)
摘要:SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 358Accepted Submission(s): 109Problem DescriptionXXX is puzzled with the question below: 1, 2, 3, ..., n (1<=n<=400000) are placed in a line. There are m (1<=m<=1000) operations of two 阅读全文

posted @ 2012-09-22 22:45 kuangbin 阅读(1688) 评论(0) 推荐(0)

HDU 4408 Minimum Spanning Tree 第37届ACM/ICPC 金华赛区网络赛1009 题 (最小生成树计数)
摘要:Minimum Spanning TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 205Accepted Submission(s): 65Problem DescriptionXXX is very interested in algorithm. After learning the Prim algorithm and Kruskal algorithm of minimum spanning tree, XXX finds th 阅读全文

posted @ 2012-09-22 21:20 kuangbin 阅读(2003) 评论(0) 推荐(0)

HDU 4403 A very hard Aoshu problem 第37届ACM/ICPC 金华赛区网络赛1004题
摘要:A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 137Accepted Submission(s): 100Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary 阅读全文

posted @ 2012-09-22 20:54 kuangbin 阅读(1040) 评论(0) 推荐(0)

HDU 3183 A Magic Lamp (双向链表贪心删除 或者是 RMQ取数)
摘要:A Magic LampTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 745Accepted Submission(s): 271Problem DescriptionKiki likes traveling. One day she finds a magic lamp, unfortunately the genie in the lamp is not so kind. Kiki must answer a question, and 阅读全文

posted @ 2012-09-21 12:36 kuangbin 阅读(620) 评论(0) 推荐(0)

HDU 1806 Frequent values(RMQ)
摘要:Frequent valuesTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 778Accepted Submission(s): 259Problem DescriptionYou are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries co 阅读全文

posted @ 2012-09-20 22:18 kuangbin 阅读(1731) 评论(0) 推荐(1)

上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 27 下一页

导航

JAVASCRIPT: