沐阳 - 博客园

2011年8月9日

摘要：连连看Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5613Accepted Submission(s): 1455Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意见阅读全文

posted @ 2011-08-09 18:20 沐阳阅读(1023) 评论(0) 推荐(0) 编辑

HDU-1240 Asteroids! BFS

摘要： Asteroids!Problem DescriptionYou're in space.You want to get home.There are asteroids.You don't want to hit them.InputInput to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be n 阅读全文

posted @ 2011-08-09 16:30 沐阳阅读(687) 评论(0) 推荐(0) 编辑

HDU-1072 Nightmare BFS

摘要： NightmareTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2853Accepted Submission(s): 1423Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get 阅读全文

posted @ 2011-08-09 15:32 沐阳阅读(315) 评论(0) 推荐(0) 编辑

HDU-1372 Knight Moves BFS

摘要： Knight MovesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2169Accepted Submission(s): 1380Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves th 阅读全文

posted @ 2011-08-09 14:43 沐阳阅读(1588) 评论(0) 推荐(1) 编辑

HDU-1242 Rescue BFS+优先队列

摘要： RescueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5895Accepted Submission(s): 2192Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, 阅读全文

posted @ 2011-08-09 12:16 沐阳阅读(398) 评论(0) 推荐(0) 编辑

HDU-1180 诡异的楼梯 BFS+优先队列

摘要：诡异的楼梯Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3323Accepted Submission(s): 746Problem DescriptionHogwarts正式开学以后,Harry发现在Hogwarts里,某些楼梯并不是静止不动的，相反,他们每隔一分钟就变动一次方向. 比如下面的例子里,一开始楼梯在竖直方向,一分钟以后它移动到了水平方向,再过一分钟它又回到了竖直方向.Harry发现对他来说很难找到能使得他最快到达目的地的路线阅读全文

posted @ 2011-08-09 11:17 沐阳阅读(502) 评论(0) 推荐(0) 编辑

2011年8月8日

STL map

摘要：由于对一道题目的错误理解，导致突然萌发了对与map的用法的开发，就是在形如 map< Node, int >，那么只要在重载Node的 '<'操作符时只针对个别元素，那么这些特别元素相同的结构体会被map视为相同的。代码如下：#include <map>#include <cstdio>#include <cstring>#include <iostream>using namespace std;struct Node{ int a, b; string str; Node( int n, int m, st 阅读全文

posted @ 2011-08-08 22:26 沐阳阅读(242) 评论(0) 推荐(0) 编辑

HDU-1495 非常可乐 BFS

摘要：非常可乐Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1190Accepted Submission(s): 500Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认为。因为每次当seeyou买了可乐以后，阿牛就要求和seeyou一起分享这一瓶可乐，而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子，它们的容量分别是N 毫升和M 毫升可乐的体积为S （S<1 阅读全文

posted @ 2011-08-08 17:51 沐阳阅读(1986) 评论(0) 推荐(0) 编辑

HDU-2102 A计划 BFS

摘要： A计划Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4156Accepted Submission(s): 936Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被阅读全文

posted @ 2011-08-08 16:28 沐阳阅读(1205) 评论(0) 推荐(0) 编辑

HDU-1019 Least Common Multiple

摘要：注意求最小公倍数的时候先乘后除，代码如下：#include <stdio.h>#include <math.h>int gcd( int a, int b ){ if( b== 0 ) { return a; } return gcd( b, a% b );}int main(){ int T; scanf( "%d", &T ); while( T-- ) { int N, last, cur; scanf( "%d", &N ); scanf( "%d", &last ); for( 阅读全文

posted @ 2011-08-08 12:15 沐阳阅读(260) 评论(0) 推荐(0) 编辑

沐阳

公告