Codeforces Round #359 (Div. 2) A. Free Ice Cream
2016-06-24 09:00
441 查看
题目链接:http://codeforces.com/contest/686/problem/A
A. Free Ice Cream
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.
At the start of the day they have x ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and
Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).
If a carrier with d ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take d ice
cream packs comes to the house, then Kay and Gerda will give him d packs if they have enough ice cream, otherwise the child will get
no ice cream at all and will leave in distress.
Kay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.
Input
The first line contains two space-separated integers n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109).
Each of the next n lines contains a character '+'
or '-', and an integer di,
separated by a space (1 ≤ di ≤ 109).
Record "+ di"
in i-th line means that a carrier with di ice
cream packs occupies i-th place from the start of the queue, and record "- di"
means that a child who wants to take di packs
stands in i-th place.
Output
Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress.
Examples
input
output
input
output
Note
Consider the first sample.
Initially Kay and Gerda have 7 packs of ice cream.
Carrier brings 5 more, so now they have 12 packs.
A kid asks for 10 packs and receives them. There are only 2 packs
remaining.
Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed.
Carrier bring 40 packs, now Kay and Gerda have 42 packs.
Kid asks for 20 packs and receives them. There are 22 packs
remaining.
题意
一共有n个小孩,当前你手里有x块糖,如果接收加号那么你增加di块糖,如果接收减号,你需要判断自己的糖是否足够给第i个小孩,如果不够那么这个小孩不开心,并且一个都不给他,输出最后自己手里剩几块糖和不开心的小孩数量。
代码
A. Free Ice Cream
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
After their adventure with the magic mirror Kay and Gerda have returned home and sometimes give free ice cream to kids in the summer.
At the start of the day they have x ice cream packs. Since the ice cream is free, people start standing in the queue before Kay and
Gerda's house even in the night. Each person in the queue wants either to take several ice cream packs for himself and his friends or to give several ice cream packs to Kay and Gerda (carriers that bring ice cream have to stand in the same queue).
If a carrier with d ice cream packs comes to the house, then Kay and Gerda take all his packs. If a child who wants to take d ice
cream packs comes to the house, then Kay and Gerda will give him d packs if they have enough ice cream, otherwise the child will get
no ice cream at all and will leave in distress.
Kay wants to find the amount of ice cream they will have after all people will leave from the queue, and Gerda wants to find the number of distressed kids.
Input
The first line contains two space-separated integers n and x (1 ≤ n ≤ 1000, 0 ≤ x ≤ 109).
Each of the next n lines contains a character '+'
or '-', and an integer di,
separated by a space (1 ≤ di ≤ 109).
Record "+ di"
in i-th line means that a carrier with di ice
cream packs occupies i-th place from the start of the queue, and record "- di"
means that a child who wants to take di packs
stands in i-th place.
Output
Print two space-separated integers — number of ice cream packs left after all operations, and number of kids that left the house in distress.
Examples
input
5 7 + 5 - 10 - 20 + 40 - 20
output
22 1
input
5 17 - 16 - 2 - 98 + 100 - 98
output
3 2
Note
Consider the first sample.
Initially Kay and Gerda have 7 packs of ice cream.
Carrier brings 5 more, so now they have 12 packs.
A kid asks for 10 packs and receives them. There are only 2 packs
remaining.
Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed.
Carrier bring 40 packs, now Kay and Gerda have 42 packs.
Kid asks for 20 packs and receives them. There are 22 packs
remaining.
题意
一共有n个小孩,当前你手里有x块糖,如果接收加号那么你增加di块糖,如果接收减号,你需要判断自己的糖是否足够给第i个小孩,如果不够那么这个小孩不开心,并且一个都不给他,输出最后自己手里剩几块糖和不开心的小孩数量。
代码
#include <bits/stdc++.h> using namespace std; int main() { int n,i,a,count=0; long long s; int z[1005]; char h[1005][5]; cin>>n>>i; s=i; for(a=0;n>a;a++){ cin>>h[a]>>z[a]; if(h[a][0]=='-'){ if(s>=z[a]){ s-=z[a]; } else{ count++; } } else{ s+=z[a]; } } cout<<s<<" "<<count<<endl; return 0; }
相关文章推荐
- 8天学通MongoDB——第八天 驱动实践
- Spring的数据源引用问题,拆分配置文件
- OpenCV的RobustMatch匹配算法
- 关于Android的https通讯安全
- 关于Android的https通讯安全
- time()
- 汇编中断大全
- 关于判断字符串是否为空
- 百度地图插件,最简单的一个例子
- Web 前端面试题目及答案汇总
- Java Hibernate中使用HQL语句进行数据库查询的要点解析
- 8天学通MongoDB——第七天 运维技术
- 数据库基本篇(一)存储过程
- 好剧精选
- 8天学通MongoDB——第六天 分片技术
- 柴俊理金:脱欧对峙剑拔弩张,黄金原油南辕北辙
- 正则表达式(语法篇推荐)
- python学习笔记-POST方式
- 8天学通MongoDB——第五天 主从复制
- 全球容器技术大会议题一览