#685357 (C++17) No.1036 Make One With GCD 2

• 問題: No.1036 Make One With GCD 2
• ユーザー: heno239
• 提出日時: 2021-08-02 04:20:11
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 920 ms / 2,000 ms
• コード長: 4,277 bytes
• コンパイル時間: 3,859 ms
• コンパイル使用メモリ: 150,236 KB
• 実行使用メモリ: 91,160 KB
• 最終ジャッジ日時: 2023-10-14 20:46:13
• 合計ジャッジ時間: 17,724 ms
• ジャッジサーバーID （参考情報）: judge14 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	252 ms; 90,936 KB
testcase_01	AC	229 ms; 90,940 KB
testcase_02	AC	253 ms; 90,832 KB
testcase_03	AC	71 ms; 34,216 KB
testcase_04	AC	124 ms; 60,220 KB
testcase_05	AC	2 ms; 4,372 KB
testcase_06	AC	1 ms; 4,372 KB
testcase_07	AC	98 ms; 38,908 KB
testcase_08	AC	79 ms; 32,272 KB
testcase_09	AC	357 ms; 88,800 KB
testcase_10	AC	333 ms; 82,928 KB
testcase_11	AC	363 ms; 90,632 KB
testcase_12	AC	336 ms; 83,716 KB
testcase_13	AC	513 ms; 86,848 KB
testcase_14	AC	518 ms; 87,952 KB
testcase_15	AC	488 ms; 82,608 KB
testcase_16	AC	492 ms; 82,980 KB
testcase_17	AC	505 ms; 85,604 KB
testcase_18	AC	2 ms; 4,372 KB
testcase_19	AC	2 ms; 4,372 KB
testcase_20	AC	3 ms; 4,368 KB
testcase_21	AC	3 ms; 4,368 KB
testcase_22	AC	480 ms; 81,608 KB
testcase_23	AC	358 ms; 60,784 KB
testcase_24	AC	500 ms; 84,852 KB
testcase_25	AC	461 ms; 77,328 KB
testcase_26	AC	472 ms; 80,144 KB
testcase_27	AC	1 ms; 4,368 KB
testcase_28	AC	2 ms; 4,368 KB
testcase_29	AC	1 ms; 4,368 KB
testcase_30	AC	2 ms; 4,368 KB
testcase_31	AC	2 ms; 4,368 KB
testcase_32	AC	2 ms; 4,368 KB
testcase_33	AC	2 ms; 4,372 KB
testcase_34	AC	2 ms; 4,372 KB
testcase_35	AC	1 ms; 4,368 KB
testcase_36	AC	1 ms; 4,372 KB
testcase_37	AC	2 ms; 4,368 KB
testcase_38	AC	249 ms; 90,840 KB
testcase_39	AC	271 ms; 90,976 KB
testcase_40	AC	356 ms; 60,700 KB
testcase_41	AC	920 ms; 90,980 KB
testcase_42	AC	920 ms; 91,160 KB
testcase_43	AC	781 ms; 90,892 KB
testcase_44	AC	863 ms; 90,976 KB

ソースコード

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
struct sparse_table {
private:
	int n;
	int tmp;
	vector<ll> ori;
	vector<int> transtmp;
	vector<vector<ll>> nodel;
public:
	sparse_table(vector<ll> _ori) {
		ori = _ori;
		n = ori.size();
		int cop = n;
		tmp = 0;
		while (cop > 0) {
			tmp++; cop >>= 1;
		}
		nodel.resize(tmp);
		rep(i, tmp)nodel[i].resize(n, 00);
		rep(i, n) {
			nodel[0][i] = ori[i];
		}
		rep(j, tmp - 1) {
			rep(i, n) {
				if (i + (1 << j) < n) {
					nodel[j + 1][i] = gcd(nodel[j][i], nodel[j][i + (1 << j)]);
				}
			}
		}
		transtmp.resize(n + 1);
		int x = 1;
		int cnt = 0;
		rep1(i, n) {
			while (x * 2 <= i) {
				x *= 2; cnt++;
			}
			transtmp[i] = cnt;
		}
	}
	//[l,r)
	ll query(int l, int r) {
		if (r - l == 0)return 0;
		int cnt = transtmp[r - l];
		return gcd(nodel[cnt][l], nodel[cnt][r - (1 << cnt)]);
	}
};
void solve() {
	int n; cin >> n;
	vector<ll> a(n);
	rep(i, n)cin >> a[i];
	sparse_table st(a);
	ll ans = 0;
	int r = 0;
	rep(l, n) {
		if (r < l)r = l;
		while (r + 1 <= n && st.query(l, r + 1) != 1)r++;
		ans += n - r;
	}
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
		solve();
	return 0;
}