codeforces 686A Free Ice Cream

本文介绍了一个简单的模拟问题,涉及初始冰淇淋数量与一系列增加或减少冰淇淋的请求操作。通过逐个处理队伍中的人来更新剩余冰淇淋数量,并计算因库存不足而无法满足需求的孩子人数。

点击打开链接

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 ≤ 10000 ≤ 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.

  1. Initially Kay and Gerda have 7 packs of ice cream.
  2. Carrier brings 5 more, so now they have 12 packs.
  3. A kid asks for 10 packs and receives them. There are only 2 packs remaining.
  4. Another kid asks for 20 packs. Kay and Gerda do not have them, so the kid goes away distressed.
  5. Carrier bring 40 packs, now Kay and Gerda have 42 packs.
  6. Kid asks for 20 packs and receives them. There are 22 packs remaining.

水题

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
typedef long long ll;
int main()
{
    ll n,x,s=0,m;
    char str;
    cin>>n>>x;
    for(int i=0;i<n;i++)
    {
        cin>>str>>m;
        if(str=='+')
            x+=m;
        else
        {
            if(x>=m)
                x-=m;
            else
                s++;
        }
    }
    cout<<x<<" "<<s<<endl;
    return 0;
}



### 关于 Codeforces Problem 1804A 的解决方案 Codeforces 是一个广受欢迎的在线编程竞赛平台,其中问 1804A 可能涉及特定算法或数据结构的应用。尽管未提供具体目描述,但通常可以通过分析输入输出样例以及常见解法来推导其核心逻辑。 #### 目概述 假设该问是关于字符串处理、数组操作或其他基础算法领域的内容,则可以采用以下方法解决[^2]: 对于某些初学者来说,遇到不熟悉的语言(如 Fortran),可能会感到困惑。然而,在现代竞赛环境中,大多数情况下会使用更常见的语言(C++、Python 或 Java)。因此,如果目提及某种神秘的语言,可能只是为了增加趣味性而非实际需求。 #### 解决方案思路 以下是基于一般情况下的潜在解答方式之一: ```cpp #include <bits/stdc++.h> using namespace std; int main(){ int t; cin >> t; // 输入测试用例数量 while(t--){ string s; cin >> s; // 获取每组测试数据 // 假设这里需要执行一些简单的变换或者判断条件... bool flag = true; // 初始化标志位为真 for(char c : s){ if(c != 'a' && c != 'b'){ flag = false; break; } } cout << (flag ? "YES" : "NO") << "\n"; // 输出结果 } return 0; } ``` 上述代码片段展示了一个基本框架,适用于许多入门级字符串验证类问。当然,这仅作为示范用途;真实场景下需依据具体要求调整实现细节。 #### 进一步探讨方向 除了官方解外,社区论坛也是获取灵感的好地方。通过阅读他人分享的经验教训,能够加深对该类型习的理解程度。同时注意积累常用技巧并灵活运用到不同场合之中[^1]。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值