水题！！！！！！(dij)

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using db = double;
struct node{
    int x,y,n_dis,drop;
    node(int a,int b,int c,int d): x(a),y(b),n_dis(c),drop(d){}
    bool operator<(const node &a)const{
        return n_dis>a.n_dis;
    }
};
const int N=1e3+10;
char mp[N][N];
int n,m,h;
int sx,sy,tx,ty;
int dis[N][N][3];
// map<node,bool> vis;
const int INF=1e9+10;
void solve(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            for(int k=0;k<=1;k++){
                dis[i][j][k]=INF;
            }
        }
    }
    priority_queue<node> pq;
    // dis[sx][sy][1]=0;
    pq.push(node(sx,sy,0,1));
    while(pq.size()){
        // node tmp=pq.top();
        auto [x,y,n_dis,drop]=pq.top();
        pq.pop();
        if(dis[x][y][drop]<=n_dis) continue;
        dis[x][y][drop]=n_dis;
        if(x==n) continue;
        if(drop){
            if(mp[x+1][y]=='#'){
                pq.push(node(x+1,y,n_dis+h+1,1));
                if(y-1>=1&&mp[x][y-1]!='#'){
                    if(dis[x][y-1][0]>n_dis+1){
                        pq.push(node(x,y-1,n_dis+1,0));
                    }
                }
                if(y+1<=m&&mp[x][y+1]!='#'){
                    if(dis[x][y+1][0]>n_dis+1){
                        pq.push(node(x,y+1,n_dis+1,0));
                    }
                }
            }else{
                pq.push(node(x+1,y,n_dis+1,1));
            }
        }else{
            if(mp[x+1][y]!='#'){
                pq.push(node(x+1,y,n_dis+1,1));
            }else{
                if(y-1>=1&&mp[x][y-1]!='#'){
                    if(dis[x][y-1][0]>n_dis+1){
                        pq.push(node(x,y-1,n_dis+1,0));
                    }
                }
                if(y+1<=m&&mp[x][y+1]!='#'){
                    if(dis[x][y+1][0]>n_dis+1){
                        pq.push(node(x,y+1,n_dis+1,0));
                    }
                }
            }
        }
    }
    int ans=INF;
    ans=min(ans,min(dis[tx][ty][0],dis[tx][ty][1]));
    if(ans==INF){
        cout<<-1<<'\n';
    }else{
        cout<<ans<<'\n';
    }
}
int main(){
    std::ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    cin>>n>>m>>h;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            // scanf("%c",&mp[i][j]);
            cin>>mp[i][j];
            if(mp[i][j]=='*'){sx=i,sy=j;}
            else if(mp[i][j]=='%'){tx=i,ty=j;}
        }
    }
    solve();
    return 0;
}