[BZOJ2827]千山鸟飞绝

#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
# define maxn 30010
using namespace std;
void ot(int x){cout<<"***** ->"<<x<<endl;}
int n,m;
int bd[maxn];
int ans1[maxn],ans2[maxn];   //ans2==num
struct ROU{
    int val,id;
};
bool operator < (const ROU a,const ROU b){
    if(a.val==b.val) return a.id<b.id;
    return a.val<b.val;
}
struct Treap{
    Treap* ch[2];
    ROU tt;
    int size,key,mk1,mk2;
    Treap(int v,int ii)
        {size=1; tt.val=v; tt.id=ii; key=rand(); mk1=mk2=0; ch[0]=ch[1]=NULL;}
    void update()
        {size=1+(ch[0]?ch[0]->size:0)+(ch[1]?ch[1]->size:0);}
};
typedef pair<Treap*,Treap*> D;
int Size(Treap* now){return now? now->size:0;}
int mmxx(Treap *now){return now? now->tt.val:0;}
void pushdown(Treap* &now){
    if(!now) return;
    if(now->ch[0]){
        now->ch[0]->mk1=max(now->mk1,now->ch[0]->mk1);
        now->ch[0]->mk2=max(now->mk2,now->ch[0]->mk2);
    }
    if(now->ch[1]){
        now->ch[1]->mk1=max(now->mk1,now->ch[1]->mk1);
        now->ch[1]->mk2=max(now->mk2,now->ch[1]->mk2);
    }
    int ii=now->tt.id;
    ans1[ii]=max(ans1[ii],now->mk1);
    ans2[ii]=max(ans2[ii],now->mk2);
    now->mk1=0; now->mk2=0;
}
D Split(Treap* now,int k){
    if(!now) return D(NULL,NULL);
    D y;
    pushdown(now);
    if(Size(now->ch[0])>=k)
        {y=Split(now->ch[0],k); now->ch[0]=y.second; now->update(); y.second=now;}
    else
        {y=Split(now->ch[1],k-Size(now->ch[0])-1); now->ch[1]=y.first; now->update(); y.first=now;}
    return y;
}
Treap* Merge(Treap* a,Treap* b){
    if(!a) return b;
    if(!b) return a;
    if(a->key < b->key)
        {a->ch[1]=Merge(a->ch[1],b); a->update(); return a;}
    else
        {b->ch[0]=Merge(a,b->ch[0]); b->update(); return b;}
}
int Getkth(Treap* now,ROU o){
    if(!now) return 0;
    return (!(now->tt<o))? Getkth(now->ch[0],o):Getkth(now->ch[1],o)+Size(now->ch[0])+1;
}
int Findkth(Treap* &rt,int k){
    D x=Split(rt,k-1);
    D y=Split(x.second,1);
    Treap* ans=y.first;
    rt=Merge(Merge(x.first,ans),y.second);
    return ans? ans->tt.val:0;
}
void add_mk(ROU o,Treap* &now){
    if(!now) return ;
    int da=Findkth(now,now->size);
    now->mk1=max(now->mk1,o.val);
    now->mk2=max(now->mk2,now->size);
    ans1[o.id]=max(ans1[o.id],da);
    ans2[o.id]=max(ans2[o.id],now->size);
}
void Insert(ROU o,Treap* &rt){
    add_mk(o,rt);
    int k=Getkth(rt,o);
    D x=Split(rt,k);
    Treap* now=new Treap(o.val,o.id);
    rt=Merge(Merge(x.first,now),x.second);
}
void Delete(ROU o,Treap* &rt){
    int k=Getkth(rt,o);
    D x=Split(rt,k); 
    D y=Split(x.second,1);
    int ii=y.first->tt.id;
    ans1[ii]=max(ans1[ii],y.first->mk1);
    ans2[ii]=max(ans2[ii],y.first->mk2);
    rt=Merge(x.first,y.second);
}
struct HHs{
    struct node{
        int x,y,nxt;
        Treap* rt;
    }g[4000000];
    int e,adj[80000];
    int modx;
    int mody;
    int mod;
    HHs(){
        memset(adj,-1,sizeof(adj));
        modx=7307; mody=9991; mod=76543;
    }
    void add(int now,int x,int y){
        g[e].x=x; g[e].y=y; g[e].nxt=adj[now];
        adj[now]=e++;
    }
    int find(int x,int y){
        int now=(((x%modx)+modx)%modx)*(((y%mody)+mody)%mody)%mod;
        for(int i=adj[now];i!=-1;i=g[i].nxt){
            if(x==g[i].x && y==g[i].y){
                return i;
            }
        }
        add(now,x,y); return e-1;
    }
}hs;
int pos[maxn][3];
void init(){
    scanf("%d",&n);
    int now; ROU o;
    for(int i=1;i<=n;i++){
        scanf("%d%d%d",&bd[i],&pos[i][0],&pos[i][1]);
        now=hs.find(pos[i][0],pos[i][1]);
        o.id=i; o.val=bd[i];
        Insert(o,hs.g[now].rt);
    }
}
void work(){
    scanf("%d",&m);
    int iid,x,y;
    int now; ROU o;
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&iid,&x,&y);
        o.id=iid; o.val=bd[iid];
        now=hs.find(pos[iid][0],pos[iid][1]);
        Delete(o,hs.g[now].rt);
        pos[iid][0]=x; pos[iid][1]=y; 
        now=hs.find(x,y);
        Insert(o,hs.g[now].rt);
    }
    for(int i=1;i<=n;i++){
        now=hs.find(pos[i][0],pos[i][1]);
        o.id=i; o.val=bd[i];
        Delete(o,hs.g[now].rt);
    }
    long long ans;
    for(int i=1;i<=n;i++){
        ans=(long long)ans1[i]*ans2[i];
        printf("%lld
",ans);
    }
}
int main(){
    // freopen("a.in","r",stdin);
    init();
    work();
}