1、迷宫搜索实践1
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<string>
using namespace std;
int n, m;
string maze[110];
bool vis[110][110];
bool in(int x, int y)
{
return 0 <= x && x < n && 0 <= y && y < m;
}
bool dfs(int x, int y)
{
if (maze[x][y] == 'T')
{
return true;//若访问到终点 直接返回
}
vis[x][y] = 1;//将访问过的位置标记为1
maze[x][y] = 'm';//将走过的路径标记为m
int tx = x - 1, ty = y;//对于数组来说 向上走一步
if (in(tx, ty) && maze[tx][ty] != '*' && !vis[tx][ty])
{
//若在地图中 并且 不是墙的位置 并且 没有被访问过
if (dfs(tx, ty))
{
return true;//若能搜出来就返回 true
}
}
tx = x, ty = y - 1;//向左走一步
if (in(tx, ty) && maze[tx][ty] != '*' && !vis[tx][ty])
{
if (dfs(tx, ty))
{
return true;
}
}
tx = x + 1, ty = y;//向下走
if (in(tx, ty) && maze[tx][ty] != '*' && !vis[tx][ty])
{
if (dfs(tx, ty))
{
return true;
}
}
tx = x, ty = y + 1;//向右走
if (in(tx, ty) && maze[tx][ty] != '*' && !vis[tx][ty])
{
if (dfs(tx, ty))
{
return true;
}
}
vis[x][y] = 0;//若找不到 恢复标记
maze[x][y] = '.';
return false;
}
int main()
{
//输入迷宫地图
cin >> n >> m;
for (int i = 0; i < n; i++)
{
cin >> maze[i];
}
int x, y;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (maze[i][j] == 'S')//先找到起始点 S
{
x = i, y = j;
}
}
}
if (dfs(x, y))
{
for (int i = 0; i < n; i++)
{
cout << maze[i] << endl;
}
}
else
{
cout << "No" << endl;
}
return 0;
}
2、迷宫搜索实践2(减少代码量)
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<string>
using namespace std;
int n, m;
string maze[110];
bool vis[110][110];
int dir[4][2] = { {-1,0},{0,-1},{1,0},{0,1} };//上 左 下 右
bool in(int x, int y)
{
return 0 <= x && x < n && 0 <= y && y < m;
}
bool dfs(int x, int y)
{
if (maze[x][y] == 'T')
{
return true;
}
vis[x][y] = 1;
maze[x][y] = 'm';
for (int i = 0; i < 4; i++)
{
int tx = x + dir[i][0];
int ty = y + dir[i][1];
if (in(tx, ty) && maze[tx][ty] != '*' && !vis[tx][ty])
{
if (dfs(tx, ty))
{
return true;
}
}
}
vis[x][y] = 0;
maze[x][y] = '.';
return false;
}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++)
{
cin >> maze[i];
}
int x, y;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (maze[i][j] == 'S')
{
x = i, y = j;
}
}
}
if (dfs(x, y))
{
for (int i = 0; i < n; i++)
{
cout << maze[i] << endl;
}
}
else
{
cout << "No" << endl;
}
return 0;
}
3、中国象棋
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
char s[10][10];
int dir[8][2] = { {2,1},{1,2},{-1,2},{-2,1},{-2,-1},{-1,-2},{1,-2},{2,-1} };
bool vis[10][10];
bool f;
bool in(int x, int y)
{
return 0 <= x && x < 10 && 0 <= y && y < 9;
}
void dfs(int x,int y)
{
vis[x][y] = true;//标记走过的位置
if (f)
{
return;//如果找到了一条路就可以不用再找了,直接return
}
if (s[x][y] == 'T')
{
f = true;
return;
}
for (int i = 0; i < 8; i++)
{
int tx = x + dir[i][0];
int ty = y + dir[i][1];
if (in(tx, ty) && s[tx][ty] != '#' && !vis[tx][ty])
{
dfs(tx, ty);
}
}
}
int main()
{
int x, y;
for (int i = 0; i < 10; i++)
{
scanf("%s", s[i]);
}
for (int i = 0; i < 10; i++)
{
for (int j = 0; j < 9; j++)
{
if (s[i][j] == 'S')
{
x = i;
y = j;
}
}
}
dfs(x, y);
if (f)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
}
4、迷宫最短路径
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<string>
using namespace std;
int n, m;
string maze[110];
bool vis[110][110];
int dir[4][2] = { {-1,0},{0,-1},{1,0},{0,1} };
int ans = 1000000000;
bool in(int x, int y)
{
return 0 <= x && x < n && 0 <= y && y < m;
}
void dfs(int x, int y, int step)
{
if (maze[x][y] == 'T')
{
if (step < ans)
{
ans = step;
}
return;
}
vis[x][y] = 1;
for (int i = 0; i < 4; i++)
{
int tx = x + dir[i][0];
int ty = y + dir[i][1];
if (in(tx, ty) && maze[tx][ty] != '*' && !vis[tx][ty])
{
dfs(tx, ty, step + 1);
}
}
vis[x][y] = 0;
}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++)
{
cin >> maze[i];
}
int x, y;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (maze[i][j] == 'S')
{
x = i;
y = j;
}
}
}
dfs(x, y, 0);
cout << ans << endl;
return 0;
}
5、踏青
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
char mp[105][105];
bool vis[105][105];
int n, m;
void dfs(int x, int y)
{
if (x < 0 || x >= n || y < 0 || y >= m || vis[x][y] || mp[x][y] == '.')
{
return;
}
vis[x][y] = true;
dfs(x - 1, y);//上
dfs(x + 1, y);//下
dfs(x, y - 1);//左
dfs(x, y + 1);//右
}
int main()
{
int cnt = 0;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", mp[i]);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (!vis[i][j] && mp[i][j] == '#')
{
dfs(i, j);
cnt++;//草丛数量
}
}
}
printf("%d\n", cnt);
return 0;
}
6、迷宫解方案数
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
int n, m, x, y, ans;
char mp[15][15];
bool vis[15][15];
void dfs(int x, int y)
{
if (x < 0 || x >= n || y < 0 || y >= m || vis[x][y] || mp[x][y] == '#')
{
return;
}
if (mp[x][y] == 'e')
{
ans++;
return;
}
vis[x][y] = true;
dfs(x - 1, y);//上
dfs(x + 1, y);//下
dfs(x, y - 1);//左
dfs(x, y + 1);//右
vis[x][y] = false;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", mp[i]);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (mp[i][j] == 'S')
{
x = i;
y = j;
}
}
}
dfs(x, y);
printf("%d\n", ans);
return 0;
}
7、最大的蛋糕块
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
int n, m, cnt, ans;
char mp[1005][1005];
bool vis[1005][1005];
void dfs(int x, int y)
{
if (x < 0 || x >= n || y < 0 || y >= m || vis[x][y] || mp[x][y] == '.')
{
return;
}
vis[x][y] = true;
cnt++;
dfs(x - 1, y);
dfs(x + 1, y);
dfs(x, y - 1);
dfs(x, y + 1);
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", mp[i]);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (!vis[i][j] && mp[i][j] == '#')
{
cnt = 0;
dfs(i, j);
if (cnt > ans)
{
ans = cnt;
}
}
}
}
printf("%d\n", ans);
return 0;
}
8、家谱
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
#include<vector>
using namespace std;
vector<int> son[100005];
bool f[100005];//寻根
int ans[100005];
int dfs(int u)
{
int ret = 0;
for (int i = 0; i < son[u].size(); i++)
{
ret += dfs(son[u][i]);
}
ans[u] = ret;
return ret + 1;
}
int main()
{
int n, x, y, u;
scanf("%d", &n);
for (int i = 0; i < n - 1; i++)
{
scanf("%d%d", &x, &y);
son[x].push_back(y);
f[y] = true;//将儿子标记,有指向的不为根
}
for (int i = 1; i <= n; i++)
{
if (!f[i])//若未被标记过
{
u = i;//找到起始位置
break;
}
}
dfs(u);
for (int i = 1; i <= n; i++)
{
printf("%d\n", ans[i]);
}
return 0;
}
9、马的覆盖点
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
char s[105][105];
int n, m;
int dir[8][2] = { {2,1},{1,2},{-1,2},{-2,1},{-2,-1},{-1,-2},{1,-2},{2,-1} };
void dfs(int x, int y, int step)
{
if (step > 3)
{
return;
}
if (x < 0 || x >= n || y < 0 || y >= m)
{
return;
}
s[x][y] = '#';
for (int i = 0; i < 8; i++)
{
dfs(x + dir[i][0], y + dir[i][1], step + 1);
}
}
int main()
{
int x, y;
scanf("%d%d%d%d", &n, &m, &x, &y);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
s[i][j] = '.';
}
}
dfs(x - 1, y - 1, 0);
for (int i = 0; i < n; i++)
{
printf("%s\n", s[i]);
}
return 0;
}
10、王子救公主
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>
char mp[105][105];
bool vis[105][105][2];
int n, m;
void dfs(int x, int y, int d)
{
if (x < 0 || x >= n || y < 0 || y >= m || vis[x][y][d] || mp[x][y] == '#')
{
return;
}
vis[x][y][d] = true;
dfs(x - (2 - d), y, d);
dfs(x + (2 - d), y, d);
dfs(x, y - (2 - d), d);
dfs(x, y + (2 - d), d);
}
int main()
{
int x, y;
bool ans;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", mp[i]);
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (mp[i][j] == 'w')
{
x = i;
y = j;
}
}
}
dfs(x, y, 0);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (mp[i][j] == 'g')
{
x = i;
y = j;
}
}
}
dfs(x, y, 1);
ans = false;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
if (vis[i][j][0] && vis[i][j][1])
{
ans = true;
}
}
}
if (ans)
{
printf("yes\n");
}
else
{
printf("no\n");
}
return 0;
}
11、开公司
#define _CRT_SECURE_NO_WARNINGS 1
#include<cstdio>;
int task[15][15];
bool used[15];
int ans;
int n;
void dfs(int x,int t)
{
if (x == n)
{
if (t < ans)
{
ans = t;
}
return;
}
for (int i = 0; i < n; i++)
{
if (!used[i])
{
used[i] = true;
dfs(x + 1, t + task[x][i]);
used[i] = false;
}
}
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
scanf("%d", &task[i][j]);
}
}
ans = 20000;
dfs(0,0);
printf("%d\n", ans);
return 0;
}