結果

問題 No.1036 Make One With GCD 2
ユーザー heno239heno239
提出日時 2020-08-02 17:05:51
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 469 ms / 2,000 ms
コード長 3,782 bytes
コンパイル時間 1,174 ms
コンパイル使用メモリ 120,032 KB
実行使用メモリ 23,220 KB
最終ジャッジ日時 2024-09-16 14:26:59
合計ジャッジ時間 12,256 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 105 ms
12,428 KB
testcase_01 AC 90 ms
11,208 KB
testcase_02 AC 118 ms
23,036 KB
testcase_03 AC 17 ms
8,772 KB
testcase_04 AC 27 ms
10,048 KB
testcase_05 AC 4 ms
7,748 KB
testcase_06 AC 4 ms
7,492 KB
testcase_07 AC 33 ms
9,028 KB
testcase_08 AC 28 ms
8,644 KB
testcase_09 AC 269 ms
11,164 KB
testcase_10 AC 246 ms
10,860 KB
testcase_11 AC 275 ms
11,204 KB
testcase_12 AC 251 ms
10,948 KB
testcase_13 AC 465 ms
11,076 KB
testcase_14 AC 469 ms
11,108 KB
testcase_15 AC 442 ms
10,736 KB
testcase_16 AC 436 ms
10,936 KB
testcase_17 AC 464 ms
10,952 KB
testcase_18 AC 4 ms
7,492 KB
testcase_19 AC 4 ms
7,624 KB
testcase_20 AC 5 ms
7,620 KB
testcase_21 AC 4 ms
7,492 KB
testcase_22 AC 428 ms
10,812 KB
testcase_23 AC 317 ms
9,924 KB
testcase_24 AC 449 ms
11,076 KB
testcase_25 AC 410 ms
10,692 KB
testcase_26 AC 421 ms
10,784 KB
testcase_27 AC 4 ms
7,488 KB
testcase_28 AC 4 ms
7,624 KB
testcase_29 AC 4 ms
7,492 KB
testcase_30 AC 4 ms
7,492 KB
testcase_31 AC 4 ms
7,496 KB
testcase_32 AC 4 ms
7,496 KB
testcase_33 AC 4 ms
7,624 KB
testcase_34 AC 4 ms
7,620 KB
testcase_35 AC 4 ms
7,492 KB
testcase_36 AC 3 ms
7,620 KB
testcase_37 AC 4 ms
7,620 KB
testcase_38 AC 113 ms
23,220 KB
testcase_39 AC 109 ms
11,116 KB
testcase_40 AC 321 ms
9,924 KB
testcase_41 AC 431 ms
11,396 KB
testcase_42 AC 438 ms
11,340 KB
testcase_43 AC 363 ms
16,056 KB
testcase_44 AC 410 ms
13,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
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 = acos(-1.0);

ll mod_pow(ll x, ll n, ll 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, int 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)); }

const int max_n = 1 << 18;
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];
}

struct SWAG {
private:
	vector<ll> st1, st2;
	vector<ll> rst1, rst2;
public:
	SWAG() {};
	ll f(ll a, ll b) {
		if (a < b)swap(a, b);
		while (b > 0) {
			ll r = a % b; a = b; b = r;
		}
		return a;
	}
	ll calc_all() {
		ll res = 0;
		if (st1.size())res = f(res, rst1.back());
		if (st2.size())res = f(res, rst2.back());
		return res;
	}
	void pop_front() {
		if(st1.empty()){
			reverse(all(st2));
			swap(st1, st2);
			rst1 = st1;
			for (int i = 1; i < st1.size(); i++) {
				rst1[i] = f(rst1[i - 1], st1[i]);
			}
			st2.clear();
			rst2.clear();
		}
		rst1.pop_back();
		st1.pop_back();
	}
	void push_back(ll val) {
		if (st2.empty())rst2.push_back(val);
		else rst2.push_back(f(val, rst2.back()));
		st2.push_back(val);
	}
};
void solve() {
	int n; cin >> n;
	vector<ll> a(n);
	rep(i, n)cin >> a[i];
	int ri = 0;
	SWAG sw;
	ll ans = 0;
	rep(i, n) {
		while (ri < n && sw.calc_all() != 1) {
			sw.push_back(a[ri]);
			ri++;
		}
		if (sw.calc_all() == 1) {
			ans += n - ri + 1;
		}
		sw.pop_front();
	}
	cout << ans << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//cout << grandy(2, 3, false, false) << "\n";
	//int t; cin >> t; rep(i, t)
		solve();
	return 0;
}
0