POJ 3225 - Help with Intervals(线段树)
来源:互联网 发布:枭龙战斗机知乎 编辑:程序博客网 时间:2024/06/05 20:38
Description
LogLoader, Inc. is a company specialized in providing products for analyzing logs. While Ikki is working on graduation design, he is also engaged in an internship at LogLoader. Among his tasks, one is to write a module for manipulating time intervals, which have confused him a lot. Now he badly needs your help.
In discrete mathematics, you have studied several basic set operations, namely union, intersection, relative complementation and symmetric difference, which naturally apply to the specialization of sets as intervals.. For your quick reference they are summarized in the table below:
Operation Notation UnionA ∪ B{x : x ∈ A or x ∈ B}IntersectionA ∩ B{x : x ∈ A and x ∈ B}Relative complementationA − B{x : x ∈ A but B}Symmetric differenceA ⊕ B(A − B) ∪ (B − A) Definition
Ikki has abstracted the interval operations emerging from his job as a tiny programming language. He wants you to implement an interpreter for him. The language maintains a set S, which starts out empty and is modified as specified by the following commands:
Command Semantics U
TS ← S ∪ TI
TS ← S ∩ TD
TS ← S − TC
TS ← T − SS
TS ← S ⊕ T
Input
The input contains exactly one test case, which consists of between 0 and 65,535 (inclusive) commands of the language. Each command occupies a single line and appears like
X
T
where X
is one of ‘U
’, ‘I
’, ‘D
’, ‘C
’ and ‘S
’ and T is an interval in one of the forms (
a,
b)
, (
a,
b]
, [
a,
b)
and [
a,
b]
(a, b ∈ Z, 0 ≤ a ≤ b ≤ 65,535), which take their usual meanings. The commands are executed in the order they appear in the input.
End of file (EOF) indicates the end of input.
Output
Output the set S as it is after the last command is executed as the union of a minimal collection of disjoint intervals. The intervals should be printed on one line separated by single spaces and appear in increasing order of their endpoints. If S is empty, just print “empty set
” and nothing else.
Sample Input
U [1,5]D [3,3]S [2,4]C (1,5)I (2,3]
Sample Output
#include <stdio.h>#include <string.h>#include <algorithm>#include <cctype>using namespace std;const int maxn = 65535 * 2;#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1int cover[maxn<<2] = { 0 }, XOR[maxn<<2] = { 0 };bool vis[maxn << 2] = { false };void toXOR(int rt){if (cover[rt] != -1) cover[rt] ^= 1;else XOR[rt] ^= 1;}void PushDown(int rt){if (cover[rt] != -1){cover[rt << 1] = cover[rt << 1 | 1] = cover[rt];XOR[rt << 1] = XOR[rt << 1 | 1] = 0;cover[rt] = -1;}if (XOR[rt]){toXOR(rt << 1);toXOR(rt << 1 | 1);XOR[rt] = 0;}}void update(char op, int L, int R, int l, int r, int rt){if (L <= l&&r <= R){if (op == 'U'){cover[rt] = 1;XOR[rt] = 0;}else if (op == 'D'){cover[rt] = 0;XOR[rt] = 0;}else if (op == 'S'){toXOR(rt);}return;}if (l == r) return;PushDown(rt);int m = (l + r) >> 1;if (L <= m) update(op, L, R, lson);if (R > m) update(op, L, R, rson);}void query(int l, int r, int rt){if (cover[rt] == 1){for (int i = l; i <= r; i++)vis[i] = true;return;}if (cover[rt] == 0) return;if (l == r) return;PushDown(rt);int m = (l + r) >> 1;query(lson);query(rson);}int main(){char op, l, r;int a, b;//freopen("d:\\test.txt", "r",stdin);while (~scanf("%c %c%d,%d%c\n", &op, &l, &a, &b, &r)){a *= 2; b *= 2;if (l == '(') a++;if (r == ')') b--;if (op == 'U' || op == 'D' || op == 'S') update(op, a, b, 0, maxn, 1);else if (op == 'I'){if (a != 0)update('D', 0, a - 1, 0, maxn, 1);if (b != maxn)update('D', b + 1, maxn, 0, maxn, 1);}else if (op == 'C'){if (a != 0)update('D', 0, a - 1, 0, maxn, 1);if (b != maxn)update('D', b + 1, maxn, 0, maxn, 1);update('S', a, b, 0, maxn, 1);}}query(0, maxn, 1);bool flag = false;int s = -1, e;for (int i = 0; i <= maxn; i++){if (vis[i]){if (s == -1) s = i;e = i;}else if (s != -1){if (flag) printf(" ");flag = true;printf("%c%d,%d%c", s & 1 ? '(' : '[', s / 2, (e + 1) / 2, e & 1 ? ')' : ']');s = -1;}}if (!flag) printf("empty set");puts("");return 0;}
- POJ 3225 Help with Intervals 线段树
- POJ 3225 Help with Intervals 线段树
- POJ 3225 Help with Intervals 线段树
- poj 3225 Help with Intervals[线段树]
- POJ-3225 Help with Intervals 线段树
- POJ 3225 Help with Intervals (线段树)
- poj 3225 Help with Intervals (线段树)
- poj 3225 Help with Intervals(线段树)
- POJ 3225 Help with Intervals 线段树
- POJ 3225 Help with Intervals 【线段树】
- POJ 3225 Help with Intervals(线段树)
- POJ 3225 Help with Intervals (线段树,区间更新)
- POJ 3225 Help with Intervals(线段树)
- poj 3225 Help with Intervals(线段树区间更新)
- poj 3225 Help with Intervals(线段树)
- POJ 3225 - Help with Intervals(线段树)
- poj 3225 Help with Intervals(线段树+区间更新)
- POJ 3225 Help with Intervals 线段树 成段更新
- Hive入门--4.flume-数据收集工具
- java 检测 Java 是否运行在64bit 的JVM上(未测试)
- Net操作Excel(终极方法NPOI)
- java 使用java执行命令简易封装类(未测试)
- sharepoint 2016 学习系列篇(20)-文档库应用篇-(2)在文档库中创建文件夹
- POJ 3225 - Help with Intervals(线段树)
- 官方样例ExamplesWPFFileTransfer
- RecyclerView万能的Adapter
- 本地广播LocalBroadcastManager,和全局广播有什么区别
- ClassLoader Java 获取当前类文件所在的路径(未测试)
- java内部类
- 第六部分:自定义控件,ListView详解,提升ListView运行效率,为ListView添加点击事件监听器
- C# 读COM PORT
- Excel hander