Submission #72575089

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <cstdint>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <fstream>
#include <cmath>
#include <limits>
#include <chrono>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
#include <cassert>
#include <random>
#include <bit>
#include <cstdint>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pl = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using mint=modint998244353;


int main(){
    vector<int> a={0,0,1,-1};
    vector<int> b={1,-1,0,0};
    ll h,w;
    cin>>h>>w;
    vector<string> z(h);
    rep(i,0,h){
        cin>>z[i];
    }
    vector<vector<ll>> d(h,vl(w,10000000000));
    queue<pair<ll,ll>> q;
    q.push(make_pair(0,0));
    d[0][0]=0;
    while(!q.empty()){
        pair<ll,ll> f=q.front();
        ll now=d[f.first][f.second]+1;
        rep(i,0,4){
            if(f.first+a[i]>=0&&f.first+a[i]<h&&f.second+b[i]>=0&&f.second+b[i]<w&&d[f.first+a[i]][f.second+b[i]]>now&&z[f.first+a[i]][f.second+b[i]]!=z[f.first][f.second]){
                q.push(make_pair(f.first+a[i],f.second+b[i]));
                d[f.first+a[i]][f.second+b[i]]=now;
            }
        }
        q.pop();
    }
    if(d[h-1][w-1]==10000000000)cout<<-1<<endl;
    else cout<<d[h-1][w-1]<<endl;
    return 0;
}

Submission Info

Judge Result