#include using namespace std; class UnionFind{ public: vector par,siz; vector> Query; void make(int N,vector> Q){ par.resize(N,-1); siz.resize(N,1); Query.resize(N); for(int i=0; i unite(int u, int v){ u = root(u),v = root(v); if(u == v) return {}; if(Query.at(u).size() < Query.at(v).size()) swap(u,v); par.at(v) = u; siz.at(u) += siz.at(v); vector ret; for(auto &pos : Query.at(v)){ if(Query.at(u).count(pos)){ret.push_back(pos),Query.at(u).erase(pos);} else Query.at(u).insert(pos); } Query.at(v).clear(); return ret; } bool issame(int u, int v){ if(root(u) == root(v)) return true; else return false; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int H,W; cin >> H >> W; vector> rev(1000000); vector> A(H,vector(W)); for(int i=0; i> a; A.at(i).at(k) = a; rev.at(a).push_back(i*W+k); } int Q; cin >> Q; vector answer(Q); vector> Query; while(Q--){ int x1,y1,x2,y2; cin >> x1 >> y1 >> x2 >> y2; x1--; y1--; x2--; y2--; Query.push_back({x1*W+y1,x2*W+y2}); } Q = answer.size(); UnionFind Z; Z.make(H*W,Query); vector> dxy = {{-1,0},{0,1},{1,0},{0,-1}}; for(int i=0; i<1000000; i++) for(auto r : rev.at(i)){ int x = r/W,y = r%W; for(auto [dx,dy] : dxy){ int nx = x+dx,ny = y+dy; if(nx < 0 || ny < 0 || nx >= H || ny >= W) continue; if(A.at(nx).at(ny) <= A.at(x).at(y)){ auto now = Z.unite(x*W+y,nx*W+ny); for(auto pos : now) answer.at(pos) = i; } } } for(auto ans : answer) cout << ans << "\n"; }