結果

問題 No.2786 RMQ on Grid Path
コンテスト
ユーザー dyktr_06
提出日時 2024-06-15 02:05:30
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,452 ms / 6,000 ms
コード長 7,249 bytes
コンパイル時間 2,588 ms
コンパイル使用メモリ 218,264 KB
最終ジャッジ日時 2025-02-21 22:33:30
ジャッジサーバーID
（参考情報） 		judge1 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

struct UnionFind{
    vector<int> par;
    vector<int> edg;

    UnionFind(int N) : par(N), edg(N){
        for(int i = 0; i < N; ++i){
            par[i] = -1;
            edg[i] = 0;
        }
    }

    int root(int x){
        if(par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    int unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if(rx == ry){
            edg[rx]++;
            return rx;
        }
        if(-par[rx] < -par[ry]) swap(rx, ry);
        par[rx] = par[rx] + par[ry];
        par[ry] = rx;
        edg[rx] += edg[ry] + 1;
        return rx;
    }

    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    long long size(int x){
        return -par[root(x)];
    }

    long long edge(int x){
        return edg[root(x)];
    }
};

void input(){
}

vll dx = {1, 0, -1, 0};
vll dy = {0, 1, 0, -1};

void solve(){
    ll h, w; in(h, w);
    vector<vll> a(h, vll(w));
    rep(i, h) rep(j, w) in(a[i][j]);
    auto id = [&](ll i, ll j){ return i * w + j; };
    UnionFind uf(h * w);
    vector<vector<P>> p(h * w + 1);
    rep(i, h) rep(j, w) p[a[i][j]].emplace_back(i, j);
    vll timestamp = {0};
    rep(i, h * w + 1){
        for(auto [x, y] : p[i]){
            rep(dir, 4){
                ll nx = x + dx[dir], ny = y + dy[dir];
                if(nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
                if(a[nx][ny] <= i){
                    timestamp.push_back(i);
                    uf.unite(id(x, y), id(nx, ny));
                }
            }
        }
    }

    ll siz = timestamp.size();
    ll q; in(q);
    using T = tuple<ll, ll, ll, ll>;
    vector<T> query(q);
    rep(i, q){
        ll x1, y1, x2, y2; in(x1, y1, x2, y2);
        --x1, --y1, --x2, --y2;
        query[i] = {x1, y1, x2, y2};
    }

    vll ok(q, siz), ng(q, 0);
    while(true){
        vector<vll> mid_idx(siz + 1);
        rep(i, q){
            if(abs(ok[i] - ng[i]) > 1) mid_idx[(ok[i] + ng[i]) / 2].push_back(i);
        }
        ll cnt = 0;
        UnionFind uf_tmp(h * w);
        rep(i, h * w + 1){
            for(auto [x, y] : p[i]){
                rep(dir, 4){
                    ll nx = x + dx[dir], ny = y + dy[dir];
                    if(nx < 0 || nx >= h || ny < 0 || ny >= w) continue;
                    if(a[nx][ny] <= i){
                        uf_tmp.unite(id(x, y), id(nx, ny));
                        cnt++;
                        for(auto idx : mid_idx[cnt]){
                            auto [x1, y1, x2, y2] = query[idx];
                            if(uf_tmp.same(id(x1, y1), id(x2, y2))){
                                ok[idx] = cnt;
                            }else{
                                ng[idx] = cnt;
                            }
                        }
                    }
                }
            }
        }
        bool flag = true;
        rep(i, q){
            if(abs(ok[i] - ng[i]) > 1) flag = false;
        }
        if(flag) break;
    }
    rep(i, q){
        out(timestamp[ok[i]]);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    input();
    solve();
}
0