【JZOJ5082】【GDSOI2017第三轮模拟】Informatics Training

Description

Data Constraint

Solution

这是道数据结构的裸题。我们对于每一组分别维护两个set，一个以体力为关键字，另一个以刷题量为关键字，再全局维护一个系统编号的set和一个维护每组刷题量最小值的set。对于加入操作，我们直接新开一个set就好。对于P操作，我们可以直接在该点所在的set中查找出信息，并作修改。对于D操作，我们存两个个数组表示每个组整体的体力和刷题量增减。对于E操作，直接找出该人所在组set中的信息删去即可。对于M操作，我们可以用启发式合并，将较小的set中的每个值取出，将之前记录的整体体力、刷题量更新上去后再重新插入。T操作是我们可以在维护每组刷题量最小值的set中取出最小的，并在该点所在的set中删除刷题量相同的点的信息。细节有点多。

Code

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<set>
#define ll long long
using namespace std;
const ll maxn=3e5+5;
struct code{ll x,id;bool friend operator < (code x,code y){return x.x<y.x || x.x==y.x && x.id<y.id;}
}g,g1;
ll a[maxn],b[maxn],fa[maxn],size[maxn],bz[maxn],bz1[maxn],mi[maxn];
ll n,m,i,t,j,k,l,x,y,z,mx,p;
char ch;
multiset<code> f[maxn],f1[maxn],s;
set<code>:: iterator ii,it;
set<ll>::iterator is;
multiset<ll> c;
ll getfa(ll x){return (fa[x]==x)?x:fa[x]=getfa(fa[x]);
}
void make(ll x){g.x=mi[x];g.id=x;ii=s.find(g);if (ii!=s.end())s.erase(ii);if (f1[x].begin()!=f1[x].end()){g=*f1[x].begin();g.id=x;mi[x]=g.x=g.x+bz1[x];s.insert(g);}
}
void merge(){z=getfa(x);k=getfa(y);if (f[z].size()>f[k].size()) swap(x,y);if (z==k) return;z=getfa(x);k=getfa(y);fa[z]=k;t=f[z].size();while (f[z].size()){ ii=f[z].end();ii--;g=*ii;g1=g;a[g.id]=g.x=g.x-bz[z]+bz[k];b[g.id]=g1.x=b[g.id]+bz1[z]-bz1[k];f[k].insert(g);f1[k].insert(g1);f[z].erase(ii);size[k]+=g1.x+bz1[k];}g.x=mi[z];g.id=z;ii=s.find(g);s.erase(ii);make(k);
}
void clear(ll x){g1=*f1[x].begin();while(f1[x].begin()!=f1[x].end()){ii=f1[x].begin();g=*ii;if (g.x!=g1.x) break;size[x]-=bz1[x]+b[g.id];f1[x].erase(ii); g.x=a[g.id];f[x].erase(g);c.erase(g.id); }make(x);
}
int main(){freopen("training.in","r",stdin);freopen("training.out","w",stdout);scanf("%lld\n",&m);while(m--){scanf("%c",&ch);if (ch=='J'){scanf("%lld%lld",&g.x,&g1.x);a[++mx]=g.x;b[mx]=g1.x;fa[mx]=mx;g.id=g1.id=mx;f[mx].insert(g);f1[mx].insert(g1);size[mx]=g1.x;c.insert(mx);mi[mx]=g1.x;make(mx);}else if (ch=='P'){scanf("%lld%lld%lld",&i,&x,&y);z=getfa(i);g.x=a[i];g1.x=b[i];g1.id=g.id=i;ii=f[z].find(g);it=f1[z].find(g1);g=*ii;g1=*it;f[z].erase(ii);f1[z].erase(it);if (a[i]>x+bz[z]){g.x=a[i]=a[i]-x,f[z].insert(g);g1.x=b[i]=b[i]+y;f1[z].insert(g1),size[z]+=y;}else c.erase(i),size[z]-=b[i]+bz1[z];              make(z);}else if (ch=='D'){scanf("%lld%lld%lld",&i,&x,&y);z=getfa(i);bz[z]+=x;while(f[z].size()){ii=f[z].begin();g=*ii;if (g.x>bz[z]) break;size[z]-=bz1[z]+b[g.id];f[z].erase(ii);g1.x=b[g.id];g1.id=g.id;it=f1[z].find(g1);f1[z].erase(it);c.erase(g.id); }bz1[z]+=y; size[z]+=f[z].size()*y;make(z);}else if (ch=='E'){scanf("%lld",&i);z=getfa(i);c.erase(i);g.x=a[i];g.id=i;ii=f[z].find(g);f[z].erase(ii);g.x=b[i];ii=f1[z].find(g);f1[z].erase(ii);size[z]-=b[i]+bz1[z];make(z);}else if (ch=='M'){scanf("%lld%lld",&x,&y);merge();}else if (ch=='C'){if (c.begin()==c.end()) continue;is=c.end();is--;x=*c.begin();y=*is;merge();}else if (ch=='T'){if (c.begin()==c.end()) continue;g=*s.begin();t=g.x;while(s.begin()!=s.end()){g=*s.begin();if (g.x!=t) break;clear(g.id);}}else if (ch=='Q'){scanf("%lld",&x);z=getfa(x);t=f[z].size();printf("%lld %lld\n",t,size[z]);}scanf("\n");}
}