結果

問題 No.2786 RMQ on Grid Path
ユーザー 👑 rin204rin204
提出日時 2024-06-14 21:58:35
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 865 ms / 6,000 ms
コード長 15,176 bytes
コンパイル時間 4,517 ms
コンパイル使用メモリ 282,020 KB
実行使用メモリ 39,056 KB
最終ジャッジ日時 2024-06-14 21:59:05
合計ジャッジ時間 21,299 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 3 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,944 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 775 ms
32,632 KB
testcase_13 AC 815 ms
33,216 KB
testcase_14 AC 771 ms
32,376 KB
testcase_15 AC 826 ms
32,452 KB
testcase_16 AC 786 ms
32,500 KB
testcase_17 AC 783 ms
32,220 KB
testcase_18 AC 832 ms
33,028 KB
testcase_19 AC 865 ms
32,752 KB
testcase_20 AC 780 ms
32,368 KB
testcase_21 AC 822 ms
32,452 KB
testcase_22 AC 534 ms
23,176 KB
testcase_23 AC 564 ms
23,176 KB
testcase_24 AC 640 ms
34,344 KB
testcase_25 AC 658 ms
33,484 KB
testcase_26 AC 580 ms
33,444 KB
testcase_27 AC 203 ms
16,048 KB
testcase_28 AC 176 ms
16,996 KB
testcase_29 AC 613 ms
26,268 KB
testcase_30 AC 177 ms
15,728 KB
testcase_31 AC 25 ms
6,944 KB
testcase_32 AC 441 ms
23,888 KB
testcase_33 AC 81 ms
17,820 KB
testcase_34 AC 607 ms
39,056 KB
testcase_35 AC 576 ms
39,052 KB
testcase_36 AC 620 ms
38,920 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE

#include <bits/stdc++.h>
using namespace std;

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

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 T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {
// __int128_t
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

struct UnionFind {
    int n;
    std::vector<int> par;
    int group;

    UnionFind() = default;
    UnionFind(int n) : n(n) {
        par.assign(n, -1);
        group = n;
    }

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

    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (par[x] > par[y]) std::swap(x, y);
        group--;
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }

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

    std::vector<int> roots() {
        std::vector<int> ret;
        for (int i = 0; i < n; i++) {
            if (i == find(i)) ret.push_back(i);
        }
        return ret;
    }

    bool isroot(int x) {
        return x == find(x);
    }
};

void solve() {
    INT(h, w);
    VVEC(ll, A, h, w);
    INT(Q);
    VVEC(int, query, Q, 4);
    fori(i, Q) fori(j, 4) query[i][j]--;

    vec(Pii, inds, 0);
    fori(i, h) fori(j, w) inds.push_back({i, j});
    sort(all(inds), [&](Pii a, Pii b) { return A[a.first][a.second] < A[b.first][b.second]; });

    struct S {
        int l;
        int r;
        vector<int> q;
    };

    vec(S, qq, 1);
    qq[0].l = 0;
    qq[0].r = inds.size();
    fori(i, Q) {
        qq[0].q.push_back(i);
    }

    vec(int, ans, Q);

    while (!qq.empty()) {
        vec(S, nqq, 0);
        UnionFind UF(h * w);
        int bef = 0;
        for (auto &q : qq) {
            if (q.r - q.l == 1) {
                auto [i, j] = inds[q.l];
                for (auto &qi : q.q) {
                    ans[qi] = A[i][j];
                }
                continue;
            }
            int mid = (q.l + q.r) / 2;
            fori(t, bef, mid) {
                int i = inds[t].first;
                int j = inds[t].second;
                if (i > 0 && A[i][j] >= A[i - 1][j]) UF.unite(i * w + j, (i - 1) * w + j);
                if (i < h - 1 && A[i][j] >= A[i + 1][j]) UF.unite(i * w + j, (i + 1) * w + j);
                if (j > 0 && A[i][j] >= A[i][j - 1]) UF.unite(i * w + j, i * w + j - 1);
                if (j < w - 1 && A[i][j] >= A[i][j + 1]) UF.unite(i * w + j, i * w + j + 1);
            }
            bef   = mid;
            S nq1 = {q.l, mid, {}};
            S nq2 = {mid, q.r, {}};
            for (auto &qi : q.q) {
                int i = query[qi][0];
                int j = query[qi][1];
                int x = query[qi][2];
                int y = query[qi][3];
                if (UF.same(i * w + j, x * w + y)) {
                    nq1.q.push_back(qi);
                } else {
                    nq2.q.push_back(qi);
                }
            }
            if (!nq1.q.empty()) nqq.push_back(nq1);
            if (!nq2.q.empty()) nqq.push_back(nq2);
        }
        qq = nqq;
    }
    prisep(ans, "\n");
}

int main() {
#ifndef INTERACTIVE
    cin.tie(0)->sync_with_stdio(0);
#endif
    // cout << fixed << setprecision(12);
    int t;
    t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}

// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// #include "data_structure/UnionFind.hpp"
//
// void solve() {
//     INT(h, w);
//     VVEC(ll, A, h, w);
//     INT(Q);
//     VVEC(int, query, Q, 4);
//     fori(i, Q) fori(j, 4) query[i][j]--;
//
//     vec(Pii, inds, 0);
//     fori(i, h) fori(j, w) inds.push_back({i, j});
//     sort(all(inds), [&](Pii a, Pii b) { return A[a.first][a.second] < A[b.first][b.second]; });
//
//     struct S {
//         int l;
//         int r;
//         vector<int> q;
//     };
//
//     vec(S, qq, 1);
//     qq[0].l = 0;
//     qq[0].r = inds.size();
//     fori(i, Q) {
//         qq[0].q.push_back(i);
//     }
//
//     vec(int, ans, Q);
//
//     while (!qq.empty()) {
//         vec(S, nqq, 0);
//         UnionFind UF(h * w);
//         int bef = 0;
//         for (auto &q : qq) {
//             if (q.r - q.l == 1) {
//                 auto [i, j] = inds[q.l];
//                 for (auto &qi : q.q) {
//                     ans[qi] = A[i][j];
//                 }
//                 continue;
//             }
//             int mid = (q.l + q.r) / 2;
//             fori(t, bef, mid) {
//                 int i = inds[t].first;
//                 int j = inds[t].second;
//                 if (i > 0 && A[i][j] >= A[i - 1][j]) UF.unite(i * w + j, (i - 1) * w + j);
//                 if (i < h - 1 && A[i][j] >= A[i + 1][j]) UF.unite(i * w + j, (i + 1) * w + j);
//                 if (j > 0 && A[i][j] >= A[i][j - 1]) UF.unite(i * w + j, i * w + j - 1);
//                 if (j < w - 1 && A[i][j] >= A[i][j + 1]) UF.unite(i * w + j, i * w + j + 1);
//             }
//             bef   = mid;
//             S nq1 = {q.l, mid, {}};
//             S nq2 = {mid, q.r, {}};
//             for (auto &qi : q.q) {
//                 int i = query[qi][0];
//                 int j = query[qi][1];
//                 int x = query[qi][2];
//                 int y = query[qi][3];
//                 if (UF.same(i * w + j, x * w + y)) {
//                     nq1.q.push_back(qi);
//                 } else {
//                     nq2.q.push_back(qi);
//                 }
//             }
//             if (!nq1.q.empty()) nqq.push_back(nq1);
//             if (!nq2.q.empty()) nqq.push_back(nq2);
//         }
//         qq = nqq;
//     }
//     prisep(ans, "\n");
// }
//
// int main() {
// #ifndef INTERACTIVE
//     cin.tie(0)->sync_with_stdio(0);
// #endif
//     // cout << fixed << setprecision(12);
//     int t;
//     t = 1;
//     // cin >> t;
//     while (t--) solve();
//     return 0;
// }
0