hdu 2312 Cliff Climbing (pfs)

Problem - 2312

　　一条很暴力，有点恶心的搜索。题意其实很简单，主要是pfs的时候拓展结点会有种麻烦的感觉。注意的是，这里的n和m跟平常见到的有所不同，交换过来了。我的代码就是在因为这个长宽的问题wa了一次。

代码如下：

 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <queue>
 #include <cctype>

 using namespace std;

 typedef pair<int, int> PII;
 typedef pair<PII, PII> PPP;
 typedef pair<int, PPP> PPPI;

 #define FI first
 #define SE second
 #define PRIQ priority_queue

 const int R = ;
 const int C = ;
 char mat[R][C];
 bool vis[R][C][R][C];
 int n, m;

 inline int dis(int a, int b, int c, int d) { return abs(a - c) + abs(b - d);}
 inline bool inmat(int a, int b) { return  <= a && a < n &&  <= b && b < m;}

 int work() {
     PRIQ<PPPI> Q;
     int nx, ny, cx, cy;
     memset(vis, , sizeof(vis));
     while (!Q.empty()) Q.pop();
     for (int i = ; i < n; i++) {
         for (int j = ; j < m; j++) {
             if (mat[i][j] != 'S') continue;
             for (int dx = -; dx <= ; dx++) {
                 nx = i + dx;
                 for (int dy = ; dy <= ; dy++) {
                     ny = j + dy;
                     if (inmat(nx, ny) && dis(i, j, nx, ny) <=  && mat[nx][ny] != 'X' && !vis[i][j][nx][ny]) {
                         if (isdigit(mat[nx][ny])) Q.push(PPPI((int) '' - mat[nx][ny], PPP(PII(i, j), PII(nx, ny))));
                         else Q.push(PPPI(, PPP(PII(i, j), PII(nx, ny))));
                         vis[i][j][nx][ny] = true;
 //                        cout << i << ' ' << j << ' ' << nx << ' ' << ny << endl;
                     }
                     ny = j - dy;
                     if (inmat(nx, ny) && dis(nx, ny, i, j) <=  && mat[nx][ny] != 'X' && !vis[nx][ny][i][j]) {
                         if (isdigit(mat[nx][ny])) Q.push(PPPI((int) '' - mat[nx][ny], PPP(PII(nx, ny), PII(i, j))));
                         else Q.push(PPPI(, PPP(PII(nx, ny), PII(i, j))));
                         vis[nx][ny][i][j] = true;
 //                        cout << nx << ' ' << ny << ' ' << i << ' ' << j << endl;
                     }
                 }
             }
         }
     }
 //    cout << "find S" << endl;
     while (!Q.empty()) {
         PPPI cur = Q.top();
         Q.pop();
         int v = cur.FI, a = cur.SE.FI.FI, b = cur.SE.FI.SE, c = cur.SE.SE.FI, d = cur.SE.SE.SE;
 //        cout << v << ' ' << a << ' ' << b << ' ' << c << ' ' << d << endl;
         if (mat[a][b] == 'T' || mat[c][d] == 'T') return -v;
         for (int dx = -; dx <= ; dx++) {
             nx = a + dx;
             cx = c + dx;
             for (int dy = ; dy <= ; dy++) {
                 ny = b + dy;
                 if (inmat(nx, ny) && dis(a, b, nx, ny) <=  && mat[nx][ny] != 'X' && !vis[a][b][nx][ny]) {
                     if (isdigit(mat[nx][ny])) Q.push(PPPI((int) '' - mat[nx][ny] + v, PPP(PII(a, b), PII(nx, ny))));
                     else Q.push(PPPI(v, PPP(PII(a, b), PII(nx, ny))));
                     vis[a][b][nx][ny] = true;
 //                    cout << nx << ' ' << ny << endl;
                 }
                 cy = d - dy;
                 if (inmat(cx, cy) && dis(cx, cy, c, d) <=  && mat[cx][cy] != 'X' && !vis[cx][cy][c][d]) {
                     if (isdigit(mat[cx][cy])) Q.push(PPPI((int) '' - mat[cx][cy] + v, PPP(PII(cx, cy), PII(c, d))));
                     else Q.push(PPPI(v, PPP(PII(cx, cy), PII(c, d))));
                     vis[cx][cy][c][d] = true;
 //                    cout << cx << ' ' << cy << endl;
                 }
             }
         }
     }
     return -;
 }

 int main() {
 //    freopen("in", "r", stdin);
 //    freopen("out", "w", stdout);
     while (cin >> m >> n && (n || m)) {
         char buf[];
         for (int i = ; i < n; i++) for (int j = ; j < m; j++) cin >> buf, mat[i][j] = buf[];
         cout << work() << endl;
     }
     return ;
 }

——written by Lyon