ZOJ Problem Set - 4016 Mergeable Stack

题目连接

题意

有N个栈，三种操作。

• 1 a b 在栈a中压入b
• 2 a 弹出栈a的栈顶元素，若a栈为空，则输出"EMPTY"，否则输出被弹出的栈顶元素。
• 3 a b 将b栈中的元素移到a栈上

思路

用STL 的stack 会 超时
用LIST 或 链表

Code

#include <stdio.h>
#include <iostream>
using namespace std;
const int N = 400100;

int n,m;

typedef int ElemType;
typedef struct Node{
    ElemType data;
    struct Node* next;
}Node;

typedef struct Link{
    Node* front;
    Node* back;
    int size;
}Link;

Link L[N];

void LinkInit(Link &L){
    L.front = new Node;
    L.front->next = NULL;
    L.back = L.front;
    L.size = 0;
    return ;
}

void LinkPush(Link &L, ElemType data){
    Node* t = new Node;
    t->next = NULL;
    t->data = data;
    if(L.size == 0){
        t->next = L.front->next;
        L.front->next = t;
        L.back = t;
    }
    else{
        t->next = L.front->next;
        L.front->next = t;
    }
    L.size++;
    return ;
}

ElemType LinkPop(Link &L){
    ElemType data;
    Node *t;
    if(L.size == 0)
        return -1;
    else if(L.size == 1){
        t = L.front->next;
        L.front->next = L.front->next->next;
        L.back = L.front;
    }
    else{
        t = L.front->next;
        L.front->next = L.front->next->next;
    }
    L.size--;
    data = t->data;
    delete t;
    return data;
}

void LinkMerge(Link &a, Link &b){
    if(b.size == 0)
        return ;
    if(a.size == 0){
        a.front->next = b.front->next;
        a.back = b.back;
        a.size = b.size;
        b.front->next = NULL;
        b.back = b.front;
        b.size = 0;
        return ;
    }
    else{
        b.back->next = a.front->next;
        a.front->next = b.front->next;
        b.front->next = NULL;
        b.back = b.front;
        a.size += b.size;
        b.size = 0;
    }
}

void Sfree(){
    for(int i=1;i<=n;i++){
        delete L[i].front;
    }
}

void SInit(){
    for(int i=1;i<=n;i++){
        LinkInit(L[i]);
    }
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int i;
        scanf("%d%d",&n,&m);
        SInit();
        for(i=0;i<m;i++){
            int op,a,b;
            scanf("%d",&op);
            if(op == 1){
                scanf("%d%d",&a,&b);
                LinkPush(L[a],b);
            }
            else if(op == 2){
                int ans;
                scanf("%d",&a);
                ans = LinkPop(L[a]);
                if(ans == -1)
                    printf("EMPTY\n");
                else
                    printf("%d\n",ans);
            }
            else{
                scanf("%d%d",&a,&b);
                LinkMerge(L[a],L[b]);
            }
        }
        Sfree();
    }
    return 0;
}

• 两个栈合并时，要考虑被合并栈的是否为空栈，若不考虑的话，被合并的栈的尾指针就无法更新