# 「BZOJ 3578」GTY的人类基因组计划2-Hash

$n$ 个人来做实验，有 $m$ 个房间，一开始所有人都在 $1$ 号房间里，有两个操作：

1. 让第 $i$ 个人去房间 $j$
2. 让区间 $[l,r]$ 的房间做实验

# 「CF-633C」Spy Syndrome 2-Hash+map

After observing the results of Spy Syndrome, Yash realised the errors of his ways. He now believes that a super spy such as Siddhant can’t use a cipher as basic and ancient as Caesar cipher. After many weeks of observation of Siddhant’s sentences, Yash determined a new cipher technique.

For a given sentence, the cipher is processed as:

# 「POJ-2945」Find the Clones-map

Doubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human experiments, the aliens cloned the victims, and released multiple copies of them back in Doubleville. So now it might happen that there are 6 identical person named Hugh F. Bumblebee: the original person and its 5 copies. The Federal Bureau of Unauthorized Cloning (FBUC) charged you with the task of determining how many copies were made from each person. To help you in your task, FBUC have collected a DNA sample from each person. All copies of the same person have the same DNA sequence, and different people have different sequences (we know that there are no identical twins in the town, this is not an issue).

# 「SuperOJ 773」集合的运算

### 题目描述

（1）“∪”运算：设 S，T 是 2 个集合，那么 S∪T 是由 S 和 T 的元素组成的集合。
（2）“-”运算：设 S，T 是 2 个集合，那么 S-T 是由 S 中非 T 中的元素组成的集合。
（3）“∩”运算：设 S，T 是 2 个集合，那么 S∩T 是由既是 S 又是 T 的元素组成的集合。

# 「SuperOJ 382」连线游戏

## 连线游戏

### 题目描述

Farmer John 最近发明了一个游戏，来考验自命不凡的贝茜。游戏开始的时候，FJ会给贝茜一块画着 $N(2 \leq N \leq 200)$ 个不重合的点的木板，其中第 $i$ 个点的横,纵坐标分别为 $X_i$ 和 $Y_i (-1000 \leq X_i, Y_i \leq 1000)$。