题意就是给你一些矩形要求被覆盖大于等于k的面积和。
做法和矩阵面积并类似。时间维护x轴,线段树维护y轴。用线段作为叶节点,每个节点要保存3样东西,这个线段的真实长度,len[i]代表这个线段上被覆盖i次的真实长度,flag代表扫到x的这个位置这个线段作为边的矩形有几个还在覆盖,矩形左边边进去flag就+1,右边进去flag就-1。容易写错的地方就在更新的pushup操作。如果这个节点的flag大于k了,那么说明这个线段的len[k]就等于这个线段的真实长度。反之,要看这个节点是否是叶节点,如果是,那么len[flag]等于这个线段的真实长度,如果不是,len[i+flag] = len[i],如果i+flag >= k都当k处理。这个在flag为0的时候也成立(也就是当没有这个线段作为边的矩形在覆盖中)。
AC代码:
//#pragma comment(linker, "/STACK:102400000,102400000")
#include<cstdio>
#include<ctype.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdlib>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<string.h>
#include<string>
#include<sstream>
#include<bitset>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-8
#define NMAX 201000
#define MOD 1000000007
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define PI acos(-1)
template<class T>
inline void scan_d(T &ret)
{
char c;
int flag = 0;
ret=0;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c == '-')
{
flag = 1;
c = getchar();
}
while(c>='0'&&c<='9') ret=ret*10+(c-'0'),c=getchar();
if(flag) ret = -ret;
}
struct SegTree
{
int flag,len[11],length;
};
struct line
{
int y1,y2,x,jia;
bool operator < (const line &t) const
{
return x<t.x;
}
};
line make_line(int x,int y1, int y2,int jia)
{
line t; t.x = x; t.y1 = y1; t.y2 = y2; t.jia = jia;
return t;
}
line xian[60005];
SegTree T[60005<<2];
int y[60005],k;
void build(int l, int r, int rt)
{
T[rt].flag = 0;
memset(T[rt].len,0,sizeof(T[rt].len));
T[rt].len[0] = T[rt].length = y[r] - y[l];
// if(rt == 3) cout<<"kao:"<<l<<" "<<r<<" "<<y[r]-y[l]<<endl;
if(l+1 == r) return;
int mid = (l+r)>>1;
build(l,mid,rt<<1);
build(mid,r,rt<<1|1);
}
void pushup(int l, int r, int rt)
{
if(T[rt].flag >= k)
{
memset(T[rt].len,0,sizeof(T[rt].len));
T[rt].len[k] = T[rt].length;
}
else
{
int tmp = T[rt].flag;
memset(T[rt].len,0,sizeof(T[rt].len));
if(l+1 == r)
{
T[rt].len[tmp] = T[rt].length;
return;
}
for(int i = 0; i <= k; i++)
if(i+tmp >= k) T[rt].len[k] += T[rt<<1].len[i]+T[rt<<1|1].len[i];
else T[rt].len[i+tmp] = T[rt<<1].len[i]+T[rt<<1|1].len[i];
}
}
void update(int L, int R, int jia, int l, int r, int rt)
{
if(l >= L && r <= R)
{
// cout<<"ma:"<<rt<<" "<<T[rt].flag<<" "<<jia<<endl;
T[rt].flag += jia;
pushup(l,r,rt);
return;
}
int mid = (l+r)>>1;
if(L < mid) update(L,R,jia,l,mid,rt<<1);
if(R > mid) update(L,R,jia,mid,r,rt<<1|1);
pushup(l,r,rt);
}
map<int,int>mp;
int main()
{
#ifdef GLQ
freopen("input.txt","r",stdin);
// freopen("o2.txt","w",stdout);
#endif // GLQ
int t,n,cas=1;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&k);
mp.clear();
for(int i = 1; i <= n; i++)
{
int x1,y1,x2,y2;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
x2++;y2++;
xian[2*i-1] = make_line(x1,y1,y2,1);
xian[2*i] = make_line(x2,y1,y2,-1);
y[2*i-1] = y1; y[2*i] = y2;
}
sort(y+1,y+2*n+1);
int nct = unique(y+1,y+2*n+1)-(y+1);
build(1,nct,1);
// cout<<nct<<endl;
// cout<<y[1]<<" "<<y[2]<<" "<<y[3]<<" "<<y[4]<<endl;
sort(xian+1,xian+2*n+1);
for(int i = 1; i <= nct; i++)
mp[y[i]] = i;
ll ans = 0;
update(mp[xian[1].y1],mp[xian[1].y2],1,1,nct,1);
// cout<<T[1].len[k]<<" "<<mp[xian[1].y1]<<" "<<mp[xian[1].y2]<<" "<<xian[1].jia<<endl;
for(int i = 2; i <= 2*n; i++)
{
ans += (ll)(xian[i].x-xian[i-1].x)*T[1].len[k];
update(mp[xian[i].y1],mp[xian[i].y2],xian[i].jia,1,nct,1);
}
printf("Case %d: %lld\n",cas++,ans);
}
return 0;
}