随笔分类 -  搜索

scu 4284 Windy's Job
摘要：http://cstest.scu.edu.cn/soj/problem.action?id=42844284: Windy's JobSubmit your solutionDiscuss this problemBest solutionsDescriptionWindy has N jobs, the i-th job will cost Windy Pi seconds to finish it, and will get Vi sense of achievement.Windy want to get at least K sense of achievement, the 阅读全文
posted @ 2013-05-02 15:35 M_cag 阅读(241) 评论(0) 推荐(0)
poj 1979(dfs)
摘要：#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int dx[]={0,1,-1,0};const int dy[]={1,0,0,-1};const int maxn = 25;bool vis[maxn][maxn];char str[maxn][maxn];int n,m;bool ok(int x,int y){ if(x>=0&&x<m&&y>=0&&y<n& 阅读全文
posted @ 2013-03-30 00:06 M_cag 阅读(146) 评论(0) 推荐(0)
hdu 4190（二分搜索）
摘要：Distributing Ballot BoxesTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 423Accepted Submission(s): 228 Problem DescriptionToday, besides SWERC'11, another important event is taking place in Spain which rivals it in importance: General Elect 阅读全文
posted @ 2013-02-14 21:13 M_cag 阅读(264) 评论(0) 推荐(0)
poj 3009（dfs）
摘要：Curling 2.0Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7356Accepted: 3069DescriptionOn Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewhat different from ours. The game is played on an ice game board on which a square mesh is marked. 阅读全文
posted @ 2012-10-29 19:46 M_cag 阅读(189) 评论(0) 推荐(0)
poj 2488（简单dfs，注意方向）
摘要：A Knight's JourneyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 22306Accepted: 7546DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is two square 阅读全文
posted @ 2012-10-28 20:46 M_cag 阅读(231) 评论(0) 推荐(0)
hdu 1175（连连看bfs）
摘要：连连看Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10550Accepted Submission(s): 2805Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意 阅读全文
posted @ 2012-10-17 21:08 M_cag 阅读(342) 评论(0) 推荐(0)
hdu 1181 （dfs）
摘要：变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 7187Accepted Submission(s): 2673Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体. Harry已经将他所会的所有咒语都列成了一 阅读全文
posted @ 2012-09-25 20:23 M_cag 阅读(147) 评论(0) 推荐(0)