結果
| 問題 | No.1036 Make One With GCD 2 |
| ユーザー |
 ningenMe
|
| 提出日時 | 2020-03-12 03:20:29 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,916 bytes |
| コンパイル時間 | 1,634 ms |
| コンパイル使用メモリ | 172,872 KB |
| 実行使用メモリ | 29,112 KB |
| 最終ジャッジ日時 | 2024-11-07 01:53:51 |
| 合計ジャッジ時間 | 9,746 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | -- | - |
| testcase_02 | -- | - |
| testcase_03 | -- | - |
| testcase_04 | -- | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
| testcase_30 | -- | - |
| testcase_31 | -- | - |
| testcase_32 | -- | - |
| testcase_33 | -- | - |
| testcase_34 | -- | - |
| testcase_35 | -- | - |
| testcase_36 | -- | - |
| testcase_37 | -- | - |
| testcase_38 | -- | - |
| testcase_39 | -- | - |
| testcase_40 | -- | - |
| testcase_41 | -- | - |
| testcase_42 | -- | - |
| testcase_43 | -- | - |
| testcase_44 | -- | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
template<class Operator> class SegmentTree {
Operator Op; //Operator 演算子、型、単位元を持つ
using typeNode = decltype(Op.unitNode); //nodeの型
size_t length; //セグメント木の最下段の要素の数(vectorの要素の数を超える2べきの数)
vector<typeNode> node; //ノード
public:
//unitで初期化
SegmentTree(const size_t num){
for (length = 1; length < num; length *= 2);
node.resize(2 * length, Op.unitNode);
}
//vectorで初期化
SegmentTree(const vector<typeNode> & vec){
for (length = 1; length < vec.size(); length *= 2);
node.resize(2 * length, Op.unitNode);
for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i];
for (int i = length - 1; i >= 0; --i) node[i] = Op.funcNode(node[(i<<1)+0],node[(i<<1)+1]);
}
//同じinitで初期化
SegmentTree(const size_t num, const typeNode init) {
for (length = 1; length < num; length *= 2);
node.resize(2 * length, init);
}
//idx : 0-indexed
void update(size_t idx, const typeNode var) {
if(idx < 0 || length <= idx) return;
idx += length;
node[idx] = Op.funcMerge(node[idx],var);
while(idx >>= 1) node[idx] = Op.funcNode(node[(idx<<1)+0],node[(idx<<1)+1]);
}
//[l,r)
typeNode get(int l, int r) {
if (l < 0 || length <= l || r < 0 || length < r) return Op.unitNode;
typeNode vl = Op.unitNode, vr = Op.unitNode;
for(l += length, r += length; l < r; l >>=1, r >>=1) {
if(l&1) vl = Op.funcNode(vl,node[l++]);
if(r&1) vr = Op.funcNode(node[--r],vr);
}
return Op.funcNode(vl,vr);
}
void print(){
cout << "{ " << get(0,1);
for(int i = 1; i < length; ++i) cout << ", " << get(i,i+1);
cout << " }" << endl;
for(int i = 1,j = 1; i < 2*length; ++i) {
cout << node[i] << " ";
if(i==((1<<j)-1) && ++j) cout << endl;
}
}
};
//一点加算 区間最大
template<class typeNode> struct nodeUpdateRangeGCD {
typeNode unitNode = 0;
typeNode funcNode(typeNode l,typeNode r){return ((r == 0) ? l : funcNode(r, l % r));}
typeNode funcMerge(typeNode l,typeNode r){return r;}
};
int main() {
int N; cin >> N;
vector<ll> A(N+1,1);
for(int i = 0; i < N; ++i) cin >> A[i];
SegmentTree<nodeUpdateRangeGCD<ll>> seg(A);
ll ans = 0;
for(int i = 0; i < N; ++i) {
if(A[i] == 1){
ans += (N-i);
}
else{
int ok = N,ng = i,md;
while(ok-ng>1){
md = (ok+ng)/2;
(seg.get(i,md+1)==1?ok:ng)=md;
}
ans += (N-ok);
}
}
cout << ans << endl;
return 0;
}