随笔分类 -  HDOJ ac之路

HDOJ 1358
摘要：PeriodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2258Accepted Submission(s): 1117Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether 阅读全文
posted @ 2013-11-13 20:07 码代码的猿猿 阅读(215) 评论(0) 推荐(0)
HDOJ 4770 Lights Against Dudely
摘要：状压+暴力搜索Lights Against DudelyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 178Accepted Submission(s): 57Problem DescriptionHarry: "But Hagrid. How am I going to pay for all of this? I haven't any money."Hagrid: "Well there's 阅读全文
posted @ 2013-11-09 23:13 码代码的猿猿 阅读(376) 评论(0) 推荐(0)
HDOJ 4652 Dice
摘要：期望DP +数学推导DiceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 337Accepted Submission(s): 223Special JudgeProblem DescriptionYou have a dice with m faces, each face contains a distinct number. We assume when we tossing the dice, each face will occur 阅读全文
posted @ 2013-11-03 17:33 码代码的猿猿 阅读(333) 评论(0) 推荐(1)
HDOJ 4336 Card Collector
摘要：容斥原理+状压Card CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1940Accepted Submission(s): 907Special JudgeProblem DescriptionIn your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if yo 阅读全文
posted @ 2013-11-03 11:27 码代码的猿猿 阅读(181) 评论(0) 推荐(0)
HDOJ 3853 LOOPS
摘要：水概率DP。。。。LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1359Accepted Submission(s): 552Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But because of the pl 阅读全文
posted @ 2013-11-03 00:42 码代码的猿猿 阅读(247) 评论(0) 推荐(0)
HDOJ 4497 GCD and LCM
摘要：组合数学GCD and LCMTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 451Accepted Submission(s): 216Problem DescriptionGiven two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and l 阅读全文
posted @ 2013-10-16 22:15 码代码的猿猿 阅读(213) 评论(0) 推荐(1)
HDOJ 4717 The Moving Points
摘要：The Moving PointsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 878Accepted Submission(s): 353Problem DescriptionThere are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest d 阅读全文
posted @ 2013-10-15 22:08 码代码的猿猿 阅读(205) 评论(0) 推荐(0)
HDOJ 3593 The most powerful force
摘要：树形DP /泛化物品的背包。。。可以去看09年徐持衡论文《浅谈几类背包问题》The most powerful forceTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 727Accepted Submission(s): 182Problem DescriptionThe leaders of AC country made a decision to regain the TW Island. But they have to face 阅读全文
posted @ 2013-10-10 00:57 码代码的猿猿 阅读(455) 评论(0) 推荐(0)
HDOJ 3507 Print Article
摘要：Print ArticleTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3827Accepted Submission(s): 1195Problem DescriptionZero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is to 阅读全文
posted @ 2013-10-09 11:38 码代码的猿猿 阅读(182) 评论(0) 推荐(0)