1218. settest

Description

初始有一空集，然后对这个集合共有 n 次操作，每次给定一个集合以及操作名称（并: + / 差: - / 交: *）。每个操作完成后输出当前集合所有元素（均为整数，从小到大输出）。

Input Format

第 1 行: 一个数, n

第 2…(n + 1) 行: 每行首先一个字符 c （+/-/*），表示当前操作名称.

接下来一个整数 m，表示给定的集合元素个数.

接下来 m 个整数，给定这个集合里所有元素。

Output Format

输出共 n 行: 每行按照元素从小到大的顺序输出在执行完当前操作后你手上集合的所有元素。

Sample Input:

Sample Output:

Limits

n, m <= 100

用自行编写的栈stack和二叉查找树实现如下：

#include <iostream>using namespace std;template<class elemType>
class stack {public:virtual bool isEmpty() const = 0;virtual void push(const elemType &x) = 0;virtual elemType pop() = 0;virtual elemType top() const = 0;virtual ~stack() {};
};template<class elemType>
class linkStack : public stack<elemType> {private:struct node {elemType data;node *next;node(const elemType &x, node *N = NULL) {data = x;next = N;}node() : next(NULL) {}~node() {}};node *top_p;
public:linkStack() {top_p = NULL;}~linkStack() {node *tmp;while (top_p != NULL) {tmp = top_p;top_p = top_p->next;delete tmp;}}bool isEmpty() const {return top_p == NULL;}void push(const elemType &x) {top_p = new node(x, top_p);}elemType pop() {node *tmp = top_p;elemType x = tmp->data;top_p = top_p->next;delete tmp;return x;}elemType top() const {return top_p->data;}
};template<class Type>
class BinarySearchTree {private:struct BinaryNode {Type data;BinaryNode *left;BinaryNode *right;BinaryNode(const Type &thedata, BinaryNode *lt, BinaryNode *rt) : data(thedata), left(lt), right(rt) {}};struct StNode {BinaryNode *node;int TimesPop;StNode(BinaryNode *N = NULL) : node(N), TimesPop(0) {}};BinaryNode *root;void insert(const Type &x, BinaryNode *&t);void remove(const Type &x, BinaryNode *&t);bool find(const Type &x, BinaryNode *t) const;void clear(BinaryNode *&t);public:BinarySearchTree(BinaryNode *t = NULL) { root = t; }~BinarySearchTree() { makeEmpty(root); }bool find(const Type &x) const { return find(x, root); }void insert(const Type &x) { insert(x, root); }void remove(const Type &x) { remove(x, root); }void midOrder() const;void clear() {clear(root);}bool isEmpty() const {return root == NULL;}
};template<class T>
void BinarySearchTree<T>::clear(BinarySearchTree<T>::BinaryNode *&t) {if (t == NULL) return;clear(t->left);clear(t->right);delete t;t = NULL;
}template<class Type>
void BinarySearchTree<Type>::midOrder() const {if (root == NULL)return;linkStack<StNode> s;StNode current(root);s.push(current);while (!s.isEmpty()) {current = s.top();s.pop();if (++current.TimesPop == 2) {cout << current.node->data << " ";if (current.node->right != NULL)s.push(StNode(current.node->right));} else {s.push(current);if (current.node->left != NULL)s.push(StNode(current.node->left));}}
}template<class Type>
bool BinarySearchTree<Type>::find(const Type &x, BinarySearchTree<Type>::BinaryNode *t) const {if (t == NULL)return false;else if (x < t->data)return find(x, t->left);else if (t->data < x)return find(x, t->right);else return true;
}template<class Type>
void BinarySearchTree<Type>::insert(const Type &x, BinarySearchTree<Type>::BinaryNode *&t) {if (t == NULL)t = new BinaryNode(x, NULL, NULL);else if (x <= t->data)insert(x, t->left);else if (t->data < x)insert(x, t->right);
}template<class Type>
void BinarySearchTree<Type>::remove(const Type &x, BinarySearchTree<Type>::BinaryNode *&t) {if (t == NULL)return;if (x < t->data)remove(x, t->left);else if (t->data < x)remove(x, t->right);else if (t->left != NULL && t->right != NULL) {BinaryNode *tmp = t->right;while (tmp->left != NULL)tmp = tmp->left;t->data = tmp->data;remove(t->data, t->right);} else {BinaryNode *oldNode = t;t = (t->left != NULL) ? t->left : t->right;delete oldNode;}
}int main() {BinarySearchTree<int> *tree = new BinarySearchTree<int>();int numOfOperation;cin >> numOfOperation;for (int j = 0; j < numOfOperation; ++j) {char a;int b;cin >> a >> b;if (a == '+') {for (int i = 0; i < b; ++i) {int num;cin >> num;if (!tree->find(num)) {tree->insert(num);}}if (!tree->isEmpty()) {tree->midOrder();}cout << endl;} else if (a == '-') {for (int i = 0; i < b; ++i) {int num;cin >> num;if (tree->find(num)) {tree->remove(num);}}if (!tree->isEmpty()) {tree->midOrder();}cout << endl;} else {int num[b];for (int i = 0; i < b; ++i) {cin >> num[i];if (!tree->find(num[i])) {num[i] = -10000;}}tree->clear();for (int i = 0; i < b; ++i) {if (num[i] != -10000) {tree->insert(num[i]);}}if (!tree->isEmpty()) {tree->midOrder();}cout << endl;}}return 0;
}

注意：这里只是能在OJ上跑通，但在求交集的算法仍然存在问题。

1218. settest相关推荐

信息学奥赛一本通（1218：取石子游戏）
1218:取石子游戏时间限制: 1000 ms 内存限制: 65536 KB 提交数: 8837 通过数: 4144 [题目描述] 有两堆石子,两个人轮流去取.每次取的时候, ...
1218 图片对齐模式
1218 图片对齐模式行线图片对齐模式作用于img标签上
1218 鼠标样式 cursor
1218 鼠标样式 cursor 示例代码 .p1{cursor: default;}.p2{cursor: pointer;}.p3{cursor: move;}.p4{cursor: text;} ...
1218 溢出设置 overflow
1218 溢出设置 overflow overflow属性元素益出设置 overflow值 visible,可见的 hidden,隐藏 scroll,滚动条 auto,自动显示滚动条
熟悉HTML基本标签的分类测试分析 1218
熟悉HTML基本标签的分类测试分析 1218 01 02
ktv 上传图片 1218
ktv 上传图片 1218 打开会话框. 效果文件图片OK事件文件的路径与文件的名称图片盒子图片指定给一个图片的绝对路径.... 验证图片的格式
uestc oj 1218 Pick The Sticks (01背包变形)
题目链接:http://acm.uestc.edu.cn/#/problem/show/1218 给出n根木棒的长度和价值,最多可以装在一个长 l 的容器中,相邻木棒之间不允许重叠,且两边上的木棒,可 ...
1218: 青蛙（三）
1218: 青蛙(三) 1.描述青蛙一族的长老蛤蟆文太也知道一只青蛙一张嘴两只眼睛四条腿,但青蛙就是青蛙,他想请你帮他算出来有多少只青蛙,你敢不算么?小心蛤蟆文太揍你-- 蛤蟆文太在此. 输入多组 ...
NBUT 1218 You are my brother
[1218] You are my brother 时间限制: 1000 ms 内存限制: 131072 K 问题描述 Little A gets to know a new friend, Litt ...