摘要: 貌似是一道区域赛的题目。 和数独有着相似之处。。。题目的关键在于建图, 然后要注意的是重边!Power StationsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1566Accepted Submission(s): 409 Special JudgeProblem DescriptionThere are N towns in our country, and some of them are connected by electri 阅读全文
posted @ 2013-04-08 21:56 chenhuan001 阅读(210) 评论(0) 推荐(0) 编辑
摘要: 用了点离散化的处理, 然后二分一下就可以了。。。RadarTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1928Accepted Submission(s): 796 Problem DescriptionN cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar st 阅读全文
posted @ 2013-04-08 13:50 chenhuan001 阅读(203) 评论(0) 推荐(0) 编辑
摘要: 简单重复覆盖题。。。whosyourdaddyTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1022Accepted Submission(s): 502 Problem Descriptionsevenzero liked Warcraft very much, but he haven't practiced it for several years after being addicted to algorithms. N 阅读全文
posted @ 2013-04-08 13:48 chenhuan001 阅读(164) 评论(0) 推荐(0) 编辑
摘要: 重复点覆盖的题, 建好图就可以直接A 了。。。Bomberman - Just Search!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 497Accepted Submission(s): 276 Problem DescriptionBomberman has been a very popular game ever since it was released. As you can see above, the game is p 阅读全文
posted @ 2013-04-08 13:45 chenhuan001 阅读(131) 评论(0) 推荐(0) 编辑
摘要: 可以重复的点覆盖, 写法和一般的DLX 很相似,但是在找到选择一行的时候,只删去这一行上所有点的列。 还要注意的是启发函数起了很大的剪枝作用。 Problem 1686 神龙的难题 Accept: 331 Submit: 1111 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description这是个剑与魔法的世界.英雄和魔物同在,动荡和安定并存.但总的来说,库尔特王国是个安宁的国家,人民安居乐业,魔物也比较少.但是.总有一些魔物不时会进入城市附近,干扰人民的生活.就要有一些人出来守护居民们不被魔物侵害.魔法使艾米莉就是这样的一 阅读全文
posted @ 2013-04-08 13:42 chenhuan001 阅读(244) 评论(0) 推荐(0) 编辑