結果

問題 No.124 門松列(3)
ユーザー raven7959
提出日時 2022-12-13 12:37:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 4 ms / 5,000 ms
コード長 3,686 bytes
コンパイル時間 2,900 ms
コンパイル使用メモリ 219,704 KB
最終ジャッジ日時 2025-02-09 10:54:27
ジャッジサーバーID
（参考情報） 		judge4 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvc = vector<vector<char>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
const int INF = 1e9;
const ll LINF = 2e18;
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;
}
bool ispow2(int i) { return i && (i & -i) == i; }
bool ispow2(ll i) { return i && (i & -i) == i; }
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < int(v.size()) - 1) os << ' ';
    }
    return os;
}
static uint32_t RandXor(){
    static uint32_t x=123456789;
    static uint32_t y=362436069;
    static uint32_t z=521288629;
    static uint32_t w=88675123;
    uint32_t t;
 
    t=x^(x<<11);
    x=y; y=z; z=w;
    return w=(w^(w>>19))^(t^(t>>8));
}
static double Rand01(){
    return (RandXor()+0.5)*(1.0/UINT_MAX);
}
void solve(){
    using T=tuple<int,int,int,int>;
    int H,W;
    cin>>W>>H;
    vvi F(H,vi(W));
    cin>>F;
    vvvi D(H,vvi(W,vi(5,INF))); // LURDX
    D[0][0][4]=0;
    queue<T> Q; // h,w,dist,pm
    Q.emplace(0,0,0,4);
    vi dh={0,-1,0,1,0,-1,0,1},dw={-1,0,1,0,-1,0,1,0};
    auto inside=[&](int h,int w)->bool{
        return 0<=h && h<H && 0<=w && w<W;
    };
    while(!Q.empty()){
        auto [h,w,dist,pm]=Q.front();
        Q.pop();
        if(D[h][w][pm]<dist) continue;
        rep(move,4){
            int nh=h+dh[move],nw=w+dw[move];
            if(!inside(nh,nw)) continue;
            if(pm!=4){
                int x=h,y=w,pn=F[h][w],ppn;
                x+=dh[pm+2];
                y+=dw[pm+2];
                ppn=F[x][y];
                if(F[nh][nw]==pn || pn==ppn || ppn==F[nh][nw]) continue;
                vi tmp={F[nh][nw],pn,ppn};
                sort(all(tmp));
                if(tmp[1]==pn) continue;
            }
            if(dist+1<D[nh][nw][move]){
                D[nh][nw][move]=dist+1;
                Q.emplace(nh,nw,dist+1,move);
            }
        }
    }
    int ans=INF;
    rep(i,5) chmin(ans,D[H-1][W-1][i]);
    cout<<(ans==INF ? -1 : ans)<<"\n";
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0