Submission #72574819

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=1005,INF=15<<26;

int dis[MAX][MAX];

vi dh={0,1,0,-1},dw={1,0,-1,0};

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int H,W;cin>>H>>W;
    vst S(H);
    for(int i=0;i<H;i++){
        cin>>S[i];
    }
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            dis[i][j]=INF;
        }
    }
    dis[0][0]=0;
    queue<pii> Q;
    Q.push(mp(0,0));
    while(!Q.empty()){
        auto [h,w]=Q.front();Q.pop();
        for(int k=0;k<4;k++){
            int toh=h+dh[k],tow=w+dw[k];
            if(toh<0||toh>=H||tow<0||tow>=W) continue;
            if(S[h][w]==S[toh][tow]) continue;
            if(chmin(dis[toh][tow],dis[h][w]+1)) Q.push(mp(toh,tow));
        }
    }
    
    if(dis[H-1][W-1]==INF) cout<<-1<<endl;
    else cout<<dis[H-1][W-1]<<endl;
}

Submission Info

Judge Result