题目概述
给出
n
块木板,每块木板为
解题报告
考虑离线。对于每个木板,我们可以二分枚举该木板被打碎的时间,用主席树验证。这样常数比较大,而由于每个木板都需要二分,所以我们会想到整体二分,这样常数就很小了。
示例程序
#include<cstdio>
#include<algorithm>
#define fr first
#define sc second
#define mp make_pair
using namespace std;
const int maxn=200000,maxm=200000,maxx=200000;
int n,m,p[maxm+5],ID[maxm+5],tem[maxm+5],ans[maxm+5];
pair<pair<int,int>,int> s[maxn+5];
#define Eoln(x) ((x)==10||(x)==13||(x)==EOF)
inline char readc()
{
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
if (l==r) return EOF; else return *l++;
}
inline int readi(int &x)
{
int tot=0,f=1;char ch=readc(),lst='+';
while ('9'<ch||ch<'0') {if (ch==EOF) return EOF;lst=ch;ch=readc();}
if (lst=='-') f=-f;
while ('0'<=ch&&ch<='9') tot=(tot<<3)+(tot<<1)+ch-48,ch=readc();
return x=tot*f,Eoln(ch);
}
int c[maxx+5];
inline void Update(int x,int tem) {for (int i=x;i<=maxx;i+=i&-i) c[i]+=tem;}
inline int Sum(int x) {int sum=0;for (int i=x;i;i-=i&-i) sum+=c[i];return sum;}
void AllBinary(int L,int R,int l,int r)
{
int mid=L+(R-L>>1);
if (L==R)
{
for (int i=l;i<=r;i++)
{
if (s[ID[i]].fr.fr<=p[mid]&&p[mid]<=s[ID[i]].fr.sc) s[ID[i]].sc--;
ans[mid]+=s[ID[i]].sc<=0;
}
return;
}
for (int i=L;i<=mid;i++) Update(p[i],1);int Head=l,Tail=r;
for (int i=l,now;i<=r;i++)
if (s[ID[i]].sc<=(now=Sum(s[ID[i]].fr.sc)-Sum(s[ID[i]].fr.fr-1)))
tem[Head++]=ID[i]; else tem[Tail--]=ID[i],s[ID[i]].sc-=now;
for (int i=l;i<=r;i++) ID[i]=tem[i];
for (int i=L;i<=mid;i++) Update(p[i],-1);
AllBinary(L,mid,l,Tail);AllBinary(mid+1,R,Head,r);
}
int main()
{
freopen("C.in","r",stdin);
freopen("C.out","w",stdout);
readi(n);readi(m);
for (int i=1;i<=n;i++) readi(s[i].fr.fr),readi(s[i].fr.sc),readi(s[i].sc),ID[i]=i;
for (int i=1;i<=m;i++) readi(p[i]);
AllBinary(1,m,1,n);for (int i=1;i<=m;i++) printf("%d\n",ans[i]);
return 0;
}