洛谷杂选题

最新推荐文章于 2024-10-05 22:16:30 发布

旧梦一场568

最新推荐文章于 2024-10-05 22:16:30 发布

阅读量91

点赞数

文章标签：深度优先图论算法

本文链接：https://blog.csdn.net/qq_70577841/article/details/131715576

版权

A - 迷宫寻路（洛谷 - B3625 ）

就是一个dfs

#include <iostream>
#include <vector>
using namespace  std;
const int N = 110;
int n, m;
string g[N];
int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
bool st[N][N];
int t = 0;
void dfs(int x, int y) {
    if (x == n - 1 && y == m - 1) 
    { 
        t = 1;  return; 
        
    }
    for (int i = 0; i < 4; i++) {
        int a = dx[i] + x, b = dy[i] + y;
        if (a >= 0 && a < n && b >= 0 && b < m && !st[a][b]&&g[a][b] == '.') {
            st[a][b] = true;
            dfs(a, b);
    
        }
    }
}
int main() {
    cin >> n >> m; 
    for (int i = 0; i < n; i++)cin >> g[i];
    dfs(0, 0);
    if (t == 1)cout << "Yes" << endl;
    else cout << "No" << endl;
}

P1162 填涂颜色

先把外面的0 全部设为3 （dfs）然后再将所有0转为2 最后将3改为0

#include <iostream>
#include <vector>
using namespace  std;
const int N =  33;
int n, m;
int g[N][N];
int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
void dfs(int x, int y) {
    g[x][y] = 3;
    for (int i = 0; i < 4; i++) {
        int a = x + dx[i], b = y + dy[i];
        if (a >= 0 && a < n && b >= 0 && b < n && g[a][b] == 0) {
            dfs(a, b);
        }
    }
}
int main() {
    cin >> n; 
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> g[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        if (g[0][i] == 0)dfs(0, i);
        if (g[n - 1][i] == 0)dfs(n - 1, 0);
        if (g[n - 1][i] == 0)dfs(n - 1, i);
        if (g[i][n - 1] == 0)dfs(i, n - 1);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (g[i][j] == 0) {
                g[i][j] = 2;
            }
            else if (g[i][j] == 3)g[i][j] = 0;
        }
    }
     
   for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << g[i][j] << " ";
        }
        cout << endl;
    }
}

P1141 01迷宫

首先提前把所有位置的id 找出来并且将找到的连通块的数量放在arr[id]里

#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace  std;
const int N = 1010;
int n, m;
typedef pair<int, int> PII;
typedef pair<PII, int> PIII;
string g[N];
int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int f[N][N];
int arr[1000000+10];
int id;
void  dfs(int x, int y) {
    int res = 1;
    f[x][y] = id;
    queue<PII> q; q.push({ x,y });
    while (q.size()) {
        auto t = q.front(); q.pop();
        int a = t.first, b = t.second;
        for (int i = 0; i < 4; i++) {
            int x1 = dx[i] + a, y1 = dy[i] + b;
            if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < n && !f[x1][y1] && g[x1][y1] != g[a][b]) {
                q.push({ x1,y1 });
                f[x1][y1] =id;
                res++;
            }
        }
    }
    arr[id] = res;
}
int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> g[i];
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (f[i][j] ==0) {
                id++;
                dfs(i, j);
            }
        }
    }
    while (m--) {
        int a, b;
        cin >> a >> b;
        cout << arr[f[a - 1][b - 1]] << endl;
    }
}

P1135 奇怪的电梯

利用一个堆每次进入时就行最少的数量

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#define int long long 
using namespace std;
typedef pair<int, int> PII;
int n, a,b;
const int N = 310;
bool  st[N];
int arr[N];
int bfs() {
    priority_queue <PII, vector<PII>, greater<PII>> q; q.push({0,a});
    while (q.size()) {
        auto t = q.top(); q.pop();
        int ver = t.second, d = t.first;
        if (ver == b)return d;
        if (st[ver])continue;
        st[ver] = true;
        if (ver - arr[ver] > 0) {
            if (ver - arr[ver] == b)return d + 1;
            q.push({ d + 1,ver - arr[ver] });
        }
        if (ver + arr[ver] <= n) {
            if (ver + arr[ver] == b)return d + 1;
            q.push({ d + 1,ver + arr[ver] });
        }
    }
    return -1;
}
signed main() {
    cin >> n >> a >> b;
    for (int i = 1; i <= n; i++)cin >> arr[i];
    cout << bfs() << endl;
    
}

P1434 [SHOI2002] 滑雪

是一个记忆化搜索每次搜的时候都将最大能走远的值存一下

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
int n,m;
const int N=310;
int f[N][N];
int a[N][N];
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
int dfs(int i,int j){
    int &v=f[i][j];
    if(v!=-1)return v;
    v=1;
    for(int b=0;b<4;b++){
        int x=i+dx[b],y=j+dy[b];
        if(x>=1 && x<=n && y>=1 && y<=m &&a[x][y]<a[i][j]){
            v=max(v,dfs(x,y)+1);
        }
    }
    return v;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cin>>a[i][j];
    int res=0;
    memset(f,-1,sizeof f);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            res=max(res,dfs(i,j));
        }
    }

    cout<<res<<endl;    
}

P1057 [NOIP2008 普及组] 传球游戏

dp 做法首先肯定是只有左右这两边传过来所以只要利用这个条件就行然后初始化1为1 f[i][1]=1; 从0开始所以就是这样

#include<iostream>
#include <stack>
#include <queue>
#include <map>
#include <cstring>
#include <sstream>
#include <algorithm>
using namespace std;
#define int long long
typedef pair<int, int> PII;
const int N = 1e3+10;
int n, m;
int ans = 0;
int a[N][N][2];
int f[N][N];
signed main() {
	cin >> n >> m;
	f[0][1]= 1;
	for (int i = 1; i <= m; i++) {
		for (int j = 1; j <= n; j++) {
			int s,t;
			if (j == 1)s = f[i - 1][n];
			else s = f[i - 1][j - 1];
			if (j == n)t = f[i - 1][1];
			else t = f[i - 1][j + 1];
			f[i][j] += s + t;
		}
	}
	cout << f[m][1] << endl;
}

P1216 [USACO1.5] [IOI1994]数字三角形 Number Triangles

也是一个三角形的dp 每次在f[i][j] 只会从 f[i-1][j] 和 f[i-1][j-1]这个位置来所以利用·这个条件dp

#include<iostream>
#include <stack>
#include <queue>
#include <map>
#include <cstring>
#include <sstream>
#include <algorithm>
using namespace std;
#define int long long
typedef pair<int, int> PII;
const int N = 1e3+10;
int n, m;
int ans = 0;
int a[N][N];
int f[N][N];
void   dfs(int t,int last) {
	
}
signed main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= i; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			f[i][j] = a[i][j];
			f[i][j] += max(f[i - 1][j - 1], f[i - 1][j]);
		}
	}
	int s = 0;
	for (int i = 1; i <= n; i++)s = max(s, f[n][i]);
	cout << s << endl;
}

P1990 覆盖墙壁

这题在dp 需要考虑四种情况当 f[i-1] 的状态第一种为空第二种上面有,第三种下面有第四种满的所以就这样四种情况在f[i]的情况也是这四种怎么添加可以让f[i]为那四种情况输出就应是 f[i][3]满的这种情况

#include<iostream>
#include <stack>
#include <queue>
#include <map>
#include <cstring>
#include <sstream>
#include <algorithm>
using namespace std;
#define int  unsigned long long
typedef pair<int, int> PII;
const int N = 1000010,mod=10000;
int ans = 0;
int f[N][4];
signed main() {
	int n; cin >> n;
	f[1][3] = 1;
	f[1][0] = 1;
	for (int i = 2; i <= n; i++) {
		f[i][0] = f[i - 1][3]%mod;
		f[i][1] = (f[i - 1][0] + f[i - 1][2])%mod;
		f[i][2] = (f[i - 1][0] + f[i - 1][1])%mod;
		f[i][3] = (f[i - 1][2] + f[i - 1][1] + f[i - 1][3]+f[i-1][0])%mod;
	}
	cout << f[n][3] << endl;
}