bzoj3218 a + b Problem（主席树优化建图+最小割）

首先我们考虑朴素建图，S->i,bi ; i->T,wi ; i->i’,pi ; i’->j,inf，如果j会使得i变奇怪。
但是这样最后一类边可能 O(n2) ，gg
我们考虑主席树优化即可。
点数 O(2n+nlogn) 边数 O(2nlogn+4n+nlogn)

#include 
#include 
#include 
#include 
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 5010
#define M 235010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,aa[N*3],m=0,owo=0,rt=0,h[M],cur[M],lev[M],num=1,T=235001,ans=0;
struct node{
    int lc,rc;
}tr[N*3*15];
struct Data{
    int a,l,r;
}a[N];
struct edge{
    int to,next,val;
}data[1000010];
inline void add(int x,int y,int val){
    data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].val=val;
    data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].val=0;
}
inline void ins(int &p,int l,int r,int x,int id){
    if(l==r){++owo;add(owo+2*n,id,inf);if(p) add(owo+2*n,p+2*n,inf);p=owo;return;}
    tr[++owo]=tr[p];p=owo;int mid=l+r>>1;
    if(x<=mid) ins(tr[p].lc,l,mid,x,id);
    else ins(tr[p].rc,mid+1,r,x,id);
}
inline void cover(int p,int l,int r,int x,int y,int id){
    if(!p) return;
    if(x<=l&&r<=y){add(id,p+2*n,inf);return;}int mid=l+r>>1;
    if(x<=mid) cover(tr[p].lc,l,mid,x,y,id);
    if(y>mid) cover(tr[p].rc,mid+1,r,x,y,id);
}
inline bool bfs(){
    queue<int>q;memset(lev,0,sizeof(lev));
    q.push(0);lev[0]=1;
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=h[x];i;i=data[i].next){
            int y=data[i].to;if(lev[y]||!data[i].val) continue;
            lev[y]=lev[x]+1;if(y==T) return 1;q.push(y);
        }
    }return 0;
}
inline int dinic(int x,int low){
    if(x==T) return low;int tmp=low;
    for(int &i=cur[x];i;i=data[i].next){
        int y=data[i].to;if(lev[y]!=lev[x]+1||!data[i].val) continue;
        int res=dinic(y,min(tmp,data[i].val));
        if(!res) lev[y]=0;else tmp-=res,data[i].val-=res,data[i^1].val+=res;
        if(!tmp) return low;
    }return low-tmp;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();
    for(int i=1;i<=n;++i){
        aa[++m]=a[i].a=read();
        int x=read();ans+=x;add(0,i,x);x=read();ans+=x;add(i,T,x);
        aa[++m]=a[i].l=read();aa[++m]=a[i].r=read();add(i,n+i,read());
    }sort(aa+1,aa+m+1);m=unique(aa+1,aa+m+1)-aa-1;
    for(int i=1;i<=n;++i){
        a[i].a=lower_bound(aa+1,aa+m+1,a[i].a)-aa;
        a[i].l=lower_bound(aa+1,aa+m+1,a[i].l)-aa;
        a[i].r=lower_bound(aa+1,aa+m+1,a[i].r)-aa;
        cover(rt,1,m,a[i].l,a[i].r,n+i);ins(rt,1,m,a[i].a,i);
    }for(int i=1;i<=owo;++i){
        if(tr[i].lc) add(i+2*n,tr[i].lc+2*n,inf);
        if(tr[i].rc) add(i+2*n,tr[i].rc+2*n,inf);
    }while(bfs()){memcpy(cur,h,sizeof(h));ans-=dinic(0,inf);}
    printf("%d\n",ans);
    return 0;
}