結果
| 問題 | No.124 門松列(3) |
| ユーザー |
 jabee
|
| 提出日時 | 2023-03-30 12:12:49 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 35 ms / 5,000 ms |
| コード長 | 5,555 bytes |
| コンパイル時間 | 5,174 ms |
| コンパイル使用メモリ | 275,640 KB |
| 最終ジャッジ日時 | 2025-02-11 19:05:30 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 26 |
ソースコード
#include<bits/stdc++.h>#include <math.h>#include <algorithm>#include <iostream>#include <vector>#include <atcoder/all>#include <atcoder/dsu>#include <atcoder/segtree>#include <atcoder/lazysegtree>#include <atcoder/modint>#include <atcoder/scc>#include <chrono>#include <random>#include <cassert>#ifndef templete#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()//#include<boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;using namespace std;using namespace atcoder;//using atmint = modint998244353;using atmint = modint;using Graph = vector<vector<int>>;using P = pair<long long,long long>;//#pragma GCC optimize ("-O3")using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }//---------------------------------------------------------------------------------------------------template<int MOD> struct ModInt {static const int Mod = MOD; unsigned x; ModInt() : x(0) { }ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }int get() const { return (int)x; }ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }ModInt operator+(ModInt that) const { return ModInt(*this) += that; }ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }return ModInt(u); }bool operator==(ModInt that) const { return x == that.x; }bool operator!=(ModInt that) const { return x != that.x; }ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }};template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separatorT pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}// combination of paris for n com.aCb(h+w-2,h-1);};//typedef ModInt<1000000007> mint;typedef ModInt<998244353> mint;//typedef ModInt<1000000000> mint;Comb<mint, 2010101> com;//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));//vector dp(n+1,vector<ll>(n+1,0));std::random_device seed_gen;std::mt19937 engine(seed_gen());string ye = "Yes"; string no = "No"; string draw = "Draw";#endif // templete//---------------------------------------------------------------------------------------------------ll w,h;vector<vector<ll>>m;vector<ll>di = {0,1,0,-1};vector<ll>dj = {1,0,-1,0};vector<ll>dir_v = {0,1,2,3};bool ng(vector<ll>a){set<ll>st;rep(i,0,3)st.insert(a[i]);if(st.size() != 3)return true;if(a[1] == *st.begin() || a[1] == *st.rbegin()){return false;}return true;}void _main() {ll up,down,r,l;up = 3;down = 1;r = 0;l = 2;cin >> w >> h;m.resize(h);rep(i,0,h)m[i].resize(w);rep(i,0,h)rep(j,0,w)cin >> m[i][j];vector d(h,vector(w,vector<ll>(4,infl)));priority_queue<pair<ll,vector<ll>>,vector<pair<ll,vector<ll>>>,greater<pair<ll,vector<ll>>>>q;if(m[0][0] != m[1][0]){d[1][0][up] = 1;q.push({1,{1,0,up}});}if(m[0][0] != m[0][1]){d[0][1][l] = 1;q.push({1,{0,1,l}});}while(q.size()){ll dist = q.top().first;vector<ll>v = q.top().second;q.pop();ll i = v[0];ll j = v[1];ll from_dir = v[2];ll from_i = i + di[from_dir];ll from_j = j + dj[from_dir];if(d[i][j][from_dir] != dist)continue;rep(dir,0,4){ll ni = i + di[dir];ll nj = j + dj[dir];ll ndist = dist + 1;ll ndir = (dir + 2) % 4;if(ni < 0 || ni >= h || nj < 0 || nj >= w)continue;vector<ll>a;a.push_back(m[from_i][from_j]);a.push_back(m[i][j]);a.push_back(m[ni][nj]);if(ng(a))continue;if(chmin(d[ni][nj][ndir],ndist))q.push({ndist,{ni,nj,ndir}});}}ll ans = infl;rep(dir,0,4)chmin(ans,d[h-1][w-1][dir]);if(ans == infl)ans = -1;cout << ans << endl;}