Problem 2630 --Set - Multi-Set

2630: Set - Multi-Set

"
Time Limit $6$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $19$ 正确数量 $9$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

Multi-Set 

For a set S of integers, perform a sequence of the following operations. 

Note that multiple elements can have equivalent values in S. 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. delete(x): Delete all x from S. dump(L, R): Print elements x in S such that L≤x≤R.

The input is given in the following format. 

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.

10
0 1
0 1
0 2
0 3
2 2
1 1
1 2
1 3
0 4
3 1 4
1
2
3
4
2
0
1
4
1
1
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 

The sum of numbers printed by find operations does not exceed 2,000,000

推荐代码 查看2630 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$130 $ms] AOJ大管家 437009 2019-06-06 22:37:23
内存最少[$5060 $KB] 刘欢@计算机科学与技术161 423924 2019-05-11 12:26:37
第一AC 却又像风捉摸不住 326055 2018-11-23 14:41:29
第一挑战 计爱玲 283129 2018-10-08 20:16:48

赛题来源/所属竞赛 会津大学《C++ Programming II》 C++程序设计(高级)

竞赛编号 竞赛名称 竞赛时间 访问比赛