HDU 4288 Coder
2015-09-23 16:25
381 查看
Coder
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4671 Accepted Submission(s): 1778
Problem Description
In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become increasing popular since the advent of cheap and reliable computers. Many companies now employ a single coder to write
an algorithm that will replace many other employees. An added benefit to the employer is that the coder will also become redundant once their work is done. 1
You are now the signle coder, and have been assigned a new task writing code, since your boss would like to replace many other employees (and you when you become redundant once your task is complete).
Your code should be able to complete a task to replace these employees who do nothing all day but eating: make the digest sum.
By saying “digest sum” we study some properties of data. For the sake of simplicity, our data is a set of integers. Your code should give response to following operations:
1. add x – add the element x to the set;
2. del x – remove the element x from the set;
3. sum – find the digest sum of the set. The digest sum should be understood by
where the set S is written as {a1, a2, ... , ak} satisfying a1 < a2 < a3 < ... < ak
Can you complete this task (and be then fired)?
------------------------------------------------------------------------------
1 See http://uncyclopedia.wikia.com/wiki/Algorithm
Input
There’re several test cases.
In each test case, the first line contains one integer N ( 1 <= N <= 105 ), the number of operations to process.
Then following is n lines, each one containing one of three operations: “add x” or “del x” or “sum”.
You may assume that 1 <= x <= 109.
Please see the sample for detailed format.
For any “add x” it is guaranteed that x is not currently in the set just before this operation.
For any “del x” it is guaranteed that x must currently be in the set just before this operation.
Please process until EOF (End Of File).
Output
For each operation “sum” please print one line containing exactly one integer denoting the digest sum of the current set. Print 0 if the set is empty.
Sample Input
9 add 1 add 2 add 3 add 4 add 5 sum add 6 del 3 sum 6 add 1 add 3 add 5 add 7 add 9 sum
Sample Output
3 4 5 HintC++ maybe run faster than G++ in this problem.
Source
2012 ACM/ICPC Asia Regional Chengdu Online
暴力水过。
#include<cstring> #include<algorithm> #include<cstdio> #include<iostream> #include<vector> #define ll long long using namespace std; int n; char s[10]; vector<int>vec; ll getsum() { ll res=0; for(int i=2; i<vec.size(); i+=5) { res+=vec[i]; } return res; } int main() { // freopen("test.in","r",stdin); while(~scanf("%d",&n)) { vec.clear(); for(int i=0; i<n; i++) { scanf("%s",s); if(s[0]=='s') { printf("%I64d\n",getsum()); continue; } int x; scanf("%d",&x); int id=lower_bound(vec.begin(),vec.end(),x)-vec.begin(); if(s[0]=='a') { vec.insert(vec.begin()+id,x); continue; } vec.erase(vec.begin()+id); } } return 0; }
相关文章推荐
- 正则表达式
- noip2009 分数线划定 (模拟)
- Discuz!X中SESSION机制实例详解
- 易语言相关知识
- STM32使用DMA加串口空闲中断接收数据
- Unity技巧1
- swift -2 元组,函数
- 图像灰度化的三种方法及matlab,c++,python实现
- gcc -Wl,-M=helloworld.map,--cref
- LinuxSystemProgramming-Syllabus
- NSTimer注意内存泄露(真该死)
- SQL工具类
- mssqlserver修改表名,列名,添加表列,删除表列,修改表列类型
- x11vnc 安装与配置(转)
- PAT(甲级)1010
- FFmpeg demuxing api 中文文档
- Maven的配置文件pom.xml
- kvo使用方法简述
- WebLogic - Enabling Auto Login by Using the Boot Identity File
- linux dd 测试硬盘的读写性能