东方-15-深度优先搜索-DFS

1.深搜基础

1802. 填涂颜色

正常版本

#include <bits/stdc++.h>
using namespace std;
int a[40][40];
bool b[40][40];
int n;
int fx[4] = {0,0,1,-1};
int fy[4] = {1,-1,0,0};
void dfs(int x, int y)
{
	b[x][y]=true;
	int tx,ty;
	for(int i=0; i<4; i++)
	{
		tx = x + fx[i];
		ty = y + fy[i];
		if(tx>=0&&tx<=n+1&&ty>=0&&ty<=n+1
		&&a[tx][ty]==0&&b[tx][ty]==false)
		{
			dfs(tx,ty);
		}
	}
}
int main()
{
	cin>>n;
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<=n; j++)
		{
			cin>>a[i][j];
		}
	}
	dfs(0,0);
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<=n; j++)
		{
			if((a[i][j]==0&&b[i][j]==true)||a[i][j]==1)
			{
				cout<<a[i][j]; 
			}
			else
			{
				cout<<"2";
			}
			cout<<" ";
		}
		cout<<endl;
	}
	
	return 0;
}

STL模板库版本

vector变成局部变量，如果遇到多次的输入图形，则需要重新初始化，才可继续使用，所以尽量变成全局变量，使用resize开空间。

#include <iostream>
#include <vector>
using namespace std;

void dfs(vector<vector<int>>& a, vector<vector<bool>>& b, int x, int y, int n) {
    b[x][y] = true;
    int tx, ty;
    int fx[4] = {0, 0, 1, -1};
    int fy[4] = {1, -1, 0, 0};

    for (int i = 0; i < 4; i++) {
        tx = x + fx[i];
        ty = y + fy[i];
        if (tx >= 0 && tx <= n + 1 && ty >= 0 && ty <= n + 1 && a[tx][ty] == 0 && !b[tx][ty]) {
            dfs(a, b, tx, ty, n);
        }
    }
}

int main() {
    int n;
    cin >> n;
    vector<vector<int>> a(n + 2, vector<int>(n + 2));
    vector<vector<bool>> b(n + 2, vector<bool>(n + 2, false));

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> a[i][j];
        }
    }

    dfs(a, b, 0, 0, n);

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i][j] == 0 && !b[i][j]) {
                cout << "2 ";
            } else {
                cout << a[i][j] << " ";
            }
        }
        cout << endl;
    }

    return 0;
}

vector全局变量版本

#include <iostream>
#include <vector>
using namespace std;

vector<vector<int>> a;
vector<vector<bool>> b;
int n;
int fx[4] = {0, 0, 1, -1};
int fy[4] = {1, -1, 0, 0};

void dfs(int x, int y) {
    b[x][y] = true;
    int tx, ty;
    for (int i = 0; i < 4; i++) {
        tx = x + fx[i];
        ty = y + fy[i];
        if (tx >= 0 && tx <= n + 1 && ty >= 0 && ty <= n + 1 && a[tx][ty] == 0 && !b[tx][ty]) {
            dfs(tx, ty);
        }
    }
}

int main() {
    cin >> n;
    a.resize(n + 2, vector<int>(n + 2, 0));
    b.resize(n + 2, vector<bool>(n + 2, false));

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> a[i][j];
        }
    }

    dfs(0, 0);

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i][j] == 0 && !b[i][j]) {
                cout << "2 ";
            } else {
                cout << a[i][j] << " ";
            }
        }
        cout << endl;
    }

    return 0;
}

2.最少步数的问题

3.回溯和路径打印

4.回溯与全排列

5.深搜综合

1440. 卫星照片

STL库版本

#include <iostream>
#include <vector>
using namespace std;

int n, m;
vector<vector<char>> photo;
vector<vector<bool>> visited;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};

void dfs(int x, int y, int& minX, int& maxX, int& minY, int& maxY) {
    visited[x][y] = true;
    minX = min(minX, x);
    maxX = max(maxX, x);
    minY = min(minY, y);
    maxY = max(maxY, y);

    for (int i = 0; i < 4; ++i) {
        int tx = x + dx[i];
        int ty = y + dy[i];
        if (tx >= 0 && tx < n && ty >= 0 && ty < m && photo[tx][ty] == '#' && !visited[tx][ty]) {
            dfs(tx, ty, minX, maxX, minY, maxY);
        }
    }
}

bool isRectangle(int minX, int maxX, int minY, int maxY) {
    for (int i = minX; i <= maxX; ++i) {
        for (int j = minY; j <= maxY; ++j) {
            if (photo[i][j] != '#')
                return false;
        }
    }
    return true;
}

int main() {
    cin >> n >> m;
    photo.resize(n, vector<char>(m));
    visited.resize(n, vector<bool>(m, false));

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> photo[i][j];
        }
    }

    int barns = 0, cows = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (photo[i][j] == '#' && !visited[i][j]) {
                int minX = n, maxX = 0, minY = m, maxY = 0;
                dfs(i, j, minX, maxX, minY, maxY);
                if (isRectangle(minX, maxX, minY, maxY))
                    barns++;
                else
                    cows++;
            }
        }
    }

    cout << barns << endl;
    cout << cows << endl;
    return 0;
}

1913. 拯救指挥部

STL库版本

#include <bits/stdc++.h>
using namespace std;

int n, m, sum;
vector<vector<char>> a;
vector<vector<bool>> b;

int fx[4] = {0, 0, 1, -1};
int fy[4] = {1, -1, 0, 0};

void dfs(int x, int y)
{
	b[x][y] = true;
	for (int i = 0; i < 4; i++)
	{
		int tx = x + fx[i];
		int ty = y + fy[i];
		if (tx >= 0 && tx <= n + 1 && ty >= 0 && ty <= m + 1 && a[tx][ty] == '0' && b[tx][ty] == false)//这里是n+1，上边0 下边n+1 左边0 右边m+1 
		{
			dfs(tx, ty);
		}
	}
}

int main()
{
	cin >> n >> m;
	a.resize(n + 2, vector<char>(m + 2, '0'));
	b.resize(n + 2, vector<bool>(m + 2, false));
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin >> a[i][j];
		}
	}
	
	dfs(0, 0);
	
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			if (a[i][j] == '0' && !b[i][j])
			{
				sum++;
			}
		}
	}
	cout << sum << endl;
	return 0;
}

1379. 素数分解

STL模板库版本

#include <iostream>
using namespace std;

// 判断是否为素数的函数
bool isPrime(int num) {
    if (num < 2) return false;
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) return false;
    }
    return true;
}

// DFS函数，尝试分解n为素数之和
void dfs(int n, int lastPrime, int count, int& maxCount) {
    if (n == 0) {
        maxCount = max(maxCount, count);
        return;
    }

    // 开始寻找下一个更大的素数
    for (int nextPrime = lastPrime; nextPrime <= n; ++nextPrime) {
        if (isPrime(nextPrime)) {
            dfs(n - nextPrime, nextPrime + 1, count + 1, maxCount); // 传入 nextPrime + 1
        }
    }
}

int main() {
    int n;
    cin >> n;

    int maxCount = 0;
    dfs(n, 2, 0, maxCount); // 从2开始搜索

    cout << maxCount << endl;
    return 0;
}