HDOJ题目4288 Coder(vector)
来源:互联网 发布:perl安装 linux 编辑:程序博客网 时间:2024/06/04 19:26
Coder
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3627 Accepted Submission(s): 1414
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
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).
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
9add 1add 2add 3add 4add 5sumadd 6del 3sum6add 1add 3add 5add 7add 9sum
Sample Output
345HintC++ maybe run faster than G++ in this problem.
#include<stdio.h>#include<string.h>#include<vector>#include<iostream>#include<algorithm>using namespace std;int main(){int n;while(scanf("%d",&n)!=EOF){char s[5];vector<int>v;vector<int>::iterator it;while(n--){scanf("%s",s);if(s[0]=='a'){int x;scanf("%d",&x);it=lower_bound(v.begin(),v.end(),x);v.insert(it,x);}elseif(s[0]=='d'){int x;scanf("%d",&x);it=lower_bound(v.begin(),v.end(),x);v.erase(it);}else{__int64 sum=0;for(int i=2;i<v.size();i+=5){sum+=v[i];}printf("%I64d\n",sum);}}}}
Source
2012 ACM/ICPC Asia Regional Chengdu Online
Recommend
liuyiding | We have carefully selected several similar problems for you: 4297 4289 4290 4291 4292
ac代码
0 0
- HDOJ题目4288 Coder(vector)
- HDOJ 4288 Coder 线段树 vector偷懒做法
- hdu 4288 Coder (vector)
- HDOJ 4288 Coder(线段树)
- 【线段树】 HDOJ 4288 Coder
- HDOJ 题目4858 项目管理(vector水)
- HDU 4288 Coder(vector + upper_bound, lower_bound)
- HDOJ 4288 Coder (离线处理 + 线段树)
- HDU 4288 Coder(线段树或者暴力vector)#by zh
- hdoj 4288coder & cf 85d Sum of Medians
- hdoj 4288 && Codeforces 85D Coder 【线段树】
- HDU 4288-Coder(模拟)
- hdu 4288 Coder (离线)
- hdoj简单题目(一)
- hdoj简单题目(二)
- hdoj简单题目(三)
- hdoj简单题目(五)
- hdoj简单题目(四)
- HTML5新特性基础学习笔记下
- android 中使用单元测试 Junit的步骤
- redis 第一节 安装redis
- 0004 嘿嘿
- 经典Hanoi问题
- HDOJ题目4288 Coder(vector)
- 成功的背后!(给所有IT人)
- mysql 模糊查询知识点
- HDU 1237 简单计算器
- EPSON 自带CCD图像处理包的典型应用框架
- HDU 1535 && POJ 1511 Invitation Cards (SPFA 模板 + 反向建图)
- 11个检查Linux是否被入侵的方法
- JAVA基础------正则表达式
- 如何查看LINUX系统是32bit还是64bit