题目大意:两个城市A,B分别有两个护盾,现已知B护盾开启的时间和持续的时间,两个城市互相射击炮弹,如果打到的城市有护盾则反弹给另一个。现在问你要使得A城市最小受到的伤害是多少?
算法思路:我们只需要算出每颗炮弹给A造成的伤害区间,将其转化为区间交问题,即可。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
#define MAXN 50050
typedef long long LL;
LL ta,tb,stb,st,ct,dam;
int na,nb;
typedef struct Shield
{
LL l,r;
LL dam;
};
Shield s[MAXN];
bool cmp(Shield s1,Shield s2)
{
return s1.r<s2.r;
}
LL k[MAXN],f[MAXN];
void add(int w,LL value)
{
for(;w<=MAXN;w+=w&-w)
f[w]+=value;
}
LL getSum(int w)
{
LL value=0;
for(;w;w-=w&-w)
value+=f[w];
return value;
}
int main()
{
LL lb,rb,la,ra,sum,MAX;
int ssnum,ssnum2;
while(scanf("%lld%lld",&ta,&tb)!=EOF)
{
sum=0;
ssnum=0,ssnum2=0;
scanf("%lld",&stb);
lb=stb,rb=stb+tb;
scanf("%d%d",&na,&nb);
//a炮弹
for(int i=1;i<=na;i++)
{
scanf("%lld%lld%lld",&st,&ct,&dam);
if (st+ct<lb||st+ct>rb) continue ;
else
{
ssnum++;
s[ssnum].l=st+2*ct;
s[ssnum].dam=dam;
sum+=dam;
s[ssnum].r=st+2*ct+(rb-st-ct)/(2*ct)*(2*ct);
}
}
//b炮弹
for(int i=1;i<=nb;i++)
{
scanf("%lld%lld%lld",&st,&ct,&dam);
ssnum++;
s[ssnum].l=st+ct;
s[ssnum].dam=dam;
sum+=dam;
if (rb<st+2*ct||st+2*ct<lb)
s[ssnum].r=s[ssnum].l;
else s[ssnum].r=st+3*ct+(rb-st-2*ct)/(2*ct)*(2*ct);
}
for(int i=1;i<=ssnum;i++)
{
k[++ssnum2]=s[i].l;
k[++ssnum2]=s[i].r;
k[++ssnum2]=s[i].r-ta;
}
sort(s+1,s+ssnum+1,cmp);
sort(k+1,k+ssnum2+1);
int K=unique(k+1,k+ssnum2+1)-(k+1);//去重
memset(f,0,sizeof(f));
MAX=0;
for(int i=1;i<=ssnum;i++)
{
int k1=lower_bound(k+1,k+K+1,s[i].l)-k;
int k2=lower_bound(k+1,k+K+1,s[i].r)-k;
int k3=lower_bound(k+1,k+K+1,s[i].r-ta)-k;
add(k1,s[i].dam);
MAX=max(MAX,getSum(k2)-getSum(k3-1));
}
printf("%lld\n",sum-MAX);
}
return 0;
}