AtCoder题解 —— AtCoder Beginner Contest 184 —— B - Quizzes

题目相关

题目链接

AtCoder Beginner Contest 184 B 题，https://atcoder.jp/contests/abc184/tasks/abc184_b。

Problem Statement

Takahashi will answer N quiz questions.
Initially, he has X points. Each time he answers a question, he gains 1 point if his answer is correct and loses 1 point if it is incorrect.
However, there is an exception: when he has 0 points, he loses nothing for answering a question incorrectly.

You will be given a string S representing whether Takahashi's answers are correct.
If the i-th character of S from the left is o, it means his answer for the i-th question is correct; if that character is x, it means his answer for the i-th question is incorrect.
How many points will he have in the end?

Input

Input is given from Standard Input in the following format:

N X
S

Output

Print the number of points Takahashi will have in the end.

Samples1

Sample Input 1

3 0
xox

Sample Output 1

0

Explaination

Initially, he has 0 points.
He answers the first question incorrectly but loses nothing because he has no point.
Then, he answers the second question correctly, gains 1 point, and now has 1 point.
Finally, he answers the third question incorrectly, loses 1 point, and now has 0 points.
Thus, he has 0 points in the end. We should print 0.

Samples2

Sample Input 2

20 199999
oooooooooxoooooooooo

Sample Output 2

200017

Samples3

Sample Input 3

20 10
xxxxxxxxxxxxxxxxxxxx

Sample Output 3

0

Constraints

• 1≤N≤2×10^5
• 0≤X≤2×10^5
• S is a string of length N consisting of o and x.

题解报告

题目翻译

高桥要回答 N 个测试问题。开始的时候有 X 分。每次正确回答一个测试问题，分数加一分。每次错误回答一个测试问题，分数减一分。但是，有一个特殊情况，也就是如果当前分数为零分的时候，回答错误不扣分。

我们给一个字符串 S 表示着 N 个问题的回答。其中第 i 个问题是字符串 S 的第 i 个字符，如果字符是 o，表示回答正确，如果字符是 x，表示回答错误。

请计算高桥的最后得分。

题目分析

本题是一个模拟题，只需要从头到尾分析字符串 S 的第 i 个字符，根据字符的情况计算对应的积分即可。唯一注意，不能出现负分。

数据范围估计

字符串的最大长度为 2*10^5，初始分数最大值为 2*10^5，因此最高分为 2*10^5+2^10*5=4*10^5。最低分自然就是 0 分了。因此用 int 表示足够。

AC 参考代码

//https://atcoder.jp/contests/abc184/tasks/abc184_b
//B - Quizzes
#include <bits/stdc++.h>

using namespace std;

//如果提交到OJ，不要定义 __LOCAL
//#define __LOCAL

int main() {
#ifndef __LOCAL
    //这部分代码需要提交到OJ，本地调试不使用
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif
    int n,x;
    string s;
    cin>>n>>x>>s;

    for (int i=0; i<n; i++) {
        if ('o'==s[i]) {
            x++;
        } else if ('x'==s[i] && x>0) {
            x--;
        }
    }

    cout<<x<<"\n";

#ifdef __LOCAL
    //这部分代码不需要提交到OJ，本地调试使用
    system("pause");
#endif
    return 0;
}

时间复杂度

O(N)。

空间复杂度

O(N)。