結果

問題 No.1036 Make One With GCD 2
ユーザー momohara
提出日時 2020-04-24 22:50:38
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,440 ms / 2,000 ms
コード長 2,963 bytes
コンパイル時間 1,708 ms
コンパイル使用メモリ 176,760 KB
実行使用メモリ 19,200 KB
最終ジャッジ日時 2024-09-16 13:28:04
合計ジャッジ時間 17,751 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
//constexpr long long MOD = 998244353LL;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
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;
}
struct Edge {
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to; cap = _cap; rev = _rev;
}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
template<typename T, typename F>
class SegmentTree {
private:
T e;
F op;
ll n;
vector<T> dat;
public:
SegmentTree(F f, T _e, vector<T> v) :op(f), e(_e) {
int _n = v.size();
n = 1;
while (n < _n)n *= 2;
dat.resize(2 * n - 1, e);
REP(i, _n)dat[n + i - 1] = v[i];
for (int i = n - 2; i >= 0; i--)dat[i] = op(dat[i * 2 + 1], dat[i * 2 + 2]);
}
SegmentTree(F f, T _e, int _n) :op(f), e(_e) {
n = 1;
while (n < _n)n *= 2;
dat.resize(2 * n - 1, e);
for (int i = n - 2; i >= 0; i--)dat[i] = op(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = op(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
T query(int l, int r) {
//[l,r)
T left = e, right = e;
l += n - 1; r += n - 1;
while (l < r) {
if ((l & 1) == 0)left = op(left, dat[l]);
if ((r & 1) == 0)right = op(dat[r - 1], right);
l = l / 2;
r = (r - 1) / 2;
}
return op(left, right);
}
};
//
ll gcd(ll m, ll n) {
if (n == 0)return m;
return gcd(n, m % n);
}//gcd
void solve(){
ll n;
cin>>n;
Array a(n);
REP(i,n) cin>>a[i];
auto op = [](ll a, ll b) {return gcd(a,b); };
SegmentTree<ll, decltype(op)> seg(op,0,a);
ll r=1;
ll ans=0;
REP(l,n){
if(l==r) r++;
while(r<n && seg.query(l,r)!=1) r++;
if(seg.query(l,r)!=1) continue;
ans += n-r+1;
}
cout<<ans<<en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
//ll t;cin>>t;REP(i,t) solve();
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0