hdu5818 Joint Stacks（优先队列）

思路：直接用两个优先队列模拟操作，然后一点优化就是每次merge都是把小的往大的插，这样复杂度的期望应该是nlogn的

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=1e5+10;
const int INF=0x3f3f3f3f;
int cas=1,T;
struct node
{
    int ti,val;
    bool operator< (const node&a) const 
    {
        return ti<a.ti;
    }
};
int main()
{
    //freopen("1.in","w",stdout);
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    //scanf("%d",&T);
    int Q;
    while(scanf("%d",&Q)==1&&Q)
    {
        priority_queue<node>q[2];
        int d=0;
        printf("Case #%d:\n",cas++);
        for(int i=1;i<=Q;i++)
        {
            char s[10],c[2];
            int x;
            scanf("%s%s",s,c);
            if(!strcmp(s,"push"))
            {
                scanf("%d",&x);
                if(c[0]=='A') q[d].push(node{i,x});
                else q[d^1].push(node{i,x});
            }
            else if(!strcmp(s,"pop"))
            {
                if(c[0]=='A')
                {
                    printf("%d\n",q[d].top().val);
                    q[d].pop();
                }
                else
                {
                    printf("%d\n",q[d^1].top().val);
                    q[d^1].pop();
                }
            }
            else
            {
                scanf("%s",s);
                if(q[d].size()>q[d^1].size())
                {
                    while(!q[d^1].empty())
                    {
                        q[d].push(q[d^1].top());
                        q[d^1].pop();
                    }
                    if(c[0]!='A') d^=1;
                }
                else
                {
                    while(!q[d].empty())
                    {
                        q[d^1].push(q[d].top());
                        q[d].pop();
                    }
                    if(c[0]=='A') d^=1;
                }
            }
        }
    }
    //printf("time=%.3lf\n",(double)clock()/CLOCKS_PER_SEC);
    return 0;
}

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