Competitive Programming Solutions

abc184_b - Quizzes

08 Dec 2020 — Tags: easy,implementation — URL

Iterate through all Takahashi’s answers in order and update $x$ as the problem says.

Time complexity: $O(n)$

Memory complexity: $O(n)$

Click to show code.

 

using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
template <typename InputIterator,
          typename T = typename iterator_traits<InputIterator>::value_type>
void read_n(InputIterator it, int n)
{
    copy_n(istream_iterator<T>(cin), n, it);
}
template <typename InputIterator,
          typename T = typename iterator_traits<InputIterator>::value_type>
void write(InputIterator first, InputIterator last, const char *delim = "\n")
{
    copy(first, last, ostream_iterator<T>(cout, delim));
}
int main(void)
{
    ios::sync_with_stdio(false), cin.tie(NULL);
    int n, x;
    cin >> n >> x;
    while (n--)
    {
        char cur;
        cin >> cur;
        if (cur == 'o')
            x += 1;
        else
            x = max(0, x - 1);
    }
    cout << x << endl;
    return 0;
}

Related posts