Kuangbin专题一简单搜索

最新推荐文章于 2019-08-04 15:45:14 发布
最新推荐文章于 2019-08-04 15:45:14 发布
阅读量247 收藏
点赞数
分类专栏： Kuangbin 文章标签： 搜索
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_40379678/article/details/80953671
版权

kuangbin专题一简单搜索

棋盘问题 POJ - 1321

深搜题，注意的是剪枝——剩下的格子不够了就return。
单开两个一位数组记录挺方便，没有习惯性map。

#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, ll, nn) for(int i = (ll); i <= (nn); i++)
#define N 10

char maze[N][N];
int n, k, num;
char c;
int cnt;
bool ux[N], uy[N];

bool ok(int x, int y)
{
    return (!ux[x] && !uy[y] && maze[x][y] == '#');
}

void dfs(int x, int left)
{
    if(left == 0){
        cnt++;
        return;
    }

    if(n - x < left || x == n + 1) return;

    rep(j, 1, n){
        if(ok(x + 1, j)){
            ux[x + 1] = uy[j] = true;
            dfs(x + 1, left - 1);
            ux[x + 1] = uy[j] = false;
        }
    }

    dfs(x + 1, left);
}

int main()
{
    while(scanf("%d%d", &n, &k) != EOF && n > 0){
        rep(i, 1, n) rep(j, 1, n) cin >> maze[i][j];

        cnt = 0;
        dfs(0, k);

        printf("%d\n", cnt);
    }

    return 0;
}

Dungeon Master POJ - 2251

三维的宽搜，其他都是一样的裸的板子。

#include <queue>
#include <cstdio>
#include <iostream>
#include <utility>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, ll, nn) for(int i = (ll); i <= (nn); i++)
#define N 32

struct node{
  int x, y, z;

  node(int a = 1, int b = 1, int c = 1):x(a), y(b), z(c){}
};

int l, r, c;
char maze[N][N][N];
int sx, sy, sz, ex, ey, ez;
int ans;
queue<node> que;
bool used[N][N][N];
int dis[N][N][N];
int dx[] = {0, 0, 1, 0, 0, -1};
int dy[] = {0, 1, 0, 0, -1, 0};
int dz[] = {1, 0, 0, -1, 0, 0};

int bfs()
{
    memset(used, 0, sizeof used);
    memset(dis, 0, sizeof dis);
    while(!que.empty()) que.pop();
    int x, xx, y, yy, z, zz;
    node tmp;
    dis[sx][sy][sz] = 0;
    used[sx][sy][sz] = true;
    que.push(node(sx, sy, sz));

    while(!que.empty()){
        tmp = que.front();que.pop();
        x = tmp.x; y = tmp.y; z = tmp.z;

        if(x == ex && y == ey && z == ez){
            return dis[x][y][z];
        }

        rep(i, 0, 5){
            xx = x + dx[i];yy = y + dy[i];zz = z + dz[i];
            if(xx < 1 || yy < 1 || zz < 1) continue;
            if(xx > l || yy > r || zz > c) continue;
            if(used[xx][yy][zz] || maze[xx][yy][zz] == '#') continue;
            used[xx][yy][zz] = true;
            dis[xx][yy][zz] = dis[x][y][z] + 1;
            que.push(node(xx, yy, zz));
        }
    }

    return -1;
}

int main()
{
    freopen("date.txt", "r", stdin);
    char ch;
    while(scanf("%d%d%d", &l, &r, &c) != EOF && l){
        rep(i, 1, l) rep(j, 1, r) rep(k, 1, c){
            cin >> ch;
            if(ch == 'S'){
                sx = i; sy = j; sz = k;
            }
            else if(ch == 'E'){
                ex = i; ey = j; ez = k;
            }
            maze[i][j][k] = ch;
        }

//rep(i, 1, l) rep(j, 1, r) rep(k, 1, c) {
//    cout << maze[i][j][k];
//    if(k == c) cout << '\n';
//}
        ans = bfs();
        if(ans == -1) printf("Trapped!\n");
        else printf("Escaped in %d minute(s).\n", ans);
    }

    return 0;
}

Catch That Cow POJ - 3278

一维宽搜

#include <queue>
#include <cstdio>
#include <iostream>
#include <utility>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, ll, nn) for(int i = (ll); i <= (nn); i++)
#define N 100005

int n, k;
int sx, ex;
int ans;
queue<int> que;
bool used[N];
int dis[N];

int bfs()
{
    if(sx == ex) return 0;

    memset(used, 0, sizeof used);
    memset(dis, 0, sizeof dis);
    while(!que.empty()) que.pop();
    int x, xx;
    dis[sx] = 0;
    dis[ex] = 1000000000;
    used[sx] = true;
    que.push(sx);

    while(!que.empty()){
        x = que.front();que.pop();

        rep(i, 0, 2){
            if(i == 0) xx = x * 2;
            if(i == 1) xx = x + 1;
            if(i == 2) xx = x - 1;

            if(xx < 0 || used[xx]) continue;
            if(xx >= ex){
                dis[ex] = min(dis[ex], xx - ex + dis[x] + 1);
                continue;
            }

            used[xx] = true;
            dis[xx] = dis[x] + 1;
            que.push(xx);
        }
    }

    return dis[ex];
}

int main()
{
    //freopen("date.txt", "r", stdin);
    while(scanf("%d%d", &n, &k) != EOF){
        sx = n;ex = k;
        printf("%d\n", bfs());
    }

    return 0;
}

Fliptile POJ - 3279

这题还挺难好像，用二进制数来状态压缩显得很有逼格~~~
解决思想是先枚举第一行的翻法，然后第一行确定了下一行身不由己的要承担起把上一行变换成全白的责任，递推下去看最后一行是不是全白就ok了。
这题既然放在搜索里大概能用搜索写？以后试试。

#include <queue>
#include <cstdio>
#include <iostream>
#include <utility>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)
#define N 17
const int INF = 0x3f3f3f3f;
typedef long long ll;

int m, k, n, num;
int maze[N][N], ans[N][N], out[N][N];
int dx[] = {1, -1, 0, 0, 0};
int dy[] = {0, 0, 1, -1, 0};

int get(int x, int y)
{
    int cnt = maze[x][y];
    rep(i, 0, 4)cnt += ans[x + dx[i]][y + dy[i]];
    return cnt & 1;
}

int solve()
{
    rep(i, 2, m) rep(j, 1, k) ans[i][j] = get(i - 1, j);

    rep(j, 1, k) if(get(m, j)) return -1;

    int cnt = 0;
    rep(i, 1, m) rep(j, 1, k) cnt += ans[i][j];

    return cnt;
}

int main()
{
    //freopen("date.txt", "r", stdin);

    scanf("%d%d", &m, &k);

    rep(i, 1, m) rep(j, 1, k) scanf("%d", &maze[i][j]);

    n = 1 << k;
    num = INF;

    rep(i, 0, n - 1){
        memset(ans, 0, sizeof ans);
        rep(j, 0, k - 1) ans[1][k - j] = i >> j & 1;
        int cnt = solve();
        if(cnt >= 0 && num > cnt){
            num = cnt;
            memcpy(out, ans, sizeof ans);
        }
    }

    if(num == INF) printf("IMPOSSIBLE\n");
    else {
        rep(i, 1, m) rep(j, 1, k) printf("%d%c", out[i][j], j == k?'\n':' ');
    }

    return 0;
}

Find The Multiple POJ - 1426

输入一个数找到它的只有01的倍数。乍一看搜索量极其巨大，然则它的倍数是无限的然而01组成的数是少得多的，所以直接搜01组成的数判断是否是n的倍数就ok。

#include <queue>
#include <cstdio>
#include <iostream>
#include <utility>
#include <cstring>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)
#define N 17
const int INF = 0x3f3f3f3f;
typedef long long ll;

queue<ll> que;

ll solve(int n)
{
    while(!que.empty()) que.pop();
    que.push(1);
    while(true){
        ll tmp = que.front();que.pop();
        if(tmp % n == 0) return tmp;
        que.push(tmp * 10);
        que.push(tmp * 10 + 1);
    }
}

int main()
{
    int n;
    while(cin >> n && n){
        cout << solve(n) << endl;
    }
    return 0;
}

Shuffle’m Up POJ - 3087

昂模拟题，map，string大法好。

#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
#include <string>
using namespace std;
typedef pair<string, string> P;
#define N 101
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

string s1, s2, s12, t1, t2, t12;
int t, c, ans;
map<string, bool> mp;
int main()
{
    scanf("%d", &t);

    rep(Case, 1, t){
        mp.clear();

        scanf("%d", &c);
        cin >> s1 >> s2 >> s12;
        ans = 0;
        t1 = s1;t2 = s2;

        while(true){//printf("%s %s\n", t1, t2);
            ++ans;
            t12.clear();
            rep(i, 0, c - 1){
                t12 += t2[i];t12 += t1[i];
            }
//cout << t1 <<' ' << t2 << endl;
            if(t12 == s12){
                printf("%d %d\n", Case, ans);break;
            }
            else if(mp[t12]){
                printf("%d -1\n", Case);break;
            }

            t1.clear();t2.clear();
            rep(i, 0, c - 1) t1 += t12[i];
            rep(i, c, c * 2 - 1) t2 += t12[i];

            mp[t12] = true;
        }
    }

    return 0;
}

Pots POJ - 3414

记忆路径的宽搜

#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
#include <string>
#include <queue>
using namespace std;
typedef pair<int, int> P;
#define N 101
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

int a, b, c;
string op[6] = {"FILL(1)", "FILL(2)", "DROP(1)", "DROP(2)", "POUR(1,2)", "POUR(2,1)"};
struct opt{
   int d, pa, x, y, z;
   opt(int a = 0, int b = 0, int c = 0, int d = 0, int e = 0):d(a),pa(b),x(c),y(d),z(e){}
}path[N * N];
bool vis[N][N];

int bfs()
{
    int l = 0;
    path[l] = opt(0, -1, 0, 0);
    vis[0][0] = true;

    queue<opt> que;
    que.push(opt(1, l - 1, a, 0, 0));
    que.push(opt(1, l - 1, 0, b, 1));

    while(!que.empty()){
        path[l] = que.front();que.pop();
        opt & q = path[l];

        if(q.x == c || q.y == c){
            return l;
        }

        if(q.x != a && !vis[a][q.y]){
            vis[a][q.y] = true; que.push(opt(q.d + 1, l, a, q.y, 0));
        }
        if(q.y != b && !vis[q.x][b]){
            vis[q.x][b] = true; que.push(opt(q.d + 1, l, q.x, b, 1));
        }
        if(q.x != 0 && !vis[0][q.y]){
            vis[0][q.y] = true; que.push(opt(q.d + 1, l, 0, q.y, 2));
        }
        if(q.y != 0 && !vis[q.x][0]){
            vis[q.x][0] = true; que.push(opt(q.d + 1, l, q.x, 0, 3));
        }
        int k = min(q.x, b - q.y);
        if(k > 0 && !vis[q.x - k][q.y + k]){
            vis[q.x - k][q.y + k] = true;
            que.push(opt(q.d + 1, l, q.x - k, q.y + k, 4));
        }
        k = min(a - q.x, q.y);
        if(k > 0 && !vis[q.x + k][q.y - k]){
            vis[q.x + k][q.y - k] = true;
            que.push(opt(q.d + 1, l, q.x + k, q.y - k, 5));
        }

        l++;
    }

    return -1;
}

int main()
{
    cin >> a >> b >> c;

    int t = bfs();

    if(t == -1) printf("impossible\n");
    else{
        cout << path[t].d << endl;
        int ans[N * N], l = 0;
        ans[l++] = path[t].z;
        while(path[t].pa != -1){
            t = path[t].pa;
            ans[l++] = path[t].z;
           // cout << path[t].x << ' ' << path[t].y << endl;
        }
        for(int i = l - 2; i >= 0; i--)
            cout << op[ans[i]] << endl;
    }

    return 0;
}

Prime Path POJ - 3126

老老实实宽搜

#include <queue>
#include <cstdio>
#include <iostream>
#include <utility>
#include <cstring>
#include <vector>
#include <map>
using namespace std;
typedef pair<int, int> P;
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)
#define N 17
const int INF = 0x3f3f3f3f;
typedef long long ll;

bool pri[10000];
queue<P> que;
map<P, int> ans;
bool vis[10000];

int change(int s, int d, int to)
{
    if(d == 1) return (s / 10) * 10 + to;
    else if(d == 2) return (s / 100) * 100 + to * 10 + s % 10;
    else if(d == 3) return (s / 1000) * 1000 + to * 100 + s % 100;
    else return to * 1000 + s % 1000;
}

int solve(int s, int e)
{
    while(!que.empty()) que.pop();
    que.push(P(s, 0));
    P h;
    int t;
    vis[s] = true;

    while(!que.empty()){
        h = que.front();que.pop();
        if(h.first == e) return h.second;
        if(h.second > 10) continue;
        rep(i, 1, 4) rep(j, 0, 9) {
            t = change(h.first, i, j);
            if(t != h.first && pri[t] && t > 1000 && !vis[t]){
                vis[t] = true;
                que.push(P(t, h.second + 1));
            }
        }
    }
}

int main()
{
    int s, e, t;
    memset(pri, true, sizeof pri);

    rep(i, 2, 5000) if(pri[i]){
        for(int j = i * 2; j < 10000; j += i)
            pri[j] = false;
    }
//cout << pri[19] << endl;
    cin >> t;
    while(t--){
        cin >> s >> e;
        memset(vis, 0, sizeof vis);
        int ans = solve(s, e);
        if(ans == -1) printf("Impossible\n");
        else printf("%d\n", ans);
    }

    return 0;
}

Fire Game FZU - 2150

为了特殊的游戏要有合适的场地，要把草少了，要烧得快。枚举任意两个点来宽搜。


#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
#include <string>
#include <queue>
using namespace std;
typedef pair<int, int> P;
#define N 11
#define f first
#define s second
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

char maze[N][N];
int n, m;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int d[N][N];
bool vis[N][N];

int bfs(int x1, int y1, int x2, int y2)
{
    memset(d, 0, sizeof d);
    memset(vis, false, sizeof vis);
    queue<P> que;
    que.push(P(x1, y1));
    d[x1][y1] = 0;
    vis[x1][y1] = true;
    if(maze[x2][y2] == '#' && !vis[x2][y2]){
        que.push(P(x2, y2));
        d[x2][y2] = 0;
        vis[x2][y2] = true;
    }

    while(!que.empty()){
        P h = que.front(); que.pop();

        for(int i = 0; i < 4; i++){
            int x = h.f + dx[i], y = h.s + dy[i];
            if(x < 0 || x >= n || y < 0 || y >= m) continue;
            if(maze[x][y] == '.' || vis[x][y]) continue;
            vis[x][y] = true;
            que.push(P(x, y));
            d[x][y] = d[h.f][h.s] + 1;
        }
    }

    rep(i, 0, n - 1) rep(j, 0, m - 1) if(maze[i][j] == '#' && !vis[i][j]) return -1;
    int cnt = -1;
    rep(i, 0, n - 1) rep(j, 0, m - 1) cnt = max(cnt, d[i][j]);
    return cnt;
}

int main()
{
    int t;

    scanf("%d", &t);

    rep(Case, 1, t){
        scanf("%d%d", &n, &m);
        rep(i, 0, n - 1) scanf("%s", maze[i]);
        int ans = -1;
        rep(i, 0, n - 1) rep(j, 0, m - 1) rep(k, 0, n - 1) rep(l, 0, m - 1){
            if(maze[i][j] == '#' && maze[k][l] == '#'){
                int t = bfs(i, j, k, l);
                if(t >= 0 && (ans == -1 || ans > t)) ans = t;//cout << i << ' ' << j << ' ' << k <<' ' << l << endl;
            }
        }
        printf("Case %d: %d\n", Case, ans);
    }

    return 0;
}

Fire! UVA - 11624

分两次搜，第一次预处理出火烧的时间，第二次搜人。
mmp我把d初始化成-1最后比较的时候忘了特判。初始化INF就不会这样了。

#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
#include <string>
#include <queue>
using namespace std;
typedef pair<int, int> P;
#define N 1001
#define fi first
#define se second
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

int n, m, ans;
char maze[N][N];
int d[N][N], flee[N][N];
bool vis[N][N];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
queue<P> que;

void bfs(int tpe)
{
    memset(vis, false, sizeof vis);
    while(!que.empty()) que.pop();
    if(tpe == 1){
        memset(d, -1, sizeof d);
        rep(i, 0, n - 1) rep(j, 0, m - 1) if(maze[i][j] == 'F') {
            que.push(P(i, j)); d[i][j] = 0; vis[i][j] = true;
        }
    }
    else{
        ans = -1;  memset(flee, 0, sizeof flee);
        rep(i, 0, n - 1) rep(j, 0, m - 1) if(maze[i][j] == 'J'){
            que.push(P(i, j)); flee[i][j] = 0; vis[i][j] = true; break;
        }
    }

    while(!que.empty()){
        P h = que.front(); que.pop();

        if(tpe == 2)
        if(h.fi == 0 || h.fi == n - 1 || h.se == 0 || h.se == m - 1){//printf("x %d y %d\n", h.fi, h.se);
            ans = flee[h.fi][h.se] + 1; break;
        }

        rep(i, 0, 3){
            int x = h.fi + dx[i], y = h.se + dy[i];
            if(x < 0 || x >= n || y < 0 || y >= m) continue;
            if(maze[x][y] == '#' || vis[x][y]) continue;
            if(tpe == 2 && d[x][y] != -1 && flee[h.fi][h.se] + 1 >= d[x][y]) continue;

            if(tpe == 1) d[x][y] = d[h.fi][h.se] + 1;
            else flee[x][y] = flee[h.fi][h.se] + 1;
            vis[x][y] = true;
            que.push(P(x, y));
        }
    }
}

int main()
{
   // freopen("data.txt", "r", stdin);
    int t;

    scanf("%d", &t);

    while(t--){
        scanf("%d%d", &n, &m);
        rep(i, 0, n - 1) scanf("%s", maze[i]);

        bfs(1);//rep(i, 0, n - 1) rep(j, 0, m - 1) printf("%d%c", d[i][j], j == m - 1?'\n':' ');
        bfs(2);

        if(ans == -1) printf("IMPOSSIBLE\n");
        else printf("%d\n", ans);
    }

    return 0;
}

迷宫问题 POJ - 3984

宽搜记忆路径

#include <string>
#include <queue>
#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
#define N 5
#define fi first
#define se second
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

int maze[N][N];
P path[N][N];
int d[N][N];
queue<P> que;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

void bfs()
{
    memset(d, 0x3f, sizeof d);
    que.push(P(0, 0));
    d[0][0] = 0;

    while(!que.empty()){
        P h = que.front(); que.pop();

        if(h.fi == 4 && h.se == 4) return;

        rep(i, 0, 3){
            int x = h.fi + dx[i], y = h.se + dy[i];
            if(x < 0 || x >= N || y < 0 || y >= N) continue;
            if(maze[x][y] == 1) continue;
            if(d[x][y] <= d[h.fi][h.se] + 1) continue;

            d[x][y] = d[h.fi][h.se] + 1;
            path[x][y] = h;
            que.push(P(x, y));
        }
    }
}

int main()
{
    //freopen("data.txt", "r", stdin);
    rep(i, 0, 4) rep(j, 0, 4) scanf("%d", &maze[i][j]);

    bfs();
    P ans[N * N];
    int l = 0;
    ans[l++] = P(4, 4);
    int x = 4, y = 4;
    while(!(x == 0 && y == 0)){
        ans[l++] = path[x][y];
        x = ans[l - 1].fi; y = ans[l - 1].se;
    }
    for(int i = l - 1; i >= 0; i--)
        printf("(%d, %d)\n", ans[i].fi, ans[i].se);

    return 0;
}

Oil Deposits HDU - 1241

深搜求连通度。我第一道深搜题就是这个题型，亲切。

#include <string>
#include <queue>
#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
#define N 101
#define fi first
#define se second
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

char maze[N][N];
int n, m;
int cnt;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};

void dfs(int x, int y)
{
    maze[x][y] = '*';
    rep(i, 0, 7) {
        int xx = x + dx[i], yy = y + dy[i];
        if(xx < 0 || xx >= n || yy < 0 || yy >= m) continue;
        if(maze[xx][yy] == '*') continue;
        dfs(xx, yy);
    }
}

int main()
{
    //freopen("data.txt", "r", stdin);

    while(~scanf("%d%d", &n, &m) && n){
        rep(i, 0, n - 1) scanf("%s", maze[i]);

        cnt = 0;
        rep(i, 0, n - 1) rep(j, 0, m - 1) if(maze[i][j] == '@'){
            dfs(i, j);
            cnt++;
        }

        printf("%d\n", cnt);
    }

    return 0;
}

非常可乐 HDU - 1495

重复代码的复制要谨慎。。。

#include <string>
#include <queue>
#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
using namespace std;
//typedef pair<int, int> P;
#define N 101
#define fi first
#define se second
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

struct P{
  int a, b, c;
  P (int x=0, int y=0, int z=0):a(x), b(y), c(z){}
  bool judge(){
      return (a == b && c == 0) || (b == c && a == 0) || (c == a && b == 0);
  }
  bool operator < (P t) const{
      if(a == t.a) {
        if(b == t.b)
          return c < t.c;
        return b < t.b;
      }
      return a < t.a;
  }
};
map<P, int> d;
queue<P> que;

int bfs(int n, int m, int z)
{
    d.clear();
    while(!que.empty()) que.pop();
    int dif;

    que.push(P(n, 0, 0));
    d[P(n, 0, 0)] = 0;

    while(!que.empty()){
        P h = que.front(); que.pop();

        if(h.judge()) return d[h];
//if(n == 4)printf("%d %d %d\n", h.a, h.b, h.c);
        if(h.a != 0 && h.b < m){
            dif = min(h.a, m - h.b);
            P tmp = P(h.a - dif, h.b + dif, h.c);
            if(!d[tmp]) d[tmp] = d[h] + 1, que.push(tmp);
        }

        if(h.a != 0 && h.c < z){
            dif = min(h.a, z - h.c);
            P tmp = P(h.a - dif, h.b, h.c + dif);
            if(!d[tmp]) d[tmp] = d[h] + 1, que.push(tmp);
        }

        if(h.b != 0 && h.c < z){
            dif = min(h.b, z - h.c);
            P tmp = P(h.a, h.b - dif, h.c + dif);
            if(!d[tmp]) d[tmp] = d[h] + 1, que.push(tmp);
        }

        if(h.b != 0 && h.a < n){
            dif = min(n - h.a, h.b);
            P tmp = P(h.a + dif, h.b - dif, h.c);
            if(!d[tmp]) d[tmp] = d[h] + 1, que.push(tmp);
        }

        if(h.c != 0 && h.a < n){
            dif = min(h.c, n - h.a);
            P tmp = P(h.a + dif, h.b, h.c - dif);
            if(!d[tmp]) d[tmp] = d[h] + 1, que.push(tmp);
        }

        if(h.c != 0 && h.b < m){
            dif = min(h.c, m - h.b);
            P tmp = P(h.a, h.b + dif, h.c - dif);
            if(!d[tmp]) d[tmp] = d[h] + 1, que.push(tmp);
        }
    }

    return -1;
}

int main()
{
    //freopen("data.txt", "r", stdin);

    int a, b, c, ans;
    while(~scanf("%d%d%d", &a, &b, &c) && a + b + c){
        if((ans = bfs(a, b, c)) == -1) puts("NO");
        else printf("%d\n", ans);
    }

    return 0;
}

Find a way HDU - 2612

又是搜两次。

#include <string>
#include <queue>
#include <cstdio>
#include <cstring>
#include <utility>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
#define N 201
#define fi first
#define se second
#define rep(i, lll, nnn) for(int i = (lll); i <= (nnn); i++)

char maze[N][N];
P Y, M;
map<P, bool> mp;
int d1[N][N], d2[N][N];
bool vis[N][N];
queue<P> que;
int n, m;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

int bfs()
{
    while(!que.empty()) que.pop();
    memset(vis, false, sizeof vis);
    memset(d1, 0x3f, sizeof d1);
    que.push(Y);
    d1[Y.fi][Y.se] = 0;
    int cnt = 0;
    vis[Y.fi][Y.se] = true;
    while(!que.empty()){
        P h = que.front(); que.pop();
        if(mp[h]) cnt++;
        if(cnt == mp.size()) break;
        rep(i, 0, 3){
            int x = h.fi + dx[i], y = h.se + dy[i];
            if(x < 0 || x >= n || y < 0 || y >= m) continue;
            if(vis[x][y] || maze[x][y] == '#') continue;

            d1[x][y] = d1[h.fi][h.se] + 1;
            vis[x][y] = true;
            que.push(P(x, y));
        }
    }

    while(!que.empty()) que.pop();
    memset(vis, false, sizeof vis);
    memset(d2, 0x3f, sizeof d2);
    que.push(M);
    d2[M.fi][M.se] = 0;
    cnt = 0;
    vis[M.fi][M.se] = true;
    while(!que.empty()){
        P h = que.front(); que.pop();
        if(mp[h]) cnt++;
        if(cnt == mp.size()) break;
        rep(i, 0, 3){
            int x = h.fi + dx[i], y = h.se + dy[i];
            if(x < 0 || x >= n || y < 0 || y >= m) continue;
            if(vis[x][y] || maze[x][y] == '#') continue;

            d2[x][y] = d2[h.fi][h.se] + 1;
            vis[x][y] = true;
            que.push(P(x, y));
        }
    }

    map<P, bool>::iterator it;
    int ans = 9999999;
    for(it = mp.begin(); it != mp.end(); it++){
        if(!it->se) continue;
        int x = it->fi.fi, y = it->fi.se;
        ans = min(d1[x][y] + d2[x][y], ans);
    }
//printf("cnt %d\n", cnt);
//if(mp[P(0, 3)]) printf("%d %d\n", d1[0][3], d2[0][3]);
//if(mp[P(3, 0)]) printf("%d %d %d\n", d1[3][0], d2[3][0], (int)mp.size());
    return ans * 11;
}

int main()
{
   // freopen("data.txt", "r", stdin);

    while(~scanf("%d%d", &n, &m)){
        rep(i, 0, n - 1) scanf("%s", maze[i]);

        mp.clear();
        rep(i, 0, n - 1) rep(j, 0, m - 1) {
            if(maze[i][j] == 'Y') Y = P(i, j);
            else if(maze[i][j] == 'M') M = P(i, j);
            else if(maze[i][j] == '@') mp[P(i, j)] = 1;
        }

        printf("%d\n", bfs());
    }

    return 0;
}
叶子心情你不懂
关注
专栏目录
[kuangbin带你飞]专题一 简单搜索
Sega_hsj 's Blog
01-22 2560
简单搜索
kuangbin专题一 简单搜索 L - Oil Deposits
Unclebighead的博客
04-15 349
L - 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 gri...
BFS-POJ-3414-Pots
懒鬼的私人泳池
08-02 494
Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11798 Accepted: 4992 Special Judge DescriptionYou are given two pots, having the volume of A and B liters respectivel
kuangbin 简单搜索 J 双bfs
wtml
09-10 310
Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the
kuangbin 简单搜索 L题
wtml
09-06 260
L - Oil DepositsThe 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
kuangbin专题一 简单搜索
tgyy_cool的博客
04-07 189
Poj 1426 找出一个由1和0组成的十进制数m满足m为n的倍数。 有两种做法，一种是bfs从低位数往高位数搜，另一种是用二叉树数组的结构存每次的求出来的余数，当余数为0时返回下标，然后根据下标求出其对应的数。 1.bfs #include<cstdio> #include<queue> using namespace std; const int INF...
老鱼的-kuangbin专题题解
DeathYmz的博客
04-07 1445
kuangbin专题问题一览 专题一 简单搜索 POJ 1321 棋盘问题 POJ 2251 Dungeon Master POJ 3278 Catch That Cow POJ 3279 Fliptile POJ 1426 Find The Multiple POJ 3126 Prime Path POJ 3087 Shuffle’m Up POJ 3414 Pots FZU...
[kuangbin]专题一 简单搜索 Prime Path POJ - 3126【BFS】
inv0ker的博客
08-04 241
【题目描述】 The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter...
[kuangbin带你飞]专题一 简单搜索 -D - Fliptile
小明的博客
04-14 2710
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15)
【kuangbin专题一】简单搜索 （完整）
UPUP&TOPTOP
06-24 406
1. poj 1321 棋盘排列 类似八皇后 /* poj 1321 棋盘排列 类似八皇后的排列搜索。 */ #include <iostream> #include <cstdio> #include <cstring> using namespace std; typedef long long ll; int dp[11][11]; cha...
[kuangbin神带你飞]专题一 简单搜索
fisty
01-28 779
A － 棋盘问题 我的做法是从上到下，从左到右扫描，每次扫描到一个可用的棋盘（‘＃’），当前行和当前列都不能再有可用的棋盘（‘＃’），然后进入下一层并往后继续扫描，一旦扫描到k个可用的棋盘（‘＃’），就得到一种方案，递归得到所有的方案数即得到本题的解。 /*********************************************** * Author: fisty * Cr
[kuangbin带你飞]专题一 简单搜索 E - Find The Multiple
Amaswz的博客
04-16 557
E - Find The Multiple Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1426 Description Given a positive integer n, w
kuangbin [简单搜索专题]
裤头是叫裤头的裤头
05-17 328
A-棋盘问题 [POJ - 1321] #include #include #include #include #include #include #include #include #include using namespace std; int n,k; char mp[10][10]; int book[10]; int ans; void dfs(int n
kuangbin 专题一 简单搜索
keepcoral的博客
04-07 1118
A在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。 Input 输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*...
kuangbin专题 简单搜索（bfs+dfs) 个人题解
我都是乱写的
06-16 2099
VJ：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=80667#overview 出处：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=65959#overview   越写到后面越是顺手，1次AC的越来越多，并且英文题目也读的越来越顺，算是一种进步吧
kuangbin专题 搜索
wyxxzsy的博客
07-18 967
E 醉了，说有100位的十进制数，我想那会炸的啊，没想到啊，所有的答案都在long long范围内，那时候应该打个表看看 F bfs 水题 G 模拟题 怎么就搜索了？？没做 H bfs + 记录路径 怎么记录路径？记录每个点的前驱，像并查集那样向上跳，就是所求的路径。 但这里有一个问题，它要准确打印操作是什么 （我猜）就两个解决方法 1：记录下来  就结构体里多加点东西咯 ...
Kuangbin专题十匹配问题
叶子心情你不懂
10-07 4124
套班子灾区、、、板子在手天下我有、、、 A - Fire Net  HDU - 1045 Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a p...
Kuangbin专题十四数论基础
叶子心情你不懂
04-02 1907
A - Bi-shoe and Phi-shoe LightOJ - 1370 Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his studen...
Kuangbin专题十六KMP & 扩展KMP & Manacher(M~Z)
叶子心情你不懂
10-01 788
M - Substrings  HDU - 1238 You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any...
探索ACM竞赛核心算法：kuangbin模板解析
根据文件信息，压缩包中包含了一个PDF文件，该PDF文件可能详细介绍了kuangbin的ACM模板的使用方法、包含的算法和数据结构等内容。对于希望深入学习和应用该模板的选手来说，这是非常宝贵的参考资料。 通过上述内容...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值