双堆——大富翁游戏

大富翁游戏

堆的基本操作：插入，删除，修改。

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
#define R register
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};

const int N=100010;
struct node{
	int v,pos;
}heap1[N],heap2[N];
int len1,s1[N];
int len2,s2[N];
int n,m;

inline void up1(int p){
	while(p>1&&heap1[p].v<heap1[p>>1].v){
		swap(heap1[p],heap1[p>>1]);
		s1[heap1[p].pos]=p;
		s1[heap1[p>>1].pos]=p>>1;
		p>>=1;
	}
}

inline void down1(int p){
	while((p<<1)<=len1){
		int j=p<<1;
		if(j+1<=len1&&heap1[j+1].v<heap1[j].v) j++;
		if(heap1[p].v<=heap1[j].v) break;
		swap(heap1[p],heap1[j]);
		s1[heap1[p].pos]=p;
		s1[heap1[j].pos]=j;
		p=j;
	}
}

inline void up2(int p){
	while(p>1&&heap2[p].v>heap2[p>>1].v){
		swap(heap2[p],heap2[p>>1]);
		s2[heap2[p].pos]=p;
		s2[heap2[p>>1].pos]=p>>1;
		p>>=1;
	}
}

inline void down2(int p){
	while((p<<1)<=len2){
		int j=p<<1;
		if(j+1<=len2&&heap2[j+1].v>heap2[j].v) j++;
		if(heap2[p].v>=heap2[j].v) break;
		swap(heap2[p],heap2[j]);
		s2[heap2[p].pos]=p;
		s2[heap2[j].pos]=j;
		p=j;
	}
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	rep(i,0,n){
		heap1[++len1].v=100;
		s1[len1]=heap1[len1].pos=len1;
		heap2[++len2].v=100;
		s2[len2]=heap2[len2].pos=len2;
	}
	while(m--){
		int op;
		cin>>op;
		if(op==1){
			int p,x;
			cin>>p>>x;
			heap1[s1[p]].v+=x;
			up1(s1[p]);
			down1(s1[p]);
			heap2[s2[p]].v+=x;
			up2(s2[p]);
			down2(s2[p]);
		}else{
			cout<<heap2[1].v<<" "<<heap1[1].v<<endl;
		}
	}
	return 0;
}