結果

問題 No.3121 Prime Dance
ユーザー siganai
提出日時 2025-04-20 13:31:07
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 159 ms / 2,000 ms
コード長 8,540 bytes
コンパイル時間 2,680 ms
コンパイル使用メモリ 219,436 KB
実行使用メモリ 66,176 KB
最終ジャッジ日時 2025-04-20 13:31:13
合計ジャッジ時間 4,911 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

constexpr int mod = 998244353;
//constexpr int mod = 1000000007;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
#line 2 "library/prime/prime_enumerate.hpp"
vector<int> prime_enumerate(int N) {
    vector<bool> sieve(N / 3 + 1, 1);
    for (int p = 5, d = 4, i = 1, sqn = sqrt(N); p <= sqn; p += d = 6 - d, i++) {
        if (!sieve[i]) continue;
        for (int q = p * p / 3, r = d * p / 3 + (d * p % 3 == 2), s = 2 * p,
                qe = sieve.size();
            q < qe; q += r = s - r)
        sieve[q] = 0;
    }
    vector<int> ret{2, 3};
    for (int p = 5, d = 4, i = 1; p <= N; p += d = 6 - d, i++)
        if (sieve[i]) ret.push_back(p);
    while (!ret.empty() && ret.back() > N) ret.pop_back();
    return ret;
}
#line 101 "main.cpp"
int main() {
    vi ps = prime_enumerate(100000);
    INT(h,w);
    INT(sx,sy,gx,gy);
    sx--,sy--;
    gx--,gy--;
    VEC(string,s,h);
    vvi chk(h,vi(w));
    rep(i,h) {
        rep(j,w) {
            if(s[i][j] == '#') continue;
            rep(dir,4) {
                int ni = i + dx[dir];
                int nj = j + dy[dir];
                if(is_clamp(ni,0,h) && is_clamp(nj,0,w) && s[ni][nj] != '#') {
                    chk[i][j] |= 1 << (dir / 2);
                }
            }
        }
    }
    //縦に動いた回数がiの時の横に動いた回数の最小値
    vector<vvvi> dp(4,vvvi(h*w+1,vvi(h,vi(w,1e9))));
    dp[chk[sx][sy]][0][sx][sy] = 0;
    deque<tuple<int,int,int,int>> q;
    q.emplace_front(chk[sx][sy],0,sx,sy);
    while(!q.empty()) {
        auto [flg,i,x,y] = q.front();
        debug(flg,i,x,y);
        q.pop_front();
        rep(dir,4) {
            int nx = x + dx[dir];
            int ny = y + dy[dir];
            if(is_clamp(nx,0,h) && is_clamp(ny,0,w) && s[nx][ny] != '#') {
                if(dir < 2 && i + 1 <= h * w && chmin(dp[flg | chk[nx][ny]][i+1][nx][ny],dp[flg][i][x][y])) {
                    q.emplace_front(flg | chk[nx][ny],i+1,nx,ny);
                }
                else if(dir >= 2 && chmin(dp[flg | chk[nx][ny]][i][nx][ny],dp[flg][i][x][y] + 1)) {
                    q.emplace_back(flg | chk[nx][ny],i,nx,ny);
                }
            }
        }
    }
    int ans = 1e9;
    debug(dp);
    rep(i,1,h*w+1) {
        if(dp[3][i][gx][gy] == (int)1e9) continue;
        assert((i + gx - sx) % 2 == 0);
        int d1 = (i + (gx - sx)) / 2;
        int d2 = i - d1;
        if(d1 > d2) swap(d1,d2);
        int d3 = (dp[3][i][gx][gy] + (gy - sy)) / 2;
        int d4 = dp[3][i][gx][gy] - d3;
        if(d3 > d4) swap(d3,d4);
        int tmp = 0;
        if((d2 - d1) % 2) {
            if(d1 <= 2) {
                d2 += 2 - d1;
                if(*lower_bound(all(ps),d2) == d2) tmp += 2 + d2;
                else continue;
            }
            else continue;
        }
        else {
            int d12 = d2 - d1;
            int id1 = lower_bound(all(ps),d1) - ps.begin();
            int ok = 0;
            rep(j,id1,ps.size()) {
                int id2 = lower_bound(all(ps),ps[j] + d12) - ps.begin();
                if(id2 < ps.size() && ps[id2] == ps[j] + d12) {
                    ok = 1;
                    tmp += ps[j] + ps[id2];
                    break;
                }
            }
            assert(ok);
        }
        if((d4 - d3) % 2) {
            if(d3 <= 2) {
                d4 += 2 - d3;
                if(*lower_bound(all(ps),d4) == d4) tmp += 2 + d4;
                else continue;
            }
            else continue;
        }
        else {
            int d34 = d4 - d3;
            int id1 = lower_bound(all(ps),d3) - ps.begin();
            int ok = 0;
            rep(j,id1,ps.size()) {
                int id2 = lower_bound(all(ps),ps[j] + d34) - ps.begin();
                if(id2 < ps.size() && ps[id2] == ps[j] + d34) {
                    ok = 1;
                    tmp += ps[j] + ps[id2];
                    break;
                }
            }
            assert(ok);
        }
        chmin(ans,tmp);
    }
    if(ans == (int)1e9) cout << -1 << '\n';
    else cout << ans << '\n';
}
0