zoj4016 Mergeable Stack

学学c++的list

c++：(借鉴了别人的)

//stackµÄ±àºÅÒ²ÐíÒªÀëÉ¢»¯ 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <algorithm>
#include <iostream>
using namespace std;
const long maxn=3e5+5;

list<long> li[maxn];

int main()
{
    long ci,n,q,m,s,v,t,i;
    scanf("%ld",&ci);
    while (ci--)
    {
        scanf("%ld%ld",&n,&q);
        for (i=1;i<=n;i++)
            li[i].clear();
        while (q--)
        {
            scanf("%ld",&m);
            if (m==1)
            {
                scanf("%ld%ld",&s,&v);
                li[s].push_back(v);
            }
            else if (m==2)
            {
                scanf("%ld",&s);
                if (li[s].empty())
                    printf("EMPTY
");
                else
                {
                    printf("%ld
",li[s].back());
                    li[s].pop_back();
                }
            }
            else
            {
                scanf("%ld%ld",&s,&t);
                li[s].splice(li[s].end(),li[t]);
            }
        }
    }
    return 0;
}

写栈(包含释放空间)：(易写错)

//stack的编号也许要离散化 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <iostream>
using namespace std;
const long maxn=3e5+5;

struct node
{
    long d;
    struct node *next;
}*p,*r,*b[maxn],*e[maxn];

int main()
{
    long ci,n,q,m,s,v,t,i;
    scanf("%ld",&ci);
    while (ci--)
    {
        scanf("%ld%ld",&n,&q);
        for (i=1;i<=n;i++)
        {
            p=b[i];
            while (p)
            {
                r=p;
                p=p->next;
                free(r);
            }
            b[i]=NULL;
            e[i]=NULL;
        }
        while (q--)
        {
            scanf("%ld",&m);
            if (m==1)
            {
                scanf("%ld%ld",&s,&v);
                p=(struct node *) malloc (sizeof(struct node));
                p->d=v;            
                if (b[s]==NULL)
                {
                    p->next=NULL;
                    b[s]=p;
                    e[s]=p;
                }
                else
                {
                    p->next=b[s];
                    b[s]=p;
                }
            }
            else if (m==2)
            {
                scanf("%ld",&s);
                if (b[s]==NULL)
                    printf("EMPTY
");
                else
                {
                    printf("%ld
",b[s]->d);
                    r=b[s];// 
                    b[s]=b[s]->next;
                    if (b[s]==NULL)
                        e[s]=NULL;
                    free(r);// 
                }
            }
            else
            {
                scanf("%ld%ld",&s,&t);
                if (b[t]!=NULL)
                {
                    if (b[s]==NULL)
                    {
                        e[t]->next=b[s];
                        b[s]=b[t];
                        e[s]=e[t];
                        b[t]=NULL;
                        e[t]=NULL;
                    }
                    else
                    {
                        e[t]->next=b[s];
                        b[s]=b[t];
                        b[t]=NULL;
                        e[t]=NULL;
                    }
                }
            }
        }
    }
    return 0;
}