题意简述:给出一个长度为N,宽度为1,高度无限的水箱,有N-1个挡板将其分成N个小格,然后向每个小格中注水,水超过挡板会流向另一边,水满足物理学定律,有M个条件(i,y,k),表示从左往右数第i个格子中,高度(y+0.5) 的地方是否有水,k = 1表示有水,k = 0表示没水,求最多满足多少个条件,多测。
题解:将询问和隔板按高度排序,水从下向上淹上来,遇到隔板就用并查集合并起来,遇到k = 0的点答案加一(这个点在之前的水位上),遇到k = 1考虑把这个点满足,把下面都淹掉,更新答案。
#include<bits/stdc++.h>
const int N = 1e5 + 10;
template <typename T> void read(T &x){
x = 0; T f = 1;
char c = getchar();
while (c < '0' || c > '9') {if (c == '-') f *= -1; c = getchar();}
while (c >= '0' && c <= '9') {x = x * 10 + c - '0'; c = getchar();}
x *= f;
}
struct Rec{
int op,x,y;
Rec () {}
Rec (int _op, int _x, int _y):
op(_op),x(_x),y(_y) {}
};
bool operator < (const Rec &a, const Rec &b){
if (a.y != b.y) return a.y < b.y;
return a.op < b.op;
}
Rec rec[N * 2];
int fa[N],ans[N],blue[N];
int find(int x){
if (fa[x] == x) return x;
return fa[x] = find(fa[x]);
}
int main(){
freopen("A.in","r",stdin);
freopen("A.out","w",stdout);
int T,n,m,x,y,z;
read(T);
while (T--){
read(n);read(m);int cnt = 0;
for (int i=1; i<=n; i++) fa[i] = i;
memset(ans,0,sizeof(ans));
memset(blue,0,sizeof(blue));
for (int i=1; i<n; i++){
read(x);
rec[++cnt] = Rec(0,i,x);
}
while (m--){
read(x);read(y);read(z);
rec[++cnt] = Rec(z+1,x,y);
}
std::sort(rec+1,rec+cnt+1);
int fans = 0;
for (int i=1; i<=cnt; i++){
if (rec[i].op == 0){
int f1 = find(rec[i].x);
int f2 = find(rec[i].x + 1);
fa[f2] = f1;
ans[f1] += ans[f2];
fans = std::max(fans,ans[f1]);
blue[f1] += blue[f2];
continue;
}
if (rec[i].op == 1){
int f = find(rec[i].x);
ans[f]++;
fans = std::max(fans,ans[f]);
continue;
}
if (rec[i].op == 2){
int f = find(rec[i].x);
blue[f]++;
ans[f] = std::max(ans[f],blue[f]);
fans = std::max(fans,ans[f]);
continue;
}
}
printf("%d\n",fans);
}
}
如有侵权,请联系作者删除。