| Time Limit | $2$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $21$ | 正确数量 | $12$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Set: Delete
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.
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 where the first digits 0, 1 and 2 represent insert, find and delete 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.
8
0 1
0 2
0 3
2 2
1 1
1 2
1 3
0 2
1
2
3
1
0
1
3
1≤q≤200,000
0≤x≤1,000,000,000
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$90 $ms] | AOJ大管家 | 437006 | 2019-06-06 22:25:48 |
| 内存最少[$3952 $KB] | Qiqy | 609024 | 2020-07-31 09:29:19 |
| 第一AC | 计爱玲 | 283083 | 2018-10-08 19:25:24 |
| 第一挑战 | 计爱玲 | 283083 | 2018-10-08 19:25:24 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|