assass_cannotin的超级配对堆模板

最新推荐文章于 2023-08-15 11:23:40 发布

原创最新推荐文章于 2023-08-15 11:23:40 发布 · 678 阅读

0 ·

CC 4.0 BY-SA版权

神奇模板专栏收录该内容

6 篇文章

订阅专栏

template<class T,int maxsize,bool compare(const T &a,const T &b)>class Pairing_Heap
{
private:
    int nxxt[maxsize],to[maxsize],head[maxsize],fa[maxsize],Root,node[maxsize],node_index,Heap_size;
    int edge[maxsize],edge_index,cnt,S[maxsize],Top;
    T val[maxsize];
    inline int new_edge(){return (edge_index)?edge[edge_index--]:++cnt;}
    inline int new_node(){return node_index?node[node_index--]:++Heap_size;}
    inline void add(int a,int b){int u=new_edge();to[u]=b,nxxt[u]=head[a],head[a]=u;}
    inline int merge(int u,int v){compare(val[v],val[u])?u^=v^=u^=v:1;add(fa[v]=u,v);return u;}
public:
    Pairing_Heap(){node_index=Heap_size=Root=Top=0;}
    inline void clear(){node_index=Heap_size=Root=Top=0;}
    inline bool empty(){return !Root;}
    inline void push(T v){int u=new_node();val[u]=v;Root=(Root)?merge(Root,u):u;}
    inline T top(){return val[Root];}
    inline void pop()
    {
        register int i;Top=0;
        for(i=head[Root];i;i=nxxt[i]){edge[++edge_index]=i;(fa[to[i]]==Root)?fa[S[++Top]=to[i]]=0:1;}
        fa[Root]=head[Root]=0,node[++node_index]=Root,Root=i=0;
        while(i<Top){++i;if(i==Top){Root=S[i];return ;}int u=S[i],v=S[++i];S[++Top]=merge(u,v);}
    }
};