| Time Limit | $12$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $27$ | 正确数量 | $18$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Map: Search
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. If there is an element with key, replace the corresponding value with x.
get(key): Print the value 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 where the first digits 0, 1 represent insert and get operations respectively.
7
0 blue 4
0 red 1
0 white 5
1 red
1 blue
0 black 8
1 black
1
4
8
1≤q≤200,000
1≤x≤1,000,000,000
1≤ length of key ≤20 key consits of lower-case letter
For a get operation, the element with the specified key exists in M.
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$112 $ms] | AOJ大管家 | 437010 | 2019-06-06 22:55:17 |
| 内存最少[$0 $KB] | Qiqy | 609039 | 2020-07-31 15:36:48 |
| 第一AC | 计爱玲 | 283152 | 2018-10-08 20:33:46 |
| 第一挑战 | 计爱玲 | 283152 | 2018-10-08 20:33:46 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|---|---|---|
| 1205 | 2018-2019-1学期安徽科技学院程序设计周赛 | 2018-10-21 17:00:00 | 请登录 |