結果
問題 | No.2786 RMQ on Grid Path |
ユーザー |
👑 ![]() |
提出日時 | 2024-12-06 02:19:08 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,722 ms / 6,000 ms |
コード長 | 4,619 bytes |
コンパイル時間 | 21,864 ms |
コンパイル使用メモリ | 274,000 KB |
最終ジャッジ日時 | 2025-02-26 11:10:46 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 35 |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> // using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } int main() { ll H, W; cin >> H >> W; vector<vector<ll>> A(H, vector<ll>(W)); for (ll i = 0; i < H; i++) { for (ll j = 0; j < W; j++) { cin >> A[i][j]; } } ll Q; cin >> Q; vector<ll> rs(Q); vector<ll> cs(Q); vector<ll> rt(Q); vector<ll> ct(Q); for (ll i = 0; i < Q; i++) { cin >> rs[i] >> cs[i] >> rt[i] >> ct[i]; rs[i]--; cs[i]--; rt[i]--; ct[i]--; } // 並列二分探索をしたい vector<pll> p(0); for (ll i = 0; i < H; i++) { for (ll j = 0; j < W; j++) { p.push_back(make_pair(A[i][j], i * W + j)); } } sort(all(p)); vector<ll> dx = {1, 0, -1, 0}; vector<ll> dy = {0, 1, 0, -1}; vector<ll> now_ng(Q, 0); vector<ll> now_ok(Q, H * W); for (ll i = 0; i < 20; i++) { dsu tree(H * W); vector<vector<ll>> mid_idx(H * W, vector<ll>(0)); for (ll j = 0; j < Q; j++) { ll mid = (now_ng[j] + now_ok[j]) / 2; mid_idx[mid].push_back(j); } for (ll j = 0; j < H * W; j++) { for (ll k = 0; k < mid_idx[j].size(); k++) { ll idx = mid_idx[j][k]; if (tree.same(rs[idx] * W + cs[idx], rt[idx] * W + ct[idx])) { now_ok[idx] = j; } else { now_ng[idx] = j; } } ll idx_x = p[j].second / W; ll idx_y = p[j].second % W; for (ll k = 0; k < 4; k++) { if (idx_x + dx[k] >= 0 && idx_x + dx[k] < H && idx_y + dy[k] >= 0 && idx_y + dy[k] < W) { if (A[idx_x][idx_y] >= A[idx_x + dx[k]][idx_y + dy[k]]) { tree.merge(p[j].second, (idx_x + dx[k]) * W + idx_y + dy[k]); } } } } } for (ll i = 0; i < Q; i++) { cout << p[now_ok[i] - 1].first << endl; } }