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

• 問題: No.1036 Make One With GCD 2
• ユーザー: chocopuu
• 提出日時: 2020-04-28 19:09:24
• 言語: C++17 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 514 ms / 2,000 ms
• コード長: 4,494 bytes
• コンパイル時間: 4,459 ms
• コンパイル使用メモリ: 204,660 KB
• 実行使用メモリ: 15,400 KB
• 最終ジャッジ日時: 2023-10-14 20:25:36
• 合計ジャッジ時間: 16,177 ms
• ジャッジサーバーID （参考情報）: judge13 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	438 ms; 15,116 KB
testcase_01	AC	240 ms; 15,084 KB
testcase_02	AC	383 ms; 15,148 KB
testcase_03	AC	32 ms; 8,456 KB
testcase_04	AC	50 ms; 13,772 KB
testcase_05	AC	2 ms; 4,368 KB
testcase_06	AC	2 ms; 4,372 KB
testcase_07	AC	96 ms; 8,772 KB
testcase_08	AC	81 ms; 8,480 KB
testcase_09	AC	267 ms; 14,864 KB
testcase_10	AC	241 ms; 14,848 KB
testcase_11	AC	266 ms; 15,400 KB
testcase_12	AC	249 ms; 14,712 KB
testcase_13	AC	438 ms; 14,924 KB
testcase_14	AC	433 ms; 14,908 KB
testcase_15	AC	407 ms; 14,596 KB
testcase_16	AC	412 ms; 14,880 KB
testcase_17	AC	419 ms; 14,860 KB
testcase_18	AC	1 ms; 4,368 KB
testcase_19	AC	2 ms; 4,368 KB
testcase_20	AC	3 ms; 4,372 KB
testcase_21	AC	3 ms; 4,368 KB
testcase_22	AC	389 ms; 14,724 KB
testcase_23	AC	307 ms; 13,876 KB
testcase_24	AC	409 ms; 14,884 KB
testcase_25	AC	363 ms; 14,468 KB
testcase_26	AC	395 ms; 14,864 KB
testcase_27	AC	1 ms; 4,368 KB
testcase_28	AC	1 ms; 4,368 KB
testcase_29	AC	1 ms; 4,372 KB
testcase_30	AC	2 ms; 4,372 KB
testcase_31	AC	2 ms; 4,372 KB
testcase_32	AC	2 ms; 4,368 KB
testcase_33	AC	1 ms; 4,372 KB
testcase_34	AC	2 ms; 4,368 KB
testcase_35	AC	1 ms; 4,368 KB
testcase_36	AC	2 ms; 4,372 KB
testcase_37	AC	1 ms; 4,368 KB
testcase_38	AC	406 ms; 15,148 KB
testcase_39	AC	417 ms; 15,088 KB
testcase_40	AC	297 ms; 13,584 KB
testcase_41	AC	499 ms; 15,148 KB
testcase_42	AC	501 ms; 15,144 KB
testcase_43	AC	489 ms; 15,148 KB
testcase_44	AC	514 ms; 15,192 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)

template<int MOD> struct Fp {
	long long val;
	constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) val += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr Fp operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
	constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
	constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
	constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
	constexpr Fp& operator += (const Fp& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr Fp& operator -= (const Fp& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr Fp& operator *= (const Fp& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr Fp& operator /= (const Fp& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const Fp& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};
 
// 二項係数ライブラリ
template<class T> struct BiCoef {
	vector<T> fact_, inv_, finv_;
	constexpr BiCoef() {}
	constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
		init(n);
	}
	constexpr void init(int n) noexcept {
		fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
		int MOD = fact_[0].getmod();
		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];
		}
	}
	constexpr T com(int n, int k) const noexcept {
		if (n < k || n < 0 || k < 0) return 0;
		return fact_[n] * finv_[k] * finv_[n-k];
	}
	constexpr T fact(int n) const noexcept {
		if (n < 0) return 0;
		return fact_[n];
	}
	constexpr T inv(int n) const noexcept {
		if (n < 0) return 0;
		return inv_[n];
	}
	constexpr T finv(int n) const noexcept {
		if (n < 0) return 0;
		return finv_[n];
	}
};
 
const int MOD = 1000000007;
// const int MOD = 
using mint = Fp<MOD>;
BiCoef<mint> bc;
//bc.init(500050);

template <typename T>
struct SegmentTree{
	using F = function<T(T,T)>;
	int n;
	F f;
	T ti;
	vector<T> dat;
	SegmentTree(){};
	SegmentTree(F f,T ti):f(f),ti(ti){}
	void init(int n_){
		n=1;
		while(n<n_) n<<=1;
		dat.assign(n<<1,ti);
	}
	void build(const vector<T> &v){
		int n_=v.size();
		init(n_);
		for(int i=0;i<n_;i++) dat[n+i]=v[i];
		for(int i=n-1;i;i--)
			dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
	}
	void set_val(int k,T x){
		dat[k+=n]=x;
		while(k>>=1)
			dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);
	}
	T query(int a,int b){
		T vl=ti,vr=ti;
		for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {
			if(l&1) vl=f(vl,dat[l++]);
			if(r&1) vr=f(dat[--r],vr);
		}
		return f(vl,vr);
	}
};
//auto f = [](){};
//auto seg = SegmentTree<T,decltype(f)>(f,Ti);

signed main(){
	int N;
	cin >> N;
	vector<int>a(N);
	REP(i,N){
		cin >> a[i];
	}
	SegmentTree<int>seg([](int a,int b){return gcd(a,b);},0);
	seg.build(a);
	int ans = N * (N + 1) / 2;
	int r = 0;
	for(int l = 0;l < N;l++){
		while(r != N && seg.query(l,r + 1) != 1){
			++r;
		}
		ans -= r - l;
		if(l == r)++r;
	}
	cout << ans << endl;
}