結果
問題 | No.2786 RMQ on Grid Path |
ユーザー | akiaa11 |
提出日時 | 2024-06-19 19:17:32 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 642 ms / 6,000 ms |
コード長 | 4,297 bytes |
コンパイル時間 | 6,617 ms |
コンパイル使用メモリ | 272,248 KB |
実行使用メモリ | 28,908 KB |
最終ジャッジ日時 | 2024-06-19 19:17:56 |
合計ジャッジ時間 | 22,645 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 4 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 4 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 3 ms
5,376 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | AC | 3 ms
5,376 KB |
testcase_10 | AC | 3 ms
5,376 KB |
testcase_11 | AC | 3 ms
5,376 KB |
testcase_12 | AC | 598 ms
27,552 KB |
testcase_13 | AC | 621 ms
27,368 KB |
testcase_14 | AC | 601 ms
27,364 KB |
testcase_15 | AC | 621 ms
27,308 KB |
testcase_16 | AC | 597 ms
27,516 KB |
testcase_17 | AC | 642 ms
27,588 KB |
testcase_18 | AC | 615 ms
27,296 KB |
testcase_19 | AC | 638 ms
27,384 KB |
testcase_20 | AC | 588 ms
27,172 KB |
testcase_21 | AC | 607 ms
27,556 KB |
testcase_22 | AC | 480 ms
21,456 KB |
testcase_23 | AC | 489 ms
21,956 KB |
testcase_24 | AC | 546 ms
28,572 KB |
testcase_25 | AC | 542 ms
27,908 KB |
testcase_26 | AC | 558 ms
28,908 KB |
testcase_27 | AC | 280 ms
12,520 KB |
testcase_28 | AC | 311 ms
12,112 KB |
testcase_29 | AC | 442 ms
23,252 KB |
testcase_30 | AC | 284 ms
12,132 KB |
testcase_31 | AC | 37 ms
5,376 KB |
testcase_32 | AC | 553 ms
26,888 KB |
testcase_33 | AC | 298 ms
7,968 KB |
testcase_34 | AC | 477 ms
23,904 KB |
testcase_35 | AC | 486 ms
23,904 KB |
testcase_36 | AC | 512 ms
23,784 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif #define M_PI 3.14159265358979323846 using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() >> 2; constexpr int inf=numeric_limits<int>::max() >> 1; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int h, w;cin>>h>>w; vector a(h, veci(w)); rep(i, h) rep(j, w) cin>>a[i][j]; int q;cin>>q; veci fr(q), to(q); vector<veci> c(h * w); rep(i, q){ int l, r, x, y;cin>>l>>r>>x>>y; l--, r--, x--, y--; fr[i] = l * w + r, to[i] = x * w + y; c[l * w + r].push_back(i); c[x * w + y].push_back(i); } dsu t(h * w); veci idx(h * w); veci lc(h * w); iota(all(idx), 0); iota(all(lc), 0); sort(all(idx), [&](int i, int j){return a[i / w][i % w] < a[j / w][j % w];}); veci used(h * w); veci ans(q, inf); rep(i2, h * w){ int i = idx[i2]; rep(k, 4){ int ni = i / w + vi[k]; int nj = i % w + vj[k]; if(Judge(ni, nj, h, w) || !used[ni * w + nj] || t.same(i, ni * w + nj)) continue; int ra = lc[t.leader(i)], rb = lc[t.leader(ni * w + nj)]; t.merge(i, ni * w + nj); if(c[ra].size() > c[rb].size()) swap(ra, rb); lc[t.leader(i)] = rb; while(c[ra].size()){ if(t.same(fr[c[ra].back()], to[c[ra].back()])) chmin(ans[c[ra].back()], a[i / w][i % w]); else c[rb].push_back(c[ra].back()); c[ra].pop_back(); } } used[i] = 1; } rep(i, q) cout<<ans[i]<<endl; }