#722960 (C++17) No.1765 While Shining

• 問題: No.1765 While Shining
• ユーザー: umnc
• 提出日時: 2021-12-08 17:53:52
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 21 ms / 2,000 ms
• コード長: 1,397 bytes
• コンパイル時間: 4,342 ms
• コンパイル使用メモリ: 263,484 KB
• 実行使用メモリ: 8,988 KB
• 最終ジャッジ日時: 2024-07-16 08:07:36
• 合計ジャッジ時間: 6,035 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,940 KB
testcase_08	AC	3 ms; 6,940 KB
testcase_09	AC	14 ms; 6,944 KB
testcase_10	AC	19 ms; 7,616 KB
testcase_11	AC	16 ms; 7,040 KB
testcase_12	AC	18 ms; 7,472 KB
testcase_13	AC	17 ms; 6,948 KB
testcase_14	AC	20 ms; 8,696 KB
testcase_15	AC	20 ms; 8,608 KB
testcase_16	AC	20 ms; 8,088 KB
testcase_17	AC	21 ms; 8,092 KB
testcase_18	AC	20 ms; 8,680 KB
testcase_19	AC	20 ms; 7,956 KB
testcase_20	AC	20 ms; 8,988 KB
testcase_21	AC	20 ms; 8,560 KB
testcase_22	AC	20 ms; 8,544 KB
testcase_23	AC	20 ms; 7,964 KB
testcase_24	AC	18 ms; 8,084 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define reps(i, s, e) for (ll i = s; i <= e; ++i)
#define rrep(i, n) for (ll i = n - 1; 0 <= i; --i)
#define all(v) v.begin(), v.end()
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
using ll = long long;
using ld = long double;
using cp = complex<ld>;
using pa = pair<ll, ll>;
using tup = tuple<ll, ll, ll>;
using vp = vector<pair<ll, ll> >;
using vtup = vector<tuple<ll, ll, ll> >;
using st = string;
using vs = vector<string>;
using vc = vector<char>;
using vvi = vector<vector<ll> >;
using vvc = vector<vector<char> >;
using vi = vector<ll>;
const ll MOD1 = 1000000007;
const ll MOD2 = 998244353;
const ll INF = (1LL << 60);

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  ll n;
  cin >> n;

  vi a(n);
  rep(i, n) cin >> a[i];

  auto b = a;
  for (int i = 1; i < n; i += 2) b[i] ^= 1;
  b.push_back(-1);
  ll pre = n;
  vi c(n);

  for (int i = n - 1; 0<= i; i--) {
    if (b[i] != b[pre]) pre = i;
    c[i] = pre + 1;
  }

  ll ans = 0;
  rep(i, n) if (a[i]) ans += min(c[i], n - 1) - i;
  cout << ans << endl;
}