2021牛客寒假算法基础集训营5_I_正十字（并查集）

题目

https://ac.nowcoder.com/acm/contest/9985/I

分析

1. 暴力计算各个位置的k值
2. 按k值降序维护图的连通性，数据结构是并查集
3. 每个k值时是查询两点的连通性，从而判断两点间的最大k值

代码

#include <bits/stdc++.h>
using namespace std;
#define MXN 1010
#define MXQ 100010
#define a(x,y,z) a[x][y].z
#define min4(a,b,c,d) min(a, min(b, min(c,d)))
int n, m, q;
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
struct sN{int fa, val=1, t =-1, b=-1, l=-1, r=-1, k=-1;}a[MXN][MXN];
struct sQ{int x1, y1, x2, y2, ans=-1;}qs[MXQ];
vector<pair<int,int> >ks[MXN];
void calc(){
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            a(i,j,k) = min4(a(i,j,t), a(i,j,b), a(i,j,l), a(i,j,r));
            if(a(i,j,k)>=0)
                ks[a(i,j,k)].push_back({i, j});
        }
    }
}
void init(){
    scanf("%d %d %d", &n, &m, &q);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            scanf("%d", &a(i,j,val));
            a(i,j,fa) = i*MXN+j;
        }
    }
    for(int i = 1; i <= q; i++){
        scanf("%d %d %d %d", &qs[i].x1, &qs[i].y1, &qs[i].x2, &qs[i].y2);
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            if(a(i,j,val)) continue;
            a(i,j,l) = a(i,j-1,l)+1;
        }
        for(int j = m; j >= 1; j--){
            if(a(i,j,val)) continue;
            a(i,j,r) = a(i,j+1,r)+1;
        }
    }
    for(int j = 1; j <= m; j++){
        for(int i = 1; i <= n; i++){
            if(a(i,j,val)) continue;
            a(i,j,t) = a(i-1,j, t)+1;
        }
        for(int i = n; i>=1; i--){
            if(a(i,j,val)) continue;
            a(i,j,b) = a(i+1,j,b)+1; 
        }
    }
}
int query(int p){
    int x = p/MXN, y=p%MXN;
    if(a(x,y,fa) != p) a(x,y,fa) = query(a(x,y,fa));
    return a(x,y,fa);
}
void merge(int x, int y){
    int f1 = query(x);
    int f2 = query(y);
    if(f1 != f2) a(f1/MXN, f1%MXN, fa) = f2;
}
void solve(){
    for(int i = min(n,m)/2; i >= 0; i--){
        if(ks[i].size() == 0) continue;
        for(int j = 0; j < ks[i].size(); j++){
            int ti = ks[i][j].first, tj = ks[i][j].second;
            for(int l = 0; l < 4; l++){
                int x = ti+dx[l], y = tj+dy[l];
                if(x<1 || x>n || y<1 || y>m) continue;
                if(a(x,y,val) || a(x,y,k)<i) continue;
                merge(a(ti,tj,fa), a(x,y,fa));
            }
        }
        for(int j = 1; j <= q; j++){
            if(qs[j].ans != -1) continue;
            if(a(qs[j].x1,qs[j].y1,k)<i) continue;
            if(a(qs[j].x2,qs[j].y2,k)<i) continue;
            int f1 = query(qs[j].x1*MXN+qs[j].y1);
            int f2 = query(qs[j].x2*MXN+qs[j].y2);
            if(f1 == f2) qs[j].ans = i;
        }
    }
}
int main(){
    init();
    calc(); // 计算各点k值
    solve();
    for(int i = 1; i <= q; i++) printf("%d\n", qs[i].ans);
    return 0;
}