AOJ 558 Cheese(bfs)

题意：网格图，老鼠吃奶酪，吃完奶酪体力值会增加，只能吃硬度不大于体力值的，问最小步数。

思路：按硬度从小到大的吃起，依次求最短路。

我用曼哈顿距离估价的A*，和普通bfs的time没区别啊，还把优先级那里写错了。。。

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

#define PS push
#define PB push_back
#define MP make_pair
#define fi first
#define se second
const int INF = 0x3f3f3f3f;

typedef long long ll;

inline int read()
{
    int ret; char c; while(c = getchar(),c<''||c>'');
    ret = c-'';
    while(c = getchar(),c>=''&&c<='') ret = ret* + c-'';
    return ret;
}

const int SZ = 1e3+;

char g[SZ][SZ];
int H,W,N;
int vis[SZ][SZ],clk;
struct Node
{
    int x,y,f,h;
    bool operator <(const Node&th) const {
        return f > th.f || ( f == th.f && h < th.h);//
    }
}pos[];

int tar;
inline int MHT(Node &o)
{
    return (abs(pos[tar].x-o.x) + abs(pos[tar].y-o.y));
}

void GetPos()
{
    REP0(i,H){
        REP0(j,W){
            char c = g[i][j];
            if(c == 'S'){
                pos[] = {i,j};
            }else if(''<= c && c <='' ){
                pos[c-''] = {i,j};
            }
        }
    }
}

const int dx[] = {,,,-};
const int dy[] = {,,-,};

inline bool valid(int x,int y)
{
    return x>=&&x<H&&y>=&&y<W&&g[x][y]!='X'&&vis[x][y] != clk;
}

int astar_bfs(int st)
{
    priority_queue<Node> q;
    Node u;
    u.x = pos[st].x;
    u.y = pos[st].y;
    u.h = u.f = MHT(u);
    q.push(u);
    clk++;
    while(q.size()){
        u = q.top(); q.pop();
        if(u.x == pos[tar].x && u.y == pos[tar].y ) return u.f-u.h;
        REP0(k,){
            Node v;
            v.x = u.x + dx[k];
            v.y = u.y + dy[k];
            if(!valid(v.x,v.y)) continue;
            vis[v.x][v.y] = clk;
            v.h = MHT(v);
            v.f = u.f-u.h++v.h;
            q.push(v);
        }
    }
    return -;
}

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    H = read(); W = read(); N = read();
    for(int i = ; i < H; i++){
        scanf("%s",g[i]);
    }
    GetPos();
    int ans = ;
    REP1(i,N){
        tar = i;
        ans += astar_bfs(i-);
    }
    printf("%d\n",ans);
    return ;
}