HDU 5818 Joint Stacks【优先队列】

Joint Stacks

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1817    Accepted Submission(s): 817

Problem Description

A stack is a data structure in which all insertions and deletions of entries are made at one end, called the "top" of the stack. The last entry which is inserted is the first one that will be removed. In another word, the operations perform in a Last-In-First-Out (LIFO) manner.
A mergeable stack is a stack with "merge" operation. There are three kinds of operation as follows:

- push A x: insert x into stack A
- pop A: remove the top element of stack A
- merge A B: merge stack A and B

After an operation "merge A B", stack A will obtain all elements that A and B contained before, and B will become empty. The elements in the new stack are rearranged according to the time when they were pushed, just like repeating their "push" operations in one stack. See the sample input/output for further explanation.
Given two mergeable stacks A and B, implement operations mentioned above.

 

Input

There are multiple test cases. For each case, the first line contains an integer  N(0<N≤105) , indicating the number of operations. The next N lines, each contain an instruction "push", "pop" or "merge". The elements of stacks are 32-bit integers. Both A and B are empty initially, and it is guaranteed that "pop" operation would not be performed to an empty stack. N = 0 indicates the end of input.

 

Output

For each case, print a line "Case #t:", where t is the case number (starting from 1). For each "pop" operation, output the element that is popped, in a single line.

 

Sample Input

  
  

   
   4
push A 1
push A 2
pop A
pop A
9
push A 0
push A 1
push B 3
pop A
push A 2
merge A B
pop A
pop A
pop A
9
push A 0
push A 1
push B 3
pop A
push A 2
merge B A
pop B
pop B
pop B 
0
  
  

 

Sample Output

  
  

   
   Case #1:
2
1
Case #2:
1
2
3
0
Case #3:
1
2
3
0
  
  

 

三个优先队列：q1和q2为题中的栈，q为公共栈. (即当mercy时，将q1和q2中的元素全部放入q，并清空q1和q2)

实际上只要q为优先队列既可以

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b)  memset(a,b,sizeof(a))
const int M=1e3+10;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
int i,j,k,n,m;

struct node
{
    int no;
    int num;
};
bool operator<(node a,node b)
{
    return a.no<b.no;
}

priority_queue<node>q;
priority_queue<node>q1;
priority_queue<node>q2;

int  main()
{
    int cas=1;
    while(~scanf("%d",&n),n){
           printf("Case #%d:\n",cas++);
           while(!q.empty())q.pop();
           while(!q1.empty())q1.pop();
           while(!q2.empty())q2.pop();
        for(int i=1;i<=n;i++){
            char s[10];
            scanf("%s",s);
            if(strcmp(s,"push")==0){
                char s1[10];
                int aa;
                scanf("%s %d",s1,&aa);
                node cc;
                cc.no=i,cc.num=aa;
                if(s1[0]=='A'){
                  q1.push(cc);
                }
                else {
                    q2.push(cc);
                }
            }
            else if(strcmp(s,"pop")==0){
                char s1[10];
                scanf("%s",s1);
                if(s1[0]=='A'){
                    if(!q1.empty()){
                        node aa=q1.top();
                        printf("%d\n",aa.num);
                        q1.pop();
                    }
                    else {
                        node aa=q.top();
                        printf("%d\n",aa.num);
                        q.pop();
                    }
                }
                else {
                    if(!q2.empty()){
                        node aa=q2.top();
                        printf("%d\n",aa.num);
                        q2.pop();
                    }
                    else {
                        node aa=q.top();
                        printf("%d\n",aa.num);
                        q.pop();
                    }
                }
            }
            else {
                  char s1[10],s2[10];
                  scanf("%s%s",s1,s2);
                   while(!q1.empty()){
                      q.push(q1.top());
                      q1.pop();
                   }
                   while(!q2.empty()){
                      q.push(q2.top());
                      q2.pop();
                   }
            }
        }
    }
    return 0;
}