传送门
题解:
按照恢复满的时间为线段树下标,原序列标号作为根节点顺序建立主席树,然后set维护一下最后访问时间相同的连续段,对于每个连续段,如果是第一次访问,暴力算,否则它们已经被清空过了,在主席树里面二分找到清空时间算一下贡献即可。
复杂度均摊分析可以知道是 O ( n log n + q log n ) O(n\log n+q\log n) O(nlogn+qlogn),好像有一种线段树暴力 O ( n log n + q log 2 n ) O(n\log n+q\log^2 n) O(nlogn+qlog2n)的做法,感觉不是很优秀就没有写。
代码(C++14):
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
namespace IO{
inline char gc(){
static cs int Rlen=1<<22|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
template<typename T>
inline T get(){
char c;T num;
while(!isdigit(c=gc()));num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
inline int gi(){return get<int>();}
}
using namespace IO;
using std::cerr;
using std::cout;
cs int N=1e5+7;
int n,q;
int rt[N],s[N],m[N],r[N];
namespace PST{
cs int N=::N*20;
int lc[N],rc[N],tot;ll sm[N],sr[N];
inline int _copy(int u){++tot;lc[tot]=lc[u],rc[tot]=rc[u],sm[tot]=sm[u],sr[tot]=sr[u];return tot;}
inline void ins(int &u,int l,int r,int p,int m,int vl){
u=_copy(u);sm[u]+=m,sr[u]+=vl;
if(l==r)return ;
int mid=l+r>>1;
(p<=mid)?ins(lc[u],l,mid,p,m,vl):ins(rc[u],mid+1,r,p,m,vl);
}
inline ll query(int u,int v,int l,int r,int t){
if(l==r)return sm[u]-sm[v];
int mid=l+r>>1;
if(t<=mid)return t*(sr[rc[u]]-sr[rc[v]])+query(lc[u],lc[v],l,mid,t);
else return sm[lc[u]]-sm[lc[v]]+query(rc[u],rc[v],mid+1,r,t);
}
}
inline ll solve(int l,int r,int b,int e){
if(b==-1){ll ans=0;for(int re i=l;i<=r;++i)ans+=std::min((ll)m[i],s[i]+(ll)e*::r[i]);return ans;}
else return PST::query(rt[r],rt[l-1],0,1e5,e-b);
}
struct seg{
int l,r,t;
inline bool operator<(cs seg &a)cs{return l<a.l;}
};
std::set<seg> S;
inline auto split(int x){
auto it=S.lower_bound((seg){x,x,0});
if(it!=S.end()&&it->l==x)return it;
--it;int l=it->l,r=it->r,t=it->t;
S.erase(it);S.insert((seg){l,x-1,t});
return S.insert((seg){x,r,t}).first;
}
signed main(){
#ifdef zxyoi
freopen("pony.in","r",stdin);
#endif
n=gi();
for(int re i=1;i<=n;++i){
s[i]=gi(),m[i]=gi(),r[i]=gi();rt[i]=rt[i-1];
if(r[i]&&m[i])PST::ins(rt[i],0,1e5,(m[i]-1)/r[i]+1,m[i],r[i]);
}
S.insert((seg){1,n,-1});S.insert((seg){n+1,n+1,0});q=gi();
while(q--){
int t=gi(),l=gi(),r=gi();
auto R=split(r+1),L=split(l);ll ans=0;
for(auto i=L;i!=R;++i)ans+=solve(i->l,i->r,i->t,t);
cout<<ans<<"\n";S.erase(L,R);S.insert((seg){l,r,t});
}
return 0;
}