一、搜索简述和BFS
搜索
枚举的升级,列出所有的状态
枚举【自由转移】——>搜索【不自由转移】
广度优先代码实现
优先转移到所有的邻居
采用辅助队列:
1)将起始点加入队列
2)循环【队列非空】
a.取出front 修改isvisit
b.front的所有邻居加入队列(排除已经visited)
c.访问front
用法:求最优解
二、题目
1.catch the cow
描述:
杰森像捉到一只牛。他的起始位置在点N(0<=N<=1000000),牛在点K(0<=K<=100000)[他们在同一条线上],杰森有两种方式:走和传送
走:在一分钟内可以从X走到X-1或者从X走到X+1
传送:在一分钟内可以从X走到2*X
牛不知道他跑了,所以不会移动
问:杰森要花多少时间才能找到这头牛
#include<cstdio>
#include<queue>
using namespace std;
struct Info {
int pos;
int time;
};
int main() {
int n, k;
scanf_s("%d%d", &n, &k);
queue<Info>postQueue;
bool isvisit[1000001];
for (int i = 0; i < 1000001; i++) {
isvisit[i] = false;
}
//把起始点加入到队列中
Info first;
first.pos = n;
first.time = 0;
postQueue.push(first);
while (postQueue.empty() == false) {
Info cur = postQueue.front();
postQueue.pop();
if (cur.pos == k) {
printf("%d\n", cur.time);
break;
}
isvisit[cur.pos] = true;
//把邻居加入到队列中
Info neighbour;
if (cur.pos - 1 >= 0 && cur.pos - 1 <= 100000 && isvisit[cur.pos - 1] == false) {
neighbour.pos = cur.pos - 1;
neighbour.time = cur.time + 1;
postQueue.push(neighbour);
}
if (cur.pos + 1 >= 0 && cur.pos + 1 <= 100000 && isvisit[cur.pos + 1] == false) {
neighbour.pos = cur.pos + 1;
neighbour.time = cur.time + 1;
postQueue.push(neighbour);
}
if (cur.pos * 2 >= 0 && cur.pos * 2 <= 100000 && isvisit[cur.pos * 2] == false) {
neighbour.pos = cur.pos * 2;
neighbour.time = cur.time + 1;
postQueue.push(neighbour);
}
}
}
2、find the multiple
描述:
输入一个不超过200的数 n,然后求得一个数字k,数字满足:能被n整除,每一位只有0,1。这样的数字k会有很多个,然以输出一个就可以。
题解思路:
列出由0和1组成的数字
/100
10
/ \101
1
\ /110
11
\111
所以可以用广度优先遍历才生成这些数字
#include<cstdio>
#include<queue>
using namespace std;
int main() {
int n;
while (true) {
scanf_s("%d", &n);
if (n == 0) {
break;
}
queue<long long>m;
m.push(1);
while (m.empty() == false) {
long long cur = m.front();
m.pop();
if (cur % n == 0) {
printf("%lld\n", cur);
break;
}
m.push(cur * 10);
m.push(cur * 10 + 1);
}
}
}
OJ有毒或者超时
打表
#include<cstdio>
int main() {
long long arr[201] = {0, 1,10,111,100,10,1110,1001,1000,111111111,10,11,11100,1001,10010,1110,10000,11101,1111111110,11001,100,10101,110,110101,111000,100,10010,1101111111,100100,1101101,1110,111011,100000,111111,111010,10010,11111111100,111,110010,10101,1000,11111,101010,1101101,1100,1111111110,1101010,10011,1110000,1100001,100,100011,100100,100011,11011111110,110,1001000,11001,11011010,11011111,11100,100101,1110110,1111011111,1000000,10010,1111110,1101011,1110100,10000101,10010,10011,111111111000,10001,1110,11100,1100100,1001,101010,10010011,10000,1111111101,111110,101011,1010100,111010,11011010,11010111,11000,11010101,1111111110,1001,11010100,10000011,100110,110010,11100000,11100001,11000010,111111111111111111,100,101,1000110,11100001,1001000,101010,1000110,100010011,110111111100,1001010111,110,111,10010000,1011011,110010,1101010,110110100,10101111111,110111110,100111011,111000,11011,1001010,10001100111,11101100,1000,11110111110,11010011,10000000,100100001,10010,101001,11111100,11101111,11010110,11011111110,11101000,10001,100001010,110110101,100100,10011,100110,1001,1111111110000,11011010,100010,1100001,11100,110111,11100,1110001,11001000,10111110111,10010,1110110,1010100,10101101011,100100110,100011,100000,11101111,11111111010,1010111,1111100,1111110,1010110,11111011,10101000,10111101,111010,1111011111,110110100,1011001101,110101110,100100,110000,100101111,110101010,11010111,11111111100,1001111,10010,100101,110101000,1110,100000110,1001011,1001100,1010111010111,110010,11101111,111000000,11001,111000010,101010,110000100,1101000101,1111111111111111110,111000011,1000 };
int n;
while (true) {
scanf_s("%d", &n);
if (n == 0) {
break;
}
printf("%lld\n", arr[n]);
}
}