HDU—2821 推箱子

HDU—2821 推箱子

添加链接描述
加油做哈

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int m, n, sum, stx, sty, iiii;
char s[30][30];
int vis[30][30], p[30][30], ans[20000], tt[30][30];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
inline void init() {
    sum = iiii = 0;
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
            tt[i][j] = vis[i][j] = 0;
}
inline void dd(int i, int j) {
    stx = i, sty = j;
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
            p[i][j] = vis[i][j];
}
int F(int i) {
    int ans = 1;
    while(i--)
        ans *= 2;
    return ans;
}
bool check(int xx, int yy) {
    if(xx >= 0 && yy >= 0 && xx < m && yy < n)
        return true;
    return false;
}
void dfs(int x, int y, int v = 0, int ii = 0, int flag = 0) {
    if(ii == sum) {
        printf("%d\n%d\n", stx, sty);
        for(int i = 0; i < v; i++)
            if(!ans[i])
                printf("U");
            else if(ans[i] == 1)
                printf("D");
            else if(ans[i] == 2)
                printf("L");
            else
                printf("R");
        cout<<'\n';
        iiii = 1;
        return;
    }
    for(int i = 0; i < 4; i++) {
        int xx = x + dir[i][0];
        int yy = y + dir[i][1];
        if(check(xx, yy) && !p[xx][yy]) {
            while(check(xx, yy) && !p[xx][yy])
                xx += dir[i][0], yy += dir[i][1];
            if(check(xx, yy)) {
                if(!flag) {
                    if((tt[xx][yy] | F(i)) == tt[xx][yy])
                        continue;
                    tt[xx][yy] |= F(i);
                }
                int aa = xx + dir[i][0];
                int bb = yy + dir[i][1];
                if(check(aa, bb)) {
                    int u = p[xx][yy], k = p[aa][bb];
                    p[aa][bb] += u - 1, p[xx][yy] = 0, ans[v] = i;
                    dfs(xx, yy, v + 1, ii + 1, 1);
                    p[xx][yy] = u, p[aa][bb] = k;
                } else {
                    int u = p[xx][yy];
                    p[xx][yy] = 0;
                    ans[v] = i;
                    dfs(xx, yy, v + 1, ii + u, 1);
                    p[xx][yy] = u;
                }
                if(iiii)
                    return;
            }
        }
    }
}
int main() {
    while(cin>>n>>m) {
        init();
        for(int i = 0; i < m; i++)
            scanf("%s", s[i]);
        for(int i = 0; i < m; i++)
            for(int j = 0; j < n; j++)
                if(s[i][j] != '.')
                    vis[i][j] = s[i][j] - 'a' + 1, sum += vis[i][j];
        for(int i = 0; i < m; i++)
            for(int j = 0; j < n; j++)
                if(!vis[i][j] && !iiii)
                    dd(i, j), dfs(i, j);
    }
    return 0;
}