#include #include #include class counter_iterator{ private: int count; public: counter_iterator() : count(0){} counter_iterator(int n) : count(n){} bool operator==(const counter_iterator& rhs) const{ return count == rhs.count; } bool operator!=(const counter_iterator& rhs) const{ return count != rhs.count; } int& operator*(){ return count; } counter_iterator& operator++(){ ++count; return *this; } }; class loop{ private: int b, e; public: loop(int m) : b(0), e(m){} loop(int n, int m) : b(n), e(m){} counter_iterator begin() const{ return counter_iterator(b); } counter_iterator end() const{ return counter_iterator(e); } }; inline int index(int t, int x, int y, int p1, int p2){ return x + 101 * (y + 101 * (p1 + 10 * (p2 + 10 * t))); } inline bool isKadomatsu(int a, int b, int c){ if(a == b || b == c || c == a){return false;} if(b != std::max({a, b, c}) && b != std::min({a, b, c})){return false;} return true; } int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1}; int d[100][100][10][10]; int main(){ int W, H; scanf("%d %d", &W, &H); int map[100][100]; for(int i=0;i q; q.push(index(0, 0, 0, 0, map[0][0])); d[0][0][0][map[0][0]] = 0; while(!q.empty()){ int idx = q.front(); q.pop(); int x = idx % 101, y = idx / 101 % 101, p1 = idx / 101 / 101 % 10, p2 = idx / 101 / 101 / 10 % 10, t = idx / 101 / 101 / 10 / 10; // printf("%d %d %d %d %d\n", x, y, p1, p2, t); if(x == W-1 && y == H-1){printf("%d\n", t); return 0;} if(t == 10000){break;} for(int i=0;i<4;i++){ int nx = x + dx[i], ny = y + dy[i]; if(nx < 0 || nx >= W || ny < 0 || ny >= H){ continue; } if((t < 1 || isKadomatsu(p1, p2, map[ny][nx])) && t+1 < d[nx][ny][p2][map[ny][nx]]){ q.push(index(t+1, nx, ny, p2, map[ny][nx])); d[nx][ny][p2][map[ny][nx]] = t+1; } } } puts("-1"); }