#1188137 (C++23) No.3723 Climb or Detour

• 問題: No.3723 Climb or Detour
• ユーザー: noya2
• 提出日時: 2026-09-19 13:28:30
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 7,897 bytes
• コンパイル時間: 3,062 ms
• コンパイル使用メモリ: 360,020 KB
• 実行使用メモリ: 10,056 KB
• 最終ジャッジ日時: 2026-09-19 13:31:57
• 合計ジャッジ時間: 10,413 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge3_0

ファイルパターン	結果
sample	AC * 1 WA * 1
other	AC * 28 WA * 30

ソースコード

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"

#line 5 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"
#include <ranges>

namespace noya2 {

struct grid {
    int h, w;
    grid (int _h = 0, int _w = 0) : h(_h), w(_w) {}
    int idx(int x, int y) const {
        return x * w + y;
    }
    std::pair<int,int> pos(int id) const {
        return {id / w, id % w};
    }
    bool operator()(int x, int y) const {
        return 0 <= x && x < h && 0 <= y && y < w;
    }
    bool operator()(int id) const {
        return operator()(id / w, id % w);
    }
    static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
    auto adj4(int x, int y) const {
        return dxys | std::views::transform([x, y](std::pair<int,int> dxy){
            return std::pair<int,int>(dxy.first + x, dxy.second + y);
        }) | std::views::filter([this](std::pair<int,int> xy){
            return operator()(xy.first, xy.second);
        });
    }
    auto adj4(int id) const {
        return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){
            return idx(xy.first, xy.second);
        });
    }
    int size() const {
        return h * w;
    }
};

} // namespace noya2
#line 4 "c.cpp"

void solve(){
    int n, k; in(n,k);
    grid gr(n,n);
    int sx, sy, gx, gy; in(sx,sy,gx,gy); sx--, sy--, gx--, gy--;
    int dist = abs(sx-gx) + abs(sy-gy);
    if (dist > k){
        out(-1);
        return ;
    }
    if (dist/2*4+dist%2 < k){
        out(-1);
        return ;
    }
    if (k % 2 != dist % 2){
        out(-1);
        return ;
    }
    vector<int> que0, que1, que2;
    vector ds(n,vector<int>(n,iinf));
    int memo = 0;
    auto check = [&](int diam) -> bool {
        auto col = [&](int i, int j) -> int {
            if ((i+j) % 2 == (sx+sy)%2) return 0;
            if (i == gx && j == gy) return 0;
            if (abs(i-sx)+abs(j-sy) <= diam*2){
                return 1;
            }
            return 0;
        };
        rep(i,n) rep(j,n) ds[i][j] = iinf;
        que0.emplace_back(gr.idx(sx,sy));
        ds[sx][sy] = 0;
        while (!que0.empty() || !que1.empty() || !que2.empty()){
            if (que0.empty()){
                swap(que0,que1);
                swap(que1,que2);
                continue;
            }
            int v = que0.back(); que0.pop_back();
            auto [x, y] = gr.pos(v);
            int d = ds[x][y];
            int c = col(x,y);
            for (auto [nx, ny] : gr.adj4(x,y)){
                int nc = col(nx,ny);
                int nd = d + 1 + int(c != nc);
                int u = gr.idx(nx,ny);
                if (chmin(ds[nx][ny],nd)){
                    if (c != nc){
                        que2.emplace_back(u);
                    }
                    else {
                        que1.emplace_back(u);
                    }
                }
            }
        }
        memo = ds[gx][gy];
        return ds[gx][gy] <= k;
    };
    int le = 0, ri = n;
    while (ri - le > 1){
        int md = midpoint(le,ri);
        if (check(md)){
            le = md;
        }
        else {
            ri = md;
        }
    }
    vector<string> ans(n,string(n,'.'));
    rep(i,n) rep(j,n){
        if ((i+j) % 2 == (sx+sy)%2) continue;
        if (i == gx && j == gy) continue;
        if (abs(i-sx)+abs(j-sy) <= le*2){
            ans[i][j] = '#';
        }
    }
    rep(i,n){
        out(ans[i]);
    }
    check(le);
    out(memo);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}