結果
| 問題 | No.1036 Make One With GCD 2 |
| ユーザー |
 heno239
|
| 提出日時 | 2020-08-02 15:43:47 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 3,891 bytes |
| コンパイル時間 | 1,422 ms |
| コンパイル使用メモリ | 117,308 KB |
| 実行使用メモリ | 33,920 KB |
| 最終ジャッジ日時 | 2024-07-18 15:16:17 |
| 合計ジャッジ時間 | 10,845 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | -- * 4 |
| other | TLE * 1 -- * 40 |
ソースコード
#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 longtypedef 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 SegT {private:int sz; vector<ll> node;const ll init_c = 0;public:SegT(vector<ll> v) {int n = v.size();sz = 1;while (sz < n)sz *= 2;node.resize(2 * sz - 1, init_c);rep(i, n) {node[i + sz - 1] = v[i];}per(i, sz - 1) {node[i] = f(node[2 * i + 1], node[2 * i + 2]);}}ll f(ll a, ll b) {if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}int loc(int le) {int k = le + sz - 1;ll g = node[k];if (g == 1)return le;while (k > 0) {int pre = k;k = (k - 1) / 2;if (2 * k + 2 == pre) {}else {if (f(g, node[2 * k + 2]) == 1) {k = 2 * k + 2; break;}else {g = f(g, node[2 * k + 2]);}}}if (k == 0)return -1;while (k < sz - 1) {if (f(g, node[2 * k + 1]) == 1) {k = 2 * k + 1;}else {g = f(g, node[2 * k + 1]);k = 2 * k + 2;}}return k - (sz - 1);}};void solve() {int n; cin >> n;vector<ll> a(n);rep(i, n)cin >> a[i];SegT st(a);ll ans = 0;rep(i, n) {int ri = st.loc(i);if (ri >= 0) {ans += n - ri;}}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;}