数据结构:DFS/BFS
数据结构:DFS/BFS
LSD20164388
如果你过几天就忘了,那么你并没有真正的掌握。
展开
-
2014-2015 ACM-ICPC, Asia Xian Regional Contest Problem H. The Problem to Make You Happy(博弈,记忆化搜索)
题意:给你n(<=100)个点m(<=n*(n-1))条边的有向简单图,Alice和Bob(两个人都足够聪明)在这个图上玩游戏,两个人轮流沿着有向图走,一次只能走一条边,Bob先走,如果Alice和Bob走到同一个点,或者Bob无法走了,则Bob输,否则Bob赢(Alice永远追不上Bob或者Alice无路可走)。如果Bob能赢输出Yes,否则输出No。思路:考虑记忆化搜索。但是由于图并不是DAG,我们只能倒着从已知的状态往前推,从而找出所有的Bob的必败态。dp[i][j][k原创 2020-06-06 18:33:16 · 247 阅读 · 0 评论 -
2020年4月26日训练日记
01bfs可以O(V+E)求解边权全为1的图上最短路。而当边权只有0或1时,使用其它最短路算法是有些浪费的,此时可以使用bfs的变种:0-1 bfs来快速求解,复杂度仍为O(V+E).01bfs维护一个双端队列,当边权为0时,使用push_front,当边权为1时,使用push_back.资料摘自:https://blog.csdn.net/m0_37809890/article/de...原创 2020-04-26 17:54:54 · 239 阅读 · 0 评论 -
Codeforces Round #628 (Div. 2) E. Ehab's REAL Number Theory Problem(思维+BFS)
题目传送门E. Ehab's REAL Number Theory Problemtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an arrayaaof lengthn...原创 2020-03-16 18:29:12 · 215 阅读 · 0 评论 -
Codeforces Round #615 (Div. 3) F. Three Paths on a Tree (DFS)
题目链接F. Three Paths on a Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an unweighted tree withnnvertices....原创 2020-01-23 18:23:58 · 518 阅读 · 0 评论 -
ACM-ICPC 2018 徐州赛区网络预赛 B BE, GE or NE (记忆化dfs)
In a world where ordinary people cannot reach, a boy named "Koutarou" and a girl named "Sena" are playing a video game. The game system of this video game is quite unique: in the process of playing th...原创 2018-09-10 09:00:33 · 558 阅读 · 4 评论 -
2016年ACM/ICPC北京赛区 E题(bfs)
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5694题意:一个长度为5的串,初始为12345,有三种变化方式:1、交换任意相邻的两个数,无次数限制2、任意一位上的数字加1,超过10对1...原创 2018-10-04 15:55:30 · 410 阅读 · 2 评论 -
2015年ACM/ICPC北京赛区 C题(BFS+思维)
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5275题意:给你两个只包含数字1~6的长度不超过110的字符串a和b,两种操作:1、把b中某一位b[i]改成j2、把b中的数字i都改成j...原创 2018-09-29 21:09:11 · 428 阅读 · 0 评论 -
Codeforces Round #527 (Div. 3) E. Minimal Diameter Forest (思维+dfs)
E. Minimal Diameter Foresttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a forest — an undirected graph with nn v...原创 2018-12-21 16:21:01 · 399 阅读 · 5 评论 -
Codeforces Round #531 (Div. 3) F. Elongated Matrix (状压+记搜)
F. Elongated Matrixtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a matrix aa, consisting of nn rows and mm colum...原创 2019-01-12 11:18:05 · 317 阅读 · 0 评论 -
HDU 4528 小明系列故事——捉迷藏(bfs)
小明系列故事——捉迷藏Time Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2804Accepted Submission(s): 838Problem Description 小明的妈妈生了三个孩子,老大叫大明, 老二叫...原创 2019-04-13 09:57:17 · 196 阅读 · 0 评论 -
HDU 6351 Beautiful Now(DFS)
Beautiful NowTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 750 Accepted Submission(s): 259 Problem DescriptionAnton has a positiv...原创 2018-08-06 21:42:35 · 345 阅读 · 0 评论 -
HDU 6386 Age of Moyu(最短路变形)
Age of MoyuTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1531 Accepted Submission(s): 467 Problem DescriptionMr.Quin love fishes ...原创 2018-08-14 10:37:27 · 512 阅读 · 2 评论 -
HDU Pots
这是一道简单的广搜(bfs)题。题意为给定两个杯子的容量,初始时为空,用四种倒法倒出题中所给的数,输出最小倒的次数和倒水路径。第一种是把第1杯装满或把第2杯装满,第二种是把第1杯的水倒掉或把第2杯的水倒掉,第三种倒法是把第一杯中的水倒入第二杯或把第二杯中的水倒入第一杯。思路:广搜(bfs),枚举8种可能出现的情况,用pre记录上一个倒法在vec中的位置,now表示这种倒法在vec中的位置,原创 2017-08-05 20:20:15 · 317 阅读 · 0 评论 -
HDU 5296 Annoying problem(LCA+DFS序+思维)
Annoying problemTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1906 Accepted Submission(s): 632 Problem DescriptionCoco has a tree,...原创 2018-07-18 13:15:32 · 326 阅读 · 0 评论 -
HDU 5336 XYZ and Drops(BFS)
XYZ and DropsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2151 Accepted Submission(s): 741 Problem DescriptionXYZ is playing an in...原创 2018-07-24 19:59:03 · 319 阅读 · 0 评论 -
HDU 5335 Walk Out(双BFS)
Walk OutTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4811 Accepted Submission(s): 971 Problem DescriptionIn an n∗m maze, the right...原创 2018-07-26 09:24:33 · 189 阅读 · 0 评论 -
HDU 5305 Friends(dfs+剪枝)
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2785 Accepted Submission(s): 1324Problem DescriptionThere are n people and m pairs of ...原创 2018-07-15 15:41:10 · 256 阅读 · 0 评论 -
HDU 5323 Solve this interesting problem(DFS)
Solve this interesting problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3297 Accepted Submission(s): 1058 Problem DescriptionHa...原创 2018-07-21 08:43:41 · 253 阅读 · 0 评论 -
HDU 5348 MZL's endless loop (dfs+思维)
MZL's endless loopTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3134 Accepted Submission(s): 741Special Judge Problem Description...原创 2018-07-31 11:11:11 · 271 阅读 · 0 评论 -
HDU 5352 MZL's City(费用流)
MZL's CityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1227 Accepted Submission(s): 454 Problem DescriptionMZL is an active girl w...原创 2018-08-01 11:14:06 · 217 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第七场)C Bit Compression(暴力)
链接:https://www.nowcoder.com/acm/contest/145/C来源:牛客网 Bit Compression时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 262144K,其他语言524288KSpecial Judge, 64bit IO Format: %lld题目描述A binary string s of length N =...原创 2018-08-10 08:39:17 · 535 阅读 · 0 评论 -
CodeForces - 983B XOR-pyramid(两次区间DP/记忆化DFS)
B. XOR-pyramidtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFor an array bb of length mm we define the function ff asf(b)={b[1]if m=1f(b[1]⊕b[2]...原创 2018-06-07 10:16:22 · 402 阅读 · 0 评论