結果

問題 No.1036 Make One With GCD 2
ユーザー haruki_K
提出日時 2020-04-24 21:46:13
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 819 ms / 2,000 ms
コード長 6,207 bytes
コンパイル時間 1,661 ms
コンパイル使用メモリ 172,508 KB
実行使用メモリ 14,976 KB
最終ジャッジ日時 2024-09-16 13:13:27
合計ジャッジ時間 15,578 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T,d-1>::type>;
template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> segment tree
template <class Handler>
struct Segtree : Handler {
using Value = typename Handler::Value;
using Handler::unit; // () -> Value
using Handler::merge; // (Value,Value) -> Value
vector<Value> v; // use v[1..2*cap-1]
int cap; // // capacity: power of 2
int n; // original size
Segtree() {}
template <class... T> Segtree(T&&... x) { init(forward<T>(x)...); }
template <class F, class = decltype(declval<F>()(0))>
void init(int n, F gen) {
assert(n >= 0); this->n = n;
cap = n; //for (cap = 1; cap < n; cap <<= 1) ;;
v.resize(2*cap, unit());
for (int i = 0; i < n; i++) v[cap+i] = gen(i);
for (int i = cap-1; i >= 1; i--) v[i] = merge(v[2*i],v[2*i+1]);
}
void init(int n) { init(n, [&](int) { return unit(); }); }
void init(int n, Value const& x) { init(n, [&](int) { return x; }); }
void init(vector<Value> const& v) { init(v.size(), [&](int i) { return v[i]; }); }
int size() const { return n; }
void set(int i, Value const& x) {
assert(0 <= i); assert(i < size());
i += cap; v[i] = x;
while (i > 1) i >>= 1, v[i] = merge(v[2*i],v[2*i+1]);
}
Value operator[](int i) const { return get(i); }
Value get(int i) const {
assert(0 <= i); assert(i < size());
return v[cap + i];
}
// [l,r)
Value get(int l, int r) const {
assert(0 <= l); assert(l <= r); assert(r <= size());
Value x = unit(), y = unit();
for (l += cap, r += cap; l < r; l >>= 1, r >>= 1) {
if (l&1) x = merge(x, v[l++]);
if (r&1) y = merge(v[--r], y);
}
return merge(x,y);
}
vector<Value> dat() const {
vector<Value> ret(size());
for (int i = 0; i < size(); i++) ret[i] = get(i);
return ret;
}
};
// <<<
struct RangeGCD {
using Value = int;
constexpr static Value unit() { return 0; }
static Value merge(Value x, Value y) { return __gcd(x,y); }
};
int32_t main() {
int n; cin >> n;
vector<int> a(n); cin >> a;
Segtree<RangeGCD> seg(a);
int cnt = 0, r = 0, g = 0;
rep (l,n) {
chmax(r,l);
g = seg.get(l,r);
while (r < n && __gcd(g,a[r]) != 1) g = __gcd(g,a[r++]);
cnt += n-r;
dump(l,r);
}
cout << cnt << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0