結果

問題 No.2786 RMQ on Grid Path
ユーザー dyktr_06dyktr_06
提出日時 2024-06-15 00:30:32
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 352 ms / 6,000 ms
コード長 6,664 bytes
コンパイル時間 3,003 ms
コンパイル使用メモリ 225,384 KB
実行使用メモリ 41,476 KB
最終ジャッジ日時 2024-06-15 00:30:46
合計ジャッジ時間 12,874 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 352 ms
36,736 KB
testcase_13 AC 341 ms
36,740 KB
testcase_14 AC 316 ms
36,732 KB
testcase_15 AC 319 ms
36,768 KB
testcase_16 AC 342 ms
36,736 KB
testcase_17 AC 324 ms
36,752 KB
testcase_18 AC 326 ms
36,868 KB
testcase_19 AC 334 ms
36,860 KB
testcase_20 AC 312 ms
36,640 KB
testcase_21 AC 322 ms
36,612 KB
testcase_22 AC 263 ms
36,768 KB
testcase_23 AC 285 ms
36,736 KB
testcase_24 AC 252 ms
40,704 KB
testcase_25 AC 244 ms
40,708 KB
testcase_26 AC 249 ms
40,836 KB
testcase_27 AC 115 ms
9,696 KB
testcase_28 AC 100 ms
5,376 KB
testcase_29 AC 266 ms
35,464 KB
testcase_30 AC 94 ms
5,748 KB
testcase_31 AC 16 ms
5,376 KB
testcase_32 AC 219 ms
40,064 KB
testcase_33 AC 52 ms
5,376 KB
testcase_34 AC 230 ms
41,220 KB
testcase_35 AC 215 ms
41,340 KB
testcase_36 AC 219 ms
41,476 KB
権限があれば一括ダウンロードができます

ソースコード

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 PersistentUnionFind{
    int now;
    vector<int> par, rank, time;
    vector<vector<pair<int, int>>> num;
    const int INF = 1 << 30;

    PersistentUnionFind(const int N) : par(N), rank(N), time(N), num(N){
        now = 0;
        for(int i = 0; i < N; ++i){
            par[i] = i;
            num[i].emplace_back(0, 1);
        }
        fill(rank.begin(), rank.begin() + N, 0);
        fill(time.begin(), time.begin() + N, INF);
    }

    int root(const int x, const int t){
        if(t < time[x]) return x;
        return root(par[x], t);
    }

    void unite(const int x, const int y){
        ++now;

        int rx = root(x, now);
        int ry = root(y, now);
        if(rx == ry) return;

        if(rank[rx] < rank[ry]) swap(rx, ry);
        num[rx].emplace_back(now, size(rx, now) + size(ry, now));

        par[ry] = rx;
        time[ry] = now;
        if(rank[rx] == rank[ry]) ++rank[rx];
    }

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

    int size(const int x, const int t){
        int rx = root(x, t);

        int ok = 0, ng = num[rx].size();
        while(abs(ok - ng) > 1){
            int mid = (ok + ng) / 2;
            if(num[rx][mid].first <= t){
                ok = mid;
            } else{
                ng = mid;
            }
        }
        return num[rx][ok].second;
    }
};

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; };
    PersistentUnionFind uf(h * w);
    vector<tuple<ll, ll, ll>> p;
    rep(i, h) rep(j, w) p.emplace_back(a[i][j], i, j);
    Sort(p);
    vll timestamp = {0};
    rep(i, h * w){
        auto [v, 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] <= v){
                timestamp.push_back(v);
                uf.unite(id(x, y), id(nx, ny));
            }
        }
    }
    ll q; in(q);
    while(q--){
        ll x1, y1, x2, y2; in(x1, y1, x2, y2);
        --x1, --y1, --x2, --y2;
        ll ok = timestamp.size(), ng = 0;
        while(abs(ok - ng) > 1){
            ll mid = (ok + ng) / 2;
            if(uf.same(id(x1, y1), id(x2, y2), mid)) ok = mid;
            else ng = mid;
        }
        out(timestamp[ok]);
    }
}

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

    input();
    solve();
}
0