DFS
oopslb
这个作者很懒,什么都没留下…
展开
-
hdu 1213 How many ways (记忆化搜索)
How many waysTime Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 42 Accepted Submission(s) : 26Font: Times New Roman | Verdana | GeorgiaFont...原创 2017-05-04 23:29:06 · 178 阅读 · 0 评论 -
hdu 2102 A计划 (DFS)
A计划Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 94 Accepted Submission(s) : 44Font: Times New Roman | Verdana | GeorgiaFont Size: ← →...原创 2017-05-06 20:25:04 · 309 阅读 · 0 评论 -
hdu 1078 FatMouse and Cheese (DFS)
FatMouse and CheeseTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 73 Accepted Submission(s) : 40Font: Times New Roman | Verdana | Georgia...原创 2017-05-06 21:58:18 · 377 阅读 · 0 评论 -
hdu 1501 Zipper(DFS)
ZipperTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 93 Accepted Submission(s) : 40Font: Times New Roman | Verdana | GeorgiaFont Size: ...原创 2017-05-10 10:26:45 · 233 阅读 · 0 评论 -
hdu 1426 Sudoku Killer (DFS)
Sudoku KillerTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 84 Accepted Submission(s) : 35Font: Times New Roman | Verdana | GeorgiaFont...原创 2017-05-10 11:02:22 · 288 阅读 · 0 评论 -
hdu 6341 Let Sudoku Rotate(爆搜+剪枝)
http://acm.hdu.edu.cn/showproblem.php?pid=6341思路:直接dfs,搜索每个格子是否符合,不符合就旋转,找到最小的代码:#include<bits/stdc++.h>using namespace std;char c[25][25];int a[25][25];int vis[25];int ans,flag;void...原创 2018-08-04 20:44:29 · 151 阅读 · 0 评论 -
牛客练习赛23 F 托米的游戏 (爆搜+逆元)
题目思路:其实轮数的期望就是每个点被选中的期望,我们可以发现我们选这个点要在他到根的路径上的点集中第一次选中(不然他 就被砍掉了),就是直接求他的深度即可。期望就是1/dep[i]之和。代码#include<bits/stdc++.h>using namespace std;const int N=1e5+10;const int mod=998244353;vec...原创 2018-07-30 10:41:23 · 225 阅读 · 1 评论 -
hdu4403A very hard Aoshu problem
A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1749 Accepted Submission(s): 1202Problem DescriptionAosh原创 2017-11-11 20:51:24 · 185 阅读 · 0 评论 -
hdu 1241 Oil Deposits (DFS)
Oil DepositsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 96 Accepted Submission(s) : 63Font: Times New Roman | Verdana | GeorgiaFont ...原创 2017-05-05 19:46:08 · 222 阅读 · 0 评论 -
2018 牛客多校第七场 C Bit Compression (DFS+剪枝)
https://www.nowcoder.com/acm/contest/145/C 题意:给你一个n,再给你一个长度为2的n次方的01串。每次字符串可以选择三种操作:& | ^。选择之后,相邻的字符按这个操作合并:比如 1101 选择^ 则 1^1=0 0^1=1; 然后字符串就变成了01。继续操作直到剩余一个字符。问你最后只剩一个1的方法总数有多少种。思路:直接...原创 2018-08-10 15:33:38 · 183 阅读 · 0 评论