HDU 5818 Joint Stacks联合栈

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

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.

栈是一种数据结构,仅允许在其中一端进行插入和删除,这一端被称为栈顶。最后入栈的元素将会最先出栈。换句话说,这个操作就是后进先出(LIFO)。

一个可合并的栈拥有"merge"操作。有如下三种操作:

- push A x: 将 x 插入栈 A

- pop A: 弹出 A 的栈顶元素

- merge A B: 合并栈 A 与 B

执行"merge A B"操作后,栈A将获得B中全部元素,随后B则为空。新栈中的元素根据先前的入栈时间重新排列,如同再执行他们的"push"操作到一个栈。参考输入/输出样例的详细说明。

给定两个可合并栈A与B,执行上述操作。

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.

多组测试用例。对于每个测试用例,第一行有一个整数N(0<N≤105),表示操作的数量。随后N行,每行包含一个"push"、 "pop"或"merge"指令。栈中的元素都是32位整数。保证"pop"操作不会出现在空栈中。N = 0时输入结束。

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.

对于每个用例,输出一行"Case #t:",t表示用例编号(从1开始)。对于每个"pop"操作,输出出栈的元素在单独一行。

Sample Input - 输入样例

Sample Output - 输出样例

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

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

【题解】

使用三个优先队列,一个给A,一个B,一个给合并的部分。

当A/B为空的时候,就从合并的部分取。

只用AB的话,感觉就不靠谱,懒癌发作,不想试。

【代码 C++】

  1. #include <cstdio>
  2. #include <queue>
  3. #define mx 100005
  4. int data[mx], id;
  5. int main(){
  6. int t = , n, x;
  7. char op[], o;
  8. while (scanf("%d", &n), n){
  9. printf("Case #%d:\n", t++); id = -;
  10. std::priority_queue<int, std::vector<int> > a, b, m;
  11.  
  12. while (n--){
  13. scanf("%s", op); getchar();
  14. if (op[] == 'u'){
  15. scanf("%c%d", &o, &data[++id]);
  16. if (o == 'A') a.push(id);
  17. else b.push(id);
  18. }
  19. else if (op[] == 'o'){
  20. if (getchar() == 'A'){
  21. if (a.empty()) x = data[m.top()], m.pop();
  22. else x = data[a.top()], a.pop();
  23. }
  24. else{
  25. if (b.empty()) x = data[m.top()], m.pop();
  26. else x = data[b.top()], b.pop();
  27. }
  28. printf("%d\n", x);
  29. }
  30. else{
  31. for (gets(op); !a.empty(); a.pop()) m.push(a.top());
  32. while (!b.empty()) m.push(b.top()), b.pop();
  33. }
  34. }
  35. }
  36. return ;
  37. }

HDU 5818 Joint Stacks(联合栈)的更多相关文章

  1. HDU 5818 Joint Stacks ——(栈的操作模拟,优先队列)

    题意:有两个栈A和B,有3种操作:push,pop,merge.前两种都是栈的操作,最后一种表示的是如果“merge A B”,那么把B中的元素全部放到A中,且满足先入后出的栈原则. 分析:显然,我们 ...

  2. HDU 5818 Joint Stacks (优先队列)

    Joint Stacks 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5818 Description A stack is a data stru ...

  3. HDU 5818 Joint Stacks

    Joint Stacks Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Tota ...

  4. hdu 5818 Joint Stacks (优先队列)

    Joint Stacks Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Tota ...

  5. HDU 5818 Joint Stacks(左偏树)

    [题目链接] http://acm.hdu.edu.cn/showproblem.php?pid=5818 [题目大意] 给出两个栈A B(初始时为空),有三种操作: push.pop.merge. ...

  6. HDU - 5818 Joint Stacks 比较大の模拟,stack,erase

    https://vjudge.net/problem/HDU-5818 题意:给你两个栈AB,有常规push,pop操作,以及一个merge操作,merge A B 即将A.B的元素按照入栈顺序全部出 ...

  7. HDU 5818:Joint Stacks(stack + deque)

    http://acm.hdu.edu.cn/showproblem.php?pid=5818 Joint Stacks Problem Description   A stack is a data ...

  8. 2016暑假多校联合---Joint Stacks (STL)

    HDU  5818 Problem Description A stack is a data structure in which all insertions and deletions of e ...

  9. 暑假练习赛 004 E Joint Stacks(优先队列模拟)

    Joint StacksCrawling in process... Crawling failed Time Limit:4000MS     Memory Limit:65536KB     64 ...

随机推荐

  1. IOS程序常用目录

    <Home>/AppName.app   应用程序本身包目录 <Home>/Documents/       应用程序的重要数据文件和用户数据文件等都放在这个目录, iTune ...

  2. ILOG的一个基本应用——解决运输问题、转运问题

    一.Ilog软件 该软件用来解决优化问题,大部分是线性问题,深一点的其他内容还不清楚.只知道一些基础的应用,网上相关内容很少.接下来就解决一个简单的运输问题 二.运输问题 数学模型 ILOG OPL程 ...

  3. 【python cookbook】【字符串与文本】16.以固定的列数重新格式化文本

    问题:重新格式化一些很长的字符串,以指定的列数来显示 解决方案:textwrap模块的fill()方法来实现 # A long string s = "Look into my eyes, ...

  4. 161012、JAVA读写文件,如何避免中文乱码

    1.JAVA读取文件,避免中文乱码. /** * 读取文件内容 * * @param filePathAndName * String 如 c:\\1.txt 绝对路径 * @return boole ...

  5. Angular.js为什么如此火呢?

    在本文中让我们来逐步发掘angular为什么如此火: Angular.js 是一个MV*(Model-View-Whatever,不管是MVC或者MVVM,统归MDV(model Drive View ...

  6. Hive报错之java.sql.SQLException: Field 'IS_STOREDASSUBDIRECTORIES' doesn't have a default value

    在创建表的时候报出如下错误: hive> create table if not exists testfile_table( > site string, > url string ...

  7. JavaEE基础(五)

    1.Java语言基础(数组概述和定义格式说明) A:为什么要有数组(容器) 为了存储同种数据类型的多个值 B:数组概念 数组是存储同一种数据类型多个元素的集合.也可以看成是一个容器. 数组既可以存储基 ...

  8. POJ 2192 :Zipper(DP)

    http://poj.org/problem?id=2192 Zipper Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1 ...

  9. poj1987 Distance Statistics

    普通dfs访问每个点对的复杂度是O(n^2)的,显然会超时. 考虑访问到当前子树的根节点时,统计所有经过根的点(u, v)满足: dist(u) + dist(v) <= maxd,并且 bel ...

  10. StringBuild,StringFormat," "+" " 三种方法速度测试

    测试方式: Stopwatch sw = new Stopwatch(); sw.Start(); string tmp = ""; StringBuilder sb = new ...