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

上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 27 下一页

HDU 2732 Leapin' Lizards(最大流)
摘要:Leapin' Lizards题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2732题目意思看起来比较难懂。题目是说一个n*m的迷宫中,有每个格子有柱子。柱子高度为0~3,高度为0的柱子是不能站的(高度为0就是没有柱子)在一些有柱子的格子上有一些蜥蜴,一次最多跳距离d,相邻格子的距离是1,只要跳出迷宫就是安全的。这个距离是曼哈顿距离(好像是的)。蜥蜴一次最多跳距离d,但是起跳的地方的柱子高度会减一,一个柱子同一时间只能有一个蜥蜴要求最少几个不能逃出迷宫。具体意思看题目吧,很多描述不清呢~~还是英语好啊做法就是最大流。要拆点,两个点的容量就 阅读全文

posted @ 2013-05-02 13:40 kuangbin 阅读(885) 评论(0) 推荐(0) 编辑

HDU 4507 吉哥系列故事——恨7不成妻(数位DP)
摘要:吉哥系列故事——恨7不成妻Time Limit: 1000/500 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 746Accepted Submission(s): 227Problem Description 单身! 依然单身! 吉哥依然单身! DS级码农吉哥依然单身! 所以,他生平最恨情人节,不管是214还是77,他都讨厌! 吉哥观察了214和77这两个数,发现: 2+1+4=7 7+7=7*2 77=7*11 最终,他发现原来这一切归根到底都是因为和7有... 阅读全文

posted @ 2013-05-01 15:28 kuangbin 阅读(4901) 评论(0) 推荐(2) 编辑

HDU 3709 Balanced Number ZOJ 3416 Balanced Number(数位DP)
摘要:Balanced NumberTime Limit:5 Seconds Memory Limit:65536 KBA balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine each digit as a box with weight indicated by the digit. When a pivot is placed at some digit of the number, the dis 阅读全文

posted @ 2013-05-01 10:52 kuangbin 阅读(770) 评论(0) 推荐(0) 编辑

HDU 3652 B-number(数位DP)
摘要:B-numberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1231Accepted Submission(s): 651Problem DescriptionA wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided b 阅读全文

posted @ 2013-05-01 00:44 kuangbin 阅读(925) 评论(0) 推荐(0) 编辑

HDU 4352 XHXJ's LIS(数位DP)
摘要:XHXJ's LISTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 376Accepted Submission(s): 163Problem Description#define xhxj (Xin Hang senior sister(学姐))If you do not know xhxj, then carefully reading the entire description is very important.As the 阅读全文

posted @ 2013-05-01 00:03 kuangbin 阅读(3386) 评论(0) 推荐(1) 编辑

HDU 2089 不要62(数位DP)
摘要:不要62Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11833Accepted Submission(s): 3691Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如:62315 73418 8 阅读全文

posted @ 2013-04-30 21:17 kuangbin 阅读(2040) 评论(0) 推荐(0) 编辑

HDU 3555 Bomb(数位DP)
摘要:BombTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3362Accepted Submission(s): 1185Problem DescriptionThe counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bom 阅读全文

posted @ 2013-04-30 21:07 kuangbin 阅读(1191) 评论(0) 推荐(0) 编辑

HDU 2476 String painter (区间DP)
摘要:String painterTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1117Accepted Submission(s): 443Problem DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. 阅读全文

posted @ 2013-04-30 16:36 kuangbin 阅读(3568) 评论(1) 推荐(0) 编辑

HDU 3681 Prison Break(状态压缩DP+BFS+二分答案)
摘要:Prison BreakTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2178Accepted Submission(s): 533Problem DescriptionRompire is a robot kingdom and a lot of robots live there peacefully. But one day, the king of Rompire was captured by human beings. His t 阅读全文

posted @ 2013-04-25 23:04 kuangbin 阅读(698) 评论(0) 推荐(0) 编辑

HDU 3001 Travelling (状态压缩DP)
摘要:TravellingTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2338Accepted Submission(s): 668Problem DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on 阅读全文

posted @ 2013-04-25 20:37 kuangbin 阅读(757) 评论(0) 推荐(0) 编辑

HDU 1171 Big Event in HDU(背包)
摘要:Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16224Accepted Submission(s): 5725Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College h 阅读全文

posted @ 2013-04-15 20:06 kuangbin 阅读(1822) 评论(0) 推荐(0) 编辑

HDU 1074 Doing Homework (状态压缩DP)
摘要:Doing HomeworkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3595Accepted Submission(s): 1424Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of ha 阅读全文

posted @ 2013-04-12 16:56 kuangbin 阅读(1923) 评论(0) 推荐(2) 编辑

HDU 3642 Get The Treasury(线段树,求立方体交)
摘要:Get The TreasuryTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1408Accepted Submission(s): 440Problem DescriptionJack knows that there is a great underground treasury in a secret region. And he has a special device that can be used to detect trea 阅读全文

posted @ 2013-04-11 17:01 kuangbin 阅读(1247) 评论(1) 推荐(0) 编辑

HDU 3038 How Many Answers Are Wrong (并查集)
摘要:How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1372Accepted Submission(s): 553Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the follo 阅读全文

posted @ 2013-04-05 18:59 kuangbin 阅读(4115) 评论(0) 推荐(0) 编辑

HDU 4542 小明系列故事——未知剩余系 (数论)
摘要:小明系列故事——未知剩余系Time Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 594Accepted Submission(s): 123Problem Description “今有物不知其数,三三数之有二,五五数之有三,七七数之有二,问物几何?” 这个简单的谜题就是中国剩余定理的来历。 在艰难地弄懂了这个定理之后,小明开始设计一些复杂的同余方程组X mod ai = bi 来调戏别人,结果是必然的,都失败了。 可是在这个过程中,小明发现有时... 阅读全文

posted @ 2013-04-04 13:02 kuangbin 阅读(1108) 评论(0) 推荐(0) 编辑

HDU 4544 湫湫系列故事——消灭兔子 (优先队列)
摘要:湫湫系列故事——消灭兔子Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 138Accepted Submission(s): 49Problem Description 湫湫减肥 越减越肥! 最近,减肥失败的湫湫为发泄心中郁闷,在玩一个消灭免子的游戏。 游戏规则很简单,用箭杀死免子即可。 箭是一种消耗品,已知有M种不同类型的箭可以选择,并且每种箭都会对兔子造成伤害,对应的伤害值分别为Di(1 <= i <= M),每种箭需要一定的. 阅读全文

posted @ 2013-03-31 22:21 kuangbin 阅读(1317) 评论(1) 推荐(0) 编辑

HDU 4541 Ten Googol
摘要:Ten GoogolTime Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 100Accepted Submission(s): 48Problem Description Google的面试题向来以古怪闻名,延续自技术公司用逻辑题测试求职者的古老传统.现在我们来看看下面这题: 面试官在房间的白板上写下6个数字: 10,9,60,90,70,66 现在的问题是,接下来该出现什么数字? 想不出来了吧?不要再从数学的角度想了,把这些数字用正常的英... 阅读全文

posted @ 2013-03-31 22:19 kuangbin 阅读(544) 评论(0) 推荐(0) 编辑

HDU 4540 威威猫系列故事——打地鼠 (简单DP)
摘要:威威猫系列故事——打地鼠Time Limit: 300/100 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 59Accepted Submission(s): 45Problem Description 威威猫最近不务正业,每天沉迷于游戏“打地鼠”。 每当朋友们劝他别太着迷游戏,应该好好工作的时候,他总是说,我是威威猫,猫打老鼠就是我的工作! 无话可说... 我们知道,打地鼠是一款经典小游戏,规则很简单:每隔一个时间段就会从地下冒出一只或多只地鼠,玩游戏的人要做的就是打地... 阅读全文

posted @ 2013-03-31 22:14 kuangbin 阅读(1349) 评论(0) 推荐(0) 编辑

HDU 4536 XCOM Enemy Unknown ( 状态压缩+搜索)
摘要:XCOM Enemy UnknownTime Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 133Accepted Submission(s): 34Problem DescriptionXCOM-Enemy Unknown是一款很好玩很经典的策略游戏.在游戏中,由于未知的敌人--外星人入侵,你团结了世界各大国家进行抵抗.随着游戏进展,会有很多的外星人进攻事件.每次进攻外星人会选择3个国家攻击,作为联盟的指挥者,你要安排有限的联盟军去支援其中一个国家,抵抗 阅读全文

posted @ 2013-03-30 22:32 kuangbin 阅读(862) 评论(0) 推荐(0) 编辑

HDU 4535 吉哥系列故事——礼尚往来(水题,错排)
摘要:吉哥系列故事——礼尚往来Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 67Accepted Submission(s): 48Problem Description 吉哥还是那个吉哥 那个江湖人称“叽叽哥”的基哥 每当节日来临,女友众多的叽叽哥总是能从全国各地的女友那里收到各种礼物。 有礼物收到当然值得高兴,但回礼确是件麻烦的事! 无论多麻烦,总不好意思收礼而不回礼,那也不是叽叽哥的风格。 现在,即爱面子又抠门的叽叽哥想出... 阅读全文

posted @ 2013-03-30 22:31 kuangbin 阅读(1036) 评论(0) 推荐(0) 编辑

上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 27 下一页

导航

JAVASCRIPT: