| Time Limit | $6$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $33$ | 正确数量 | $11$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Set: Range Search
For a set S of integers, perform a sequence of the following operations.
Note that each value in S must be unique. insert(x): Insert x to S and report the number of elements in S after the operation. find(x): Report the number of x in S (0 or 1). delete(x): Delete x from S. dump(L, R): Print elements x in S such that L≤x≤R.
The input is given in the following format.
q
query1
query2
:
queryq
Each query queryi is given by 0 x or 1 x or 2 x or 3 L R where the first digits 0, 1, 2 and 3 represent insert, find, delete and dump operations respectively.
For each insert operation, print the number of elements in S.
For each find operation, print the number of specified elements in S.
For each dump operation, print the corresponding elements in ascending order. Print an element in a line.
9
0 1
0 2
0 3
2 2
1 1
1 2
1 3
0 4
3 2 4
1
2
3
1
0
1
3
3
4
1≤q≤200,000
0≤x≤1,000,000,000
The total number of elements printed by dump operations does not exceed 1,000,000
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$123 $ms] | AOJ大管家 | 437008 | 2019-06-06 22:33:57 |
| 内存最少[$4136 $KB] | RUBY-WOO | 360290 | 2019-01-16 00:57:59 |
| 第一AC | 计爱玲 | 283132 | 2018-10-08 20:19:32 |
| 第一挑战 | 计爱玲 | 283122 | 2018-10-08 19:56:03 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|