| Time Limit | $2$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $45$ | 正确数量 | $10$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Set: 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).
The input is given in the following format.
q
query1
query2
:
queryq
Each query queryi is given by 0 x or 1 x where the first digits 0 and 1 represent insert and find 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.
7
0 1
0 2
0 3
0 2
0 4
1 3
1 10
1
2
3
3
4
1
0
1≤q≤200,000
0≤x≤1,000,000,000
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$49 $ms] | AOJ大管家 | 436972 | 2019-06-06 21:08:05 |
| 内存最少[$0 $KB] | Qiqy | 609022 | 2020-07-31 09:16:15 |
| 第一AC | 计爱玲 | 283056 | 2018-10-08 18:40:24 |
| 第一挑战 | 计爱玲 | 283056 | 2018-10-08 18:40:24 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|