結果

問題 No.1036 Make One With GCD 2
ユーザー stoqstoq
提出日時 2021-08-09 18:21:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 826 ms / 2,000 ms
コード長 4,415 bytes
コンパイル時間 4,738 ms
コンパイル使用メモリ 269,336 KB
実行使用メモリ 38,864 KB
最終ジャッジ日時 2024-09-21 17:21:43
合計ジャッジ時間 17,734 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 826 ms
38,844 KB
testcase_01 AC 170 ms
38,844 KB
testcase_02 AC 206 ms
38,844 KB
testcase_03 AC 60 ms
32,236 KB
testcase_04 AC 73 ms
37,352 KB
testcase_05 AC 44 ms
26,664 KB
testcase_06 AC 42 ms
26,636 KB
testcase_07 AC 83 ms
32,512 KB
testcase_08 AC 76 ms
32,188 KB
testcase_09 AC 212 ms
38,656 KB
testcase_10 AC 198 ms
38,492 KB
testcase_11 AC 211 ms
38,820 KB
testcase_12 AC 197 ms
38,456 KB
testcase_13 AC 308 ms
38,752 KB
testcase_14 AC 315 ms
38,636 KB
testcase_15 AC 292 ms
38,400 KB
testcase_16 AC 295 ms
38,528 KB
testcase_17 AC 302 ms
38,528 KB
testcase_18 AC 44 ms
26,752 KB
testcase_19 AC 43 ms
26,880 KB
testcase_20 AC 45 ms
26,880 KB
testcase_21 AC 44 ms
26,724 KB
testcase_22 AC 288 ms
38,528 KB
testcase_23 AC 225 ms
37,504 KB
testcase_24 AC 300 ms
38,484 KB
testcase_25 AC 280 ms
38,184 KB
testcase_26 AC 288 ms
38,400 KB
testcase_27 AC 43 ms
26,632 KB
testcase_28 AC 43 ms
26,624 KB
testcase_29 AC 42 ms
26,752 KB
testcase_30 AC 42 ms
26,752 KB
testcase_31 AC 42 ms
26,640 KB
testcase_32 AC 41 ms
26,700 KB
testcase_33 AC 42 ms
26,752 KB
testcase_34 AC 41 ms
26,732 KB
testcase_35 AC 43 ms
26,636 KB
testcase_36 AC 42 ms
26,656 KB
testcase_37 AC 42 ms
26,740 KB
testcase_38 AC 198 ms
38,808 KB
testcase_39 AC 674 ms
38,860 KB
testcase_40 AC 226 ms
37,504 KB
testcase_41 AC 522 ms
38,784 KB
testcase_42 AC 502 ms
38,864 KB
testcase_43 AC 553 ms
38,784 KB
testcase_44 AC 597 ms
38,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 2

#pragma region Macros

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif

#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
constexpr ll MOD = 998244353;
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

struct io_init {
  io_init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << setprecision(30) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}

random_device seed_gen;
mt19937_64 engine(seed_gen());

struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    int MOD = fact_[0].mod();
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};

BiCoef bc(2000010);

#pragma endregion

using S = ll;
S op(S a, S b) { return gcd(a, b); }
S e() { return 0; }
bool f(S a) { return a != 1; }

void solve() {
  ll n;
  cin >> n;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];

  segtree<S, op, e> seg(a);
  ll ans = n * (n + 1) / 2;
  rep(l, n) {
    int r = seg.max_right<f>(l);
    ans -= r - l;
  }
  cout << ans << "\n";
}

int main() { solve(); }
0