| Time Limit | $2$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $28$ | 正确数量 | $18$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Map: Delete
For a dictionary M that stores elements formed by a pair of a string key and an integer value, perform a sequence of the following operations. Note that each key in M must be unique.
insert(key, x): Insert an element formed by a pair of key and x to M.
get(key): Print the value with the specified key. Print 0 if there is no such element.
delete(key): Delete the element with the specified key.
The input is given in the following format.
q
query1
query2
:
queryq
Each query queryi is given by 0 key x or 1 key or 2 key where the first digits 0, 1 and 2 represent insert, get and delete operations respectively.
8
0 blue 4
0 red 1
0 white 5
1 red
1 blue
2 red
1 black
1 red
1
4
0
0
1≤q≤200,000
1≤x≤1,000,000,000
1≤ length of key ≤20
key consits of lower case letters
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$63 $ms] | 土豆宝 | 294075 | 2018-10-24 12:25:54 |
| 内存最少[$4004 $KB] | bitcoffee | 294730 | 2018-10-25 09:50:02 |
| 第一AC | 计爱玲 | 283169 | 2018-10-08 20:42:30 |
| 第一挑战 | 计爱玲 | 283169 | 2018-10-08 20:42:30 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|---|---|---|
| 1211 | 庆祝2018年10.24世界程序员节日欢乐AC赛(竞赛密码6的二进制)~ | 2018-10-24 10:24:00 | 请登录 |