Problem p02667 (C++) — buggy submission, verdict: Runtime Error

// #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\\n'

#pragma region TEMPLATE

/* TYPE */
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<vector<int>> vvi;
template <typename T, typename Cmp = less<>>
using prique = priority_queue<T, vector<T>, Cmp>;
template <typename T> using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\\n'
const int INF = 1 << 30;
const ll INFF = 1LL << 60;
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7;
const int MODD = 998244353;
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS = 1e-9;
const ld PI = 3.14159265358979323846264338327950288;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, -1, -1, 1, 1, 0};
/* CONTAINER */
#define PB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val) (int)(x).size() - LESS((x), (val))
#define UNIQUE(v)                                                              \\
  sort(ALL(v));                                                                \\
  (v).erase(unique(ALL(v)), (v).end())
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) {
  u = U(v...);
}
template <typename T, typename U, typename... V>
enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) {
  for (auto &e : u)
    fill_v<T>(e, v...);
}
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n) REPI(i, 0, n)
#define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...) _overload3(__VA_ARGS__, REPI, _REP, )(__VA_ARGS__)
#define _RREP(i, n) RREPI(i, n, 0)
#define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP, )(__VA_ARGS__)
#define EACH(e, v) for (auto &e : v)
#define PERM(v)                                                                \\
  sort(ALL(v));                                                                \\
  for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template <typename T> void SSS(T &t) { cin >> t; }
template <typename Head, typename... Tail>
void SSS(Head &&head, Tail &&...tail) {
  cin >> head;
  SSS(tail...);
}
#define SS(T, ...)                                                             \\
  T __VA_ARGS__;                                                               \\
  SSS(__VA_ARGS__);
#define SV(T, v, n)                                                            \\
  vector<T> v(n);                                                              \\
  for (auto &i : v)                                                            \\
    cin >> i;
#define SVV(T, v, n, m)                                                        \\
  vector<vector<T>> v(n, vector<T>(m));                                        \\
  for (auto &r : v)                                                            \\
    for (auto &i : r)                                                          \\
      cin >> i;
/* OUTPUT */
// PROTOTYPE DECLARATION
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &j);
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);
template <class C, enable_if_t<!is_same<C, string>::value,
                               decltype(declval<const C &>().begin(),
                                        nullptr)> = nullptr>
ostream &operator<<(ostream &os, const C &c);
template <typename T> ostream &operator<<(ostream &os, const stack<T> &j);
template <typename T> ostream &operator<<(ostream &os, const queue<T> &j);
template <typename T, typename C, typename Cmp>
ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &j) {
  return os << '{' << j.first << ", " << j.second << '}';
}
template <size_t num = 0, typename... T>
enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os,
                                             const tuple<T...> &t) {}
template <size_t num = 0, typename... T>
    enable_if_t <
    num<sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {
  os << get<num>(t);
  if (num + 1 < sizeof...(T))
    os << ", ";
  PRINT_TUPLE<num + 1>(os, t);
}
template <typename... T>
ostream &operator<<(ostream &os, const tuple<T...> &t) {
  PRINT_TUPLE(os << '{', t);
  return os << '}';
}
template <class C, enable_if_t<!is_same<C, string>::value,
                               decltype(declval<const C &>().begin(), nullptr)>>
ostream &operator<<(ostream &os, const C &c) {
  os << '{';
  for (auto it = begin(c); it != end(c); it++) {
    if (begin(c) != it)
      os << ", ";
    os << *it;
  }
  return os << '}';
}
template <typename T> ostream &operator<<(ostream &os, const stack<T> &j) {
  deque<T> d;
  for (auto c = j; !c.empty(); c.pop())
    d.push_front(c.top());
  return os << d;
}
template <typename T> ostream &operator<<(ostream &os, const queue<T> &j) {
  deque<T> d;
  for (auto c = j; !c.empty(); c.pop())
    d.push_back(c.front());
  return os << d;
}
template <typename T, typename C, typename Cmp>
ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) {
  deque<T> d;
  for (auto c = j; !c.empty(); c.pop())
    d.push_front(c.top());
  return os << d;
}
// OUTPUT FUNCTION
template <typename T> int PV(T &v) {
  int sz = v.size();
  for (int i = 0; i < sz; ++i)
    cout << v[i] << " \\n"[i == sz - 1];
  return 0;
}
inline int print() {
  cout << endl;
  return 0;
}
template <typename Head> int print(Head &&head) {
  cout << head;
  return print();
}
template <typename Head, typename... Tail>
int print(Head &&head, Tail &&...tail) {
  cout << head << " ";
  return print(forward<Tail>(tail)...);
}
#ifdef LOCAL
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) {
  cerr << head;
  dump();
}
template <typename Head, typename... Tail>
void dump(Head &&head, Tail &&...tail) {
  cerr << head << ", ";
  dump(forward<Tail>(tail)...);
}
#define debug(...)                                                             \\
  do {                                                                         \\
    cerr << __LINE__ << ":\\t" << #__VA_ARGS__ << " = ";                        \\
    dump(__VA_ARGS__);                                                         \\
  } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
template <typename T, typename A, typename B>
inline bool between(T x, A a, B b) {
  return ((a <= x) && (x < b));
}
template <typename A, typename B> inline bool chmax(A &a, const B &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename A, typename B> inline bool chmin(A &a, const B &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b) {
  ll r = 1;
  do {
    if (b & 1)
      r *= a;
    a *= a;
  } while (b >>= 1);
  return r;
}
inline ll MOP(ll a, ll b, const ll &m = MOD) {
  ll r = 1;
  do {
    if (b & 1)
      (r *= a) %= m;
    (a *= a) %= m;
  } while (b >>= 1);
  return r;
}
struct abracadabra {
  abracadabra() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(5);
  };
} ABRACADABRA;

#pragma endregion
#pragma region datastructure lazy segment tree
/**
 * @brief 遅延セグメント木
 * @docs docs/datastructure/segmenttree/lazysegmenttree.md
 */

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
struct LazySegmentTree {
  int sz;
  F f;
  G g;
  H h;
  P p;
  const M ID_M;
  const OM ID_OM;
  vector<M> dat;
  vector<OM> laz;
  LazySegmentTree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    build(n);
  }
  LazySegmentTree(const vector<M> &v, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    int n = v.size();
    build(n);
    for (int i = 0; i < n; ++i)
      dat[i + sz - 1] = v[i];
    for (int i = sz - 2; i >= 0; --i)
      dat[i] = f(dat[2 * i + 1], dat[2 * i + 2]);
  }
  void build(int n) {
    sz = 1;
    while (sz < n)
      sz <<= 1;
    dat.assign(2 * sz - 1, ID_M);
    laz.assign(2 * sz - 1, ID_OM);
  }
  void eval(int len, int k) {
    if (laz[k] == ID_OM)
      return;
    if (2 * k + 1 < 2 * sz - 1) {
      laz[2 * k + 1] = h(laz[2 * k + 1], laz[k]);
      laz[2 * k + 2] = h(laz[2 * k + 2], laz[k]);
    }
    dat[k] = g(dat[k], p(laz[k], len));
    laz[k] = ID_OM;
  }
  M update(int a, int b, OM x, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return dat[k];
    if (a <= l and r <= b) {
      laz[k] = h(laz[k], x);
      return g(dat[k], p(laz[k], r - l));
    }
    return dat[k] = f(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
                      update(a, b, x, 2 * k + 2, (l + r) / 2, r));
  }
  M update(int a, int b, OM x) { return update(a, b, x, 0, 0, sz); }
  M query(int a, int b, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return ID_M;
    if (a <= l and r <= b)
      return dat[k];
    M vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    M vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return f(vl, vr);
  }
  M query(int a, int b) { return query(a, b, 0, 0, sz); }
  M operator[](const int &k) { return query(k, k + 1); }
  void print() {
    for (int i = 0; i < sz; ++i)
      cerr << query(i, i + 1) << ' ';
    cerr << endl;
  }
};

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(n, ID_M, ID_OM, f, g, h, p);
}
template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(vector<M> v, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(v, ID_M, ID_OM, f, g, h, p);
}
#pragma endregion
#pragma region datastructure binary indexed tree
template <typename T> struct BinaryIndexedTree {
  vector<T> data;
  BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
  T sum(int k) {
    if (k < 0)
      return T(0);
    T ret = 0;
    for (++k; k > 0; k -= k & -k)
      ret += data[k];
    return (ret);
  }
  T sum(int l, int r) {
    assert(l <= r);
    return sum(r - 1) - sum(l - 1);
  }
  void add(int k, T x) {
    for (++k; k < data.size(); k += k & -k)
      data[k] += x;
  }
};

/*
・Binary Indexed Tree (Fenwick Tree)
    > O(logN)
[備考] ある要素に値を加える操作と,
区間和を求める操作に関してlogNで行うデータ構造 [使用例] BinaryIndexedTree<int>
bit(N);      // 要素数NのBIT bit.add(k, x);                      //
要素kに値xを加算 bit.sum(k);                         // 閉区間[0, k]の和を求める
bit.sum(l, r);                      // 半開区間[l, r)の和を求める
*/
#pragma endregion

string S;
int N;

ll solve(vector<int> &v) {

  // count like inversion number
  BinaryIndexedTree<int> bit(N);

  // ax + b
  using M = ll;
  using OM = pair<ll, ll>;
  auto f = [](M a, M b) -> M { return a + b; };
  auto g = [](M a, OM b) -> M { return b.first * a + b.second; };
  auto h = [](OM a, OM b) -> OM {
    return OM(a.first * b.first, a.second * b.first + b.second);
  };
  auto p = [](OM a, int n) -> OM { return OM(a.first, a.second * n); };
  auto seg = make_segtree(N, M(0), OM(1, 0), f, g, h, p);

  ll ret = 0;

  REP(i, N) {
    // [0, i)の中で, 自分より数が大きいもの
    int grt = bit.sum(v[i], N);
    if (grt % 2 == 0)
      seg.update(v[i], v[i] + 1, make_pair(1, v[i])); // += v[i]
    else
      seg.update(v[i], v[i] + 1, make_pair(1, -v[i])); // -= v[i]
    seg.update(0, v[i], make_pair(-1, 0)); // 自分より小さい数を-1倍
    bit.add(v[i], 1);                      // 個数を数えるため
    if (S[i] == '0')
      continue;
    // 以下, retに足し込む
    bool is_odd = bit.sum(0, v[i] + 1) % 2 == 1; // 追加時に奇数番目か
    if (grt % 2 == 0) {
      if (is_odd) {
        ret += N - seg.query(v[i], N);
      } else {
        ret += seg.query(v[i] + 1, N);
      }
    } else {
      if (is_odd) {
        ret += seg.query(v[i], N);
      } else {
        ret += N - seg.query(v[i] + 1, N);
      }
    }
    debug(ret);
  }

  return ret;
}

signed main() {

  cin >> S;
  N = S.size();

  int idx = 0, cnt = 0;
  vector<int> v(N, -1);
  REP(i, N) if (S[i] == '1') v[i] = idx++;
  REP(i, N) {
    if (S[i] == '1') {
      ++cnt;
    } else {
      if (cnt % 2 == 1) { // 0を追加することで増やせる
        ++cnt;
        v[i] = idx++;
      }
    }
  }
  RREP(i, N - 1) if (v[i] == -1) v[i] = idx++;
  print(solve(v));
}


Error: 0

Fixed submission:

// #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\\n'

#pragma region TEMPLATE

/* TYPE */
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<vector<int>> vvi;
template <typename T, typename Cmp = less<>>
using prique = priority_queue<T, vector<T>, Cmp>;
template <typename T> using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\\n'
const int INF = 1 << 30;
const ll INFF = 1LL << 60;
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7;
const int MODD = 998244353;
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS = 1e-9;
const ld PI = 3.14159265358979323846264338327950288;
const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
const int dy[] = {0, 1, 0, -1, -1, -1, 1, 1, 0};
/* CONTAINER */
#define PB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val) (int)(x).size() - LESS((x), (val))
#define UNIQUE(v)                                                              \\
  sort(ALL(v));                                                                \\
  (v).erase(unique(ALL(v)), (v).end())
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) {
  u = U(v...);
}
template <typename T, typename U, typename... V>
enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) {
  for (auto &e : u)
    fill_v<T>(e, v...);
}
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n) REPI(i, 0, n)
#define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...) _overload3(__VA_ARGS__, REPI, _REP, )(__VA_ARGS__)
#define _RREP(i, n) RREPI(i, n, 0)
#define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP, )(__VA_ARGS__)
#define EACH(e, v) for (auto &e : v)
#define PERM(v)                                                                \\
  sort(ALL(v));                                                                \\
  for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template <typename T> void SSS(T &t) { cin >> t; }
template <typename Head, typename... Tail>
void SSS(Head &&head, Tail &&...tail) {
  cin >> head;
  SSS(tail...);
}
#define SS(T, ...)                                                             \\
  T __VA_ARGS__;                                                               \\
  SSS(__VA_ARGS__);
#define SV(T, v, n)                                                            \\
  vector<T> v(n);                                                              \\
  for (auto &i : v)                                                            \\
    cin >> i;
#define SVV(T, v, n, m)                                                        \\
  vector<vector<T>> v(n, vector<T>(m));                                        \\
  for (auto &r : v)                                                            \\
    for (auto &i : r)                                                          \\
      cin >> i;
/* OUTPUT */
// PROTOTYPE DECLARATION
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &j);
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);
template <class C, enable_if_t<!is_same<C, string>::value,
                               decltype(declval<const C &>().begin(),
                                        nullptr)> = nullptr>
ostream &operator<<(ostream &os, const C &c);
template <typename T> ostream &operator<<(ostream &os, const stack<T> &j);
template <typename T> ostream &operator<<(ostream &os, const queue<T> &j);
template <typename T, typename C, typename Cmp>
ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &j) {
  return os << '{' << j.first << ", " << j.second << '}';
}
template <size_t num = 0, typename... T>
enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os,
                                             const tuple<T...> &t) {}
template <size_t num = 0, typename... T>
    enable_if_t <
    num<sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {
  os << get<num>(t);
  if (num + 1 < sizeof...(T))
    os << ", ";
  PRINT_TUPLE<num + 1>(os, t);
}
template <typename... T>
ostream &operator<<(ostream &os, const tuple<T...> &t) {
  PRINT_TUPLE(os << '{', t);
  return os << '}';
}
template <class C, enable_if_t<!is_same<C, string>::value,
                               decltype(declval<const C &>().begin(), nullptr)>>
ostream &operator<<(ostream &os, const C &c) {
  os << '{';
  for (auto it = begin(c); it != end(c); it++) {
    if (begin(c) != it)
      os << ", ";
    os << *it;
  }
  return os << '}';
}
template <typename T> ostream &operator<<(ostream &os, const stack<T> &j) {
  deque<T> d;
  for (auto c = j; !c.empty(); c.pop())
    d.push_front(c.top());
  return os << d;
}
template <typename T> ostream &operator<<(ostream &os, const queue<T> &j) {
  deque<T> d;
  for (auto c = j; !c.empty(); c.pop())
    d.push_back(c.front());
  return os << d;
}
template <typename T, typename C, typename Cmp>
ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) {
  deque<T> d;
  for (auto c = j; !c.empty(); c.pop())
    d.push_front(c.top());
  return os << d;
}
// OUTPUT FUNCTION
template <typename T> int PV(T &v) {
  int sz = v.size();
  for (int i = 0; i < sz; ++i)
    cout << v[i] << " \\n"[i == sz - 1];
  return 0;
}
inline int print() {
  cout << endl;
  return 0;
}
template <typename Head> int print(Head &&head) {
  cout << head;
  return print();
}
template <typename Head, typename... Tail>
int print(Head &&head, Tail &&...tail) {
  cout << head << " ";
  return print(forward<Tail>(tail)...);
}
#ifdef LOCAL
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) {
  cerr << head;
  dump();
}
template <typename Head, typename... Tail>
void dump(Head &&head, Tail &&...tail) {
  cerr << head << ", ";
  dump(forward<Tail>(tail)...);
}
#define debug(...)                                                             \\
  do {                                                                         \\
    cerr << __LINE__ << ":\\t" << #__VA_ARGS__ << " = ";                        \\
    dump(__VA_ARGS__);                                                         \\
  } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
template <typename T, typename A, typename B>
inline bool between(T x, A a, B b) {
  return ((a <= x) && (x < b));
}
template <typename A, typename B> inline bool chmax(A &a, const B &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename A, typename B> inline bool chmin(A &a, const B &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b) {
  ll r = 1;
  do {
    if (b & 1)
      r *= a;
    a *= a;
  } while (b >>= 1);
  return r;
}
inline ll MOP(ll a, ll b, const ll &m = MOD) {
  ll r = 1;
  do {
    if (b & 1)
      (r *= a) %= m;
    (a *= a) %= m;
  } while (b >>= 1);
  return r;
}
struct abracadabra {
  abracadabra() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(5);
  };
} ABRACADABRA;

#pragma endregion
#pragma region datastructure lazy segment tree
/**
 * @brief 遅延セグメント木
 * @docs docs/datastructure/segmenttree/lazysegmenttree.md
 */

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
struct LazySegmentTree {
  int sz;
  F f;
  G g;
  H h;
  P p;
  const M ID_M;
  const OM ID_OM;
  vector<M> dat;
  vector<OM> laz;
  LazySegmentTree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    build(n);
  }
  LazySegmentTree(const vector<M> &v, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    int n = v.size();
    build(n);
    for (int i = 0; i < n; ++i)
      dat[i + sz - 1] = v[i];
    for (int i = sz - 2; i >= 0; --i)
      dat[i] = f(dat[2 * i + 1], dat[2 * i + 2]);
  }
  void build(int n) {
    sz = 1;
    while (sz < n)
      sz <<= 1;
    dat.assign(2 * sz - 1, ID_M);
    laz.assign(2 * sz - 1, ID_OM);
  }
  void eval(int len, int k) {
    if (laz[k] == ID_OM)
      return;
    if (2 * k + 1 < 2 * sz - 1) {
      laz[2 * k + 1] = h(laz[2 * k + 1], laz[k]);
      laz[2 * k + 2] = h(laz[2 * k + 2], laz[k]);
    }
    dat[k] = g(dat[k], p(laz[k], len));
    laz[k] = ID_OM;
  }
  M update(int a, int b, OM x, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return dat[k];
    if (a <= l and r <= b) {
      laz[k] = h(laz[k], x);
      return g(dat[k], p(laz[k], r - l));
    }
    return dat[k] = f(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
                      update(a, b, x, 2 * k + 2, (l + r) / 2, r));
  }
  M update(int a, int b, OM x) { return update(a, b, x, 0, 0, sz); }
  M query(int a, int b, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return ID_M;
    if (a <= l and r <= b)
      return dat[k];
    M vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    M vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return f(vl, vr);
  }
  M query(int a, int b) { return query(a, b, 0, 0, sz); }
  M operator[](const int &k) { return query(k, k + 1); }
  void print() {
    for (int i = 0; i < sz; ++i)
      cerr << query(i, i + 1) << ' ';
    cerr << endl;
  }
};

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(n, ID_M, ID_OM, f, g, h, p);
}
template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(vector<M> v, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(v, ID_M, ID_OM, f, g, h, p);
}
#pragma endregion
#pragma region datastructure binary indexed tree
template <typename T> struct BinaryIndexedTree {
  vector<T> data;
  BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
  T sum(int k) {
    if (k < 0)
      return T(0);
    T ret = 0;
    for (++k; k > 0; k -= k & -k)
      ret += data[k];
    return (ret);
  }
  T sum(int l, int r) {
    assert(l <= r);
    return sum(r - 1) - sum(l - 1);
  }
  void add(int k, T x) {
    for (++k; k < data.size(); k += k & -k)
      data[k] += x;
  }
};

/*
・Binary Indexed Tree (Fenwick Tree)
    > O(logN)
[備考] ある要素に値を加える操作と,
区間和を求める操作に関してlogNで行うデータ構造 [使用例] BinaryIndexedTree<int>
bit(N);      // 要素数NのBIT bit.add(k, x);                      //
要素kに値xを加算 bit.sum(k);                         // 閉区間[0, k]の和を求める
bit.sum(l, r);                      // 半開区間[l, r)の和を求める
*/
#pragma endregion

string S;
int N;

ll solve(vector<int> &v) {

  // count like inversion number
  BinaryIndexedTree<int> bit(N);

  // ax + b
  using M = ll;
  using OM = pair<ll, ll>;
  auto f = [](M a, M b) -> M { return a + b; };
  auto g = [](M a, OM b) -> M { return b.first * a + b.second; };
  auto h = [](OM a, OM b) -> OM {
    return OM(a.first * b.first, a.second * b.first + b.second);
  };
  auto p = [](OM a, int n) -> OM { return OM(a.first, a.second * n); };
  auto seg = make_segtree(N, M(0), OM(1, 0), f, g, h, p);

  ll ret = 0;

  REP(i, N) {
    // [0, i)の中で, 自分より数が大きいもの
    int grt = bit.sum(v[i], N);
    if (grt % 2 == 0)
      seg.update(v[i], v[i] + 1, make_pair(1, v[i])); // += v[i]
    else
      seg.update(v[i], v[i] + 1, make_pair(1, -v[i])); // -= v[i]
    seg.update(0, v[i], make_pair(-1, 0)); // 自分より小さい数を-1倍
    bit.add(v[i], 1);                      // 個数を数えるため
    if (S[i] == '0')
      continue;
    // 以下, retに足し込む
    bool is_odd = bit.sum(0, v[i] + 1) % 2 == 1; // 追加時に奇数番目か
    if (grt % 2 == 0) {
      if (is_odd) {
        ret += N - seg.query(v[i], N);
      } else {
        ret += seg.query(v[i] + 1, N);
      }
    } else {
      if (is_odd) {
        ret += seg.query(v[i], N);
      } else {
        ret += N - seg.query(v[i] + 1, N);
      }
    }
    debug(ret);
  }

  return ret;
}

signed main() {

  cin >> S;
  N = S.size();

  int idx = 0, cnt = 0;
  vector<int> v(N, 0);
  REP(i, N) if (S[i] == '1') v[i] = idx++;
  REP(i, N) {
    if (S[i] == '1') {
      ++cnt;
    } else {
      if (cnt % 2 == 1) { // 0を追加することで増やせる
        ++cnt;
        v[i] = idx++;
      }
    }
  }
  RREP(i, N - 1) if (S[i] == '0') v[i] = idx++;
  print(solve(v));
}