UVA12096 The SetStack Computer
来源:互联网 发布:犀牛软件材质贴图 编辑:程序博客网 时间:2024/06/05 03:36
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1071 Accepted: 219
Description
Background from Wikipedia: "Set theory is a branch of mathematics created principally by the German mathematician Georg Cantor at the end of the 19th century. Initially controversial, set theory has come to play the role of a foundational theory in modern mathematics, in the sense of a theory invoked to justify assumptions made inmathematics concerning the existence of mathematical objects (such as numbers or functions) and their properties. Formal versions of set theory also have a foundational role to play as specifying a theoretical ideal of mathematical rigor in proofs."
Given this importance of sets, being the basis of mathematics, a set of eccentric theorist set off to construct a supercomputer operating on sets instead of numbers. The initial Set-Stack Alpha is under construction, and they need you to simulate it in order to verify the operation of the prototype.
The computer operates on a single stack of sets, which is initially empty. After each operation, the cardinality of the topmost set on the stack is output. The cardinality of a set S is denoted |S| and is the number of elements in S. The instruction set of the SetStack Alpha is PUSH, DUP, UNION, INTERSECT, and ADD.
and that the next one is
For these sets, we have |A| = 2 and |B| = 2. Then:
Given this importance of sets, being the basis of mathematics, a set of eccentric theorist set off to construct a supercomputer operating on sets instead of numbers. The initial Set-Stack Alpha is under construction, and they need you to simulate it in order to verify the operation of the prototype.
The computer operates on a single stack of sets, which is initially empty. After each operation, the cardinality of the topmost set on the stack is output. The cardinality of a set S is denoted |S| and is the number of elements in S. The instruction set of the SetStack Alpha is PUSH, DUP, UNION, INTERSECT, and ADD.
- PUSH will push the empty set {} on the stack.
- DUP will duplicate the topmost set (pop the stack, and then push that set on the stack twice).
- UNION will pop the stack twice and then push the union of the two sets on the stack.
- INTERSECT will pop the stack twice and then push the intersection of the two sets on the stack.
- ADD will pop the stack twice, add the first set to the second one, and then push the resulting set on the stack.
A = {{}, {{}}}
and that the next one is
B = {{}, {{{}}}}.
For these sets, we have |A| = 2 and |B| = 2. Then:
- UNION would result in the set { {}, {{}}, {{{}}} }. The output is 3.
- INTERSECT would result in the set { {} }. The output is 1.
- ADD would result in the set { {}, {{{}}}, {{},{{}}} }. The output is 3.
Input
An integer 0 ≤ T ≤ 5 on the first line gives the cardinality of the set of test cases. The first line of each test case contains the number of operations 0 ≤ N ≤ 2 000. Then follow N lines each containing one of the five commands. It is guaranteed that the SetStack computer can execute all the commands in the sequence without ever popping an empty stack.
Output
For each operation specified in the input, there will be one line of output consisting of a single integer. This integer is the cardinality of the topmost element of the stack after the corresponding command has executed. After each test case there will be a line with *** (three asterisks).
Sample Input
29PUSHDUPADDPUSHADDDUPADDDUPUNION5PUSHPUSHADDPUSHINTERSECT
Sample Output
001011222***00100***
这道题自己想感觉很麻烦,看书上的题解,讲的很棒。
#include <iostream>#include<cstdio>#include<cstring>#include<set>#include<vector>#include<map>#include<stack>#include<algorithm>using namespace std;typedef set<int> Set;map<Set,int> IDcache;vector<Set> Setcache;int ID(Set x){ if(IDcache.count(x)) return IDcache[x]; Setcache.push_back(x); return IDcache[x]=Setcache.size()-1;}int main(){ int t,n; cin>>t; while(t--) { stack<int> s; cin>>n; for(int i=0;i<n;i++) { string op; cin>>op; if(op[0]=='P') s.push(ID(Set())); else if(op[0]=='D') s.push(s.top()); else { Set x1=Setcache[s.top()]; s.pop(); Set x2=Setcache[s.top()]; s.pop(); Set x; if(op[0]=='U') {//没有inserter(),就会编译错误 set_union(x1.begin(),x1.end(),x2.begin(),x2.end(),inserter(x,x.begin())); } else if(op[0]=='I') { set_intersection(x1.begin(),x1.end(),x2.begin(),x2.end(),inserter(x,x.begin())); } else { x=x2; x.insert(ID(x1)); } s.push(ID(x)); } cout<<Setcache[s.top()].size()<<endl; } cout<<"***"<<endl; } return 0;}
0 0
- UVa12096 The SetStack Computer
- UVA12096 - The SetStack Computer
- UVA12096 The SetStack Computer
- UVa12096 The SetStack Computer
- UVa12096 The SetStack Computer (stack)
- UVA12096 - The SetStack Computer(set + map映射)
- The SetStack Computer(UVa12096&&POJ3121) (集合栈)
- 【紫书】(UVa12096) The SetStack Computer
- UVA12096 The SetStack Computer(栈的应用)
- The SetStack Computer UVA12096 STL set map LRJ做法
- The SetStack Computer UVA12096(集合栈计算机)
- 《算法竞赛入门经典2ndEdition 》例题5-5 集合栈计算机(The SetStack Computer, Uva12096)
- UVA12096 the SetStack Computer(STL中,map,set,vector,stack联合应用)
- 12096 - The SetStack Computer
- The Setstack Computer
- 12096 - The SetStack Computer
- UVA_12096: The SetStack Computer
- 12096 - The SetStack Computer
- java借助于JNI调用c/c++动态链接库
- ios 单例(arc版本)
- HDU 5349 MZL's simple problem(优先队列)
- Scala学习之数组的进一步认识
- hdu 5349 MZL's simple problem(水)
- UVA12096 The SetStack Computer
- Wireshark远程抓包
- 刷新界面
- 南邮 OJ 1399 Monkey Vines
- chgrp&chown
- Linkedin工程师是如何优化他们的Java代码的
- 启动sql server 混合验证方式
- This is an A+B Problem SDUT 2613
- iOS培训-UI用户界面基础-界面推送