![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构_图_搜索
文章平均质量分 82
Jianbagengmu
换了id,换了我的人生的态度.
展开
-
hdu 1636 Invitation Cards //spfa 详解;
In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. The原创 2017-04-06 20:09:38 · 297 阅读 · 0 评论 -
hdu 1035
Robot Motion Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1035 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics N原创 2017-07-04 21:19:30 · 235 阅读 · 0 评论 -
hdu 2586
How far away ? Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2586 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics原创 2017-07-30 19:59:59 · 197 阅读 · 0 评论 -
Gym 100112H Horror List—深搜—bfs
It was time for the 7th Nordic Cinema Popcorn Convention, andthis year the manager Ian had a brilliant idea. In addition to thetraditional film program, there would be a surprise room where asmall g原创 2017-10-26 22:26:40 · 380 阅读 · 0 评论 -
zoj_3166_floyd_好久没打还翻车一次_丢人
Lazy Tourist Fat Murphy is really a lazy guy. When he goes out for sightseeing, only he cared about is to get back to the hotel which he stayed in as soon as possible. Taday is the Valentine’s day, Fa原创 2017-11-29 22:35:31 · 194 阅读 · 0 评论 -
计蒜客_King of the Waves_dfs
Translate 给你n,代表有0 n-1个人,给你n行,每行n个字符, 字符是X,i=j就是这个人在这个位置 1 代表,i人能赢j人当king 0代表输; 游戏规则是b 是king a能赢b a当king 问裁判按什么安排顺序0能当king //#include<bits/stdc++.h>#include<iostream>#include<vector>#include原创 2017-11-25 19:05:04 · 369 阅读 · 0 评论 -
HDU_4474_数位bfs——经典搜索
Yet Another Multiple ProblemThere are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s why we call it “Yet Another原创 2018-02-02 19:08:44 · 242 阅读 · 0 评论 -
poj—简单dfs输入坑
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th...原创 2018-03-07 22:07:25 · 337 阅读 · 0 评论 -
hdu_1242_bfs_或者记忆化dfs
Problem Description Angel 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, ROADs, and GUARDs in the prison.Angel’s原创 2018-02-28 12:45:30 · 246 阅读 · 0 评论 -
hdu_1240_3维bfs,注意搜索坐标
IntroductionYou'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原创 2018-03-01 13:25:42 · 317 阅读 · 0 评论 -
hdu 2079
选课时间(题目已修改,注意读题) Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 2079 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistic原创 2017-07-02 10:11:42 · 271 阅读 · 0 评论 -
分数
为了比较两个人的实力,帅气的张队长安排了n轮的比赛,在第i轮的比赛中,获胜的人可以获得2^i分,失败的人可以获得i分.现在给出两个人的分数,请你帮助张队长判断他们的分数是否是合理的?Input 首先输入一个t,代表t组数据.第一行输入两个整数a和b,代表第一个人的得分a和第二个人的得分b,接着输入一个数n,代表张队长一共安排了n轮的比赛.(1<=a,b<=2^20,1<=n<=20).Output原创 2017-05-21 19:13:36 · 269 阅读 · 0 评论 -
HDU 1010 深搜+剪枝
补充剪枝知识 曼哈顿距离请点链接 manhattan距离 奇偶剪枝 奇偶剪枝ii 或者直接看这两个百度百科介绍 Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 121013 Acce原创 2017-05-09 23:13:19 · 254 阅读 · 0 评论 -
最短路径问题 迪杰斯特拉
hdu 3790给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。(1<n<原创 2017-03-28 20:43:21 · 583 阅读 · 0 评论 -
hdu 1312Red and Black
dfs 水题wa两个小时,dfs 数据范围和map范围有偏差错了好久,真要认真,最近太浪了;There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile,原创 2017-04-03 21:17:50 · 418 阅读 · 0 评论 -
hdu 1241 Oil Deposits
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th原创 2017-04-03 22:01:31 · 270 阅读 · 0 评论 -
HDU1016:Prime Ring Problem(DFS)
dfs培养的是一种思维, 简单点来说用dfs做最短路一般会超时,所以更多会要是思维的训练Prime Ring Problem Time Limit: 2000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1016 64-bit integer IO format: %I64d Java原创 2017-05-13 19:37:44 · 168 阅读 · 0 评论 -
hdu 1175 连连看
市赛下铁很不开心,以后只专心程序,以后再也不会和某个人组队了,比个赛只会说 you can you up ,no can no bb的沙雕,我能怎么办,比自己强的各种佩服,和自己差不多,和比自己弱的一脸不屑,其实你打的代码是个卵子,全程ac代码都是我和另一个队友打得; 看人要深看 连连看 Time Limit: 10000msMemory Limit: 32768KB This problem原创 2017-05-14 15:28:54 · 201 阅读 · 0 评论 -
hdu1180 广搜 -
bfs 非常xjb搞一下,便利到下一个点都要看它能否走,看他是不是梯子; 处理梯子转的方式是很骚的;你一看就懂了,全网最简单代码 诡异的楼梯 Time Limit: 1000msMemory Limit: 65536KB This problem will be judged on HDU. Original ID: 1180 64-bit integer IO format: %I64d原创 2017-05-14 21:38:09 · 180 阅读 · 0 评论 -
A. 这是一道简单的水题~
A. 这是一道简单的水题~pbz最近沉浸在数学中无法自拔,他发现了一种非常有趣的数,这个数的十进制表示形式中只含有8和9,这个数有着很好的寓意,代表了pbz的梦想和期望,他想知道对于任意的给定的正整数N,有多少个正整数M使得N*M所得得数是pbz所想要的数。 Input 第一行给出一个T,表示有T组案例,每个测试用例由一行组成,每行输入一个正整数N(1<=N*M<=1e10)Output 对于原创 2017-05-25 23:16:00 · 345 阅读 · 0 评论 -
HDU 1072 Nightmare(搜索-DFS)
Nightmare Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1072 64-bit integer IO format: %I64d Java class name: Main Prev Submit Status Statistics Next转载 2017-05-16 19:20:10 · 183 阅读 · 0 评论 -
HDU1026:Ignatius and the Princess I(BFS)
Ignatius and the Princess I Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1026 64-bit integer IO format: %I64d Java class name: Main Special Judge Pr原创 2017-05-17 15:43:13 · 315 阅读 · 0 评论 -
hdu_1253_三维bfs
Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个.现在给你城堡的地图,请你计算出Igna原创 2018-03-01 18:46:44 · 213 阅读 · 0 评论