Cod sursa(job #2163188)

Utilizator UnseenMarksmanDavid Catalin UnseenMarksman Data 12 martie 2018 17:04:33
Problema Heapuri Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.41 kb
#include <cstdio>
#define NMAX 200002
using namespace std;

int q, L, NR;
int A[NMAX], Heap[NMAX], Pos[NMAX];

void push(int x)
{
    int aux;

    while(x/2 && A[Heap[x]]<A[Heap[x/2]])
    {
        aux=Heap[x];
        Heap[x]=Heap[x/2];
        Heap[x/2]=aux;

        Pos[Heap[x]]=x;
        Pos[Heap[x/2]]=x/2;
        x=x/2;
    }
}

void pop(int x)
{
    int aux, y=0;

    while(x!=y)
    {
        y=x;

        if(y*2<=L && A[Heap[x]]>A[Heap[y*2]]) x=y*2;
        if(y*2+1<=L && A[Heap[x]]>A[Heap[y*2+1]]) x=y*2+1;

        aux=Heap[x];
        Heap[x]=Heap[y];
        Heap[y]=aux;

        Pos[Heap[x]]=x;
        Pos[Heap[y]]=y;
    }
}

int main()
{
    freopen("heapuri.in", "r", stdin);
    freopen("heapuri.out", "w", stdout);

    int cod,x;
    scanf("%d", &q);
    while(q)
    {
        scanf("%d", &cod);

        if(cod==1)
        {
            scanf("%d", &x);
            L++;NR++;
            A[NR]=x;
            Heap[L]=NR;
            Pos[NR]=L;
            push(L);
        }

        if(cod==2)
        {
            scanf("%d", &x);
            A[x]=-1;
            push(Pos[x]);

            Pos[Heap[1]]=0;
            Heap[1]=Heap[L--];
            Pos[Heap[1]]=1;
            if(L>1) pop(1);
        }

        if(cod==3)
        {
            printf("%d\n", A[Heap[1]]);
        }

        q--;
    }
    return 0;
}