提出 #68330430

---

ソースコード 拡げる

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
#include <limits>
#include <array>

static const int MOD = 998244353;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    int a0 = 0, a1 = 0;
    ll ans = 0;
    string s;
    cin >> s;
    a0++;
    int cur = 0;
    for (int i = 0; i < n; ++i) {
        if(s[i] == '0') cur ^= 1;

        if(cur == 0) {
            ans += a0;
            a0++;
        }
        else {
            ans += a1;
            a1++;
        }
    }
    cout << ans << endl;
    return 0;
}

提出情報

ジャッジ結果