当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
3983：Harry Potter and the Binary Kingdom
题目描述
After defeating the Voldemort, Harry is enjoying his senior year in Hogwarts with his friends. They decide to make a graduation trip, using their newest magical broom. In the journey, Harry is trapped in a Kingdom named Binary Kingdom, maybe because the smart but isolated people still have no idea of the great reputation of this young wizard. Loving numbers and binary very much, the subjects of Binary Kingdom claim only Harry solve the problem can he leave there.
The problem begins with an empty number multi-set, with six kinds of operation:
1. INS M: insert M into the set
2. DEL M: delete all numbers equal to M if any one exists; otherwise report “Del error”
3. ADD M: increase the value of every number by M
4. SUB M: decrease the value of every number by M if after decreasing no number will be less than zero; otherwise report “Sub error”
5. QNUM M: query how many numbers equal to M in the set
6. QBIT M: query how many numbers whose M-th bit is 1 in its binary, M is counting from lower to higher, beginning with 0
Though our brave Harry Potter can proficient in many fields, he is not good at math, now, it’s your time.
The problem begins with an empty number multi-set, with six kinds of operation:
1. INS M: insert M into the set
2. DEL M: delete all numbers equal to M if any one exists; otherwise report “Del error”
3. ADD M: increase the value of every number by M
4. SUB M: decrease the value of every number by M if after decreasing no number will be less than zero; otherwise report “Sub error”
5. QNUM M: query how many numbers equal to M in the set
6. QBIT M: query how many numbers whose M-th bit is 1 in its binary, M is counting from lower to higher, beginning with 0
Though our brave Harry Potter can proficient in many fields, he is not good at math, now, it’s your time.
输入解释
The first line contains a single integer T, indicating the number of test cases.
Each test case begins with an integer M, following M operations.
Technical Specification
1. 1 <= T <= 12
2. 1 <= M <= 100 000
3. The QBIT operations’ M will in the range [0, 17], the other five operations’ M in the range [0, 1 000 000 000].
Each test case begins with an integer M, following M operations.
Technical Specification
1. 1 <= T <= 12
2. 1 <= M <= 100 000
3. The QBIT operations’ M will in the range [0, 17], the other five operations’ M in the range [0, 1 000 000 000].
输出解释
For each test case, output the case number first, then a newline.
If the operation is QNUM or QBIT, output the number.
If the operation is invalid DEL or SUB, output “Del error” or “Sub error”.
After each test case, output a blank line.
If the operation is QNUM or QBIT, output the number.
If the operation is invalid DEL or SUB, output “Del error” or “Sub error”.
After each test case, output a blank line.
输入样例
1 10 INS 1 INS 2 DEL 1 INS 3 DEL 1 ADD 1 SUB 4 QNUM 2 QBIT 1 QBIT 2
输出样例
Case 1: Del error Sub error 0 1 1
来自杭电HDUOJ的附加信息
| Author | iSea@WHU |
| Recommend | lcy |
最后修改于 2020-10-25T23:08:59+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 5000/3000MS(Java/Others) | 65536/65536K(Java/Others) |
登陆或注册以提交代码