結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2020-04-24 21:42:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 624 ms / 2,000 ms |
コード長 | 7,637 bytes |
コンパイル時間 | 3,074 ms |
コンパイル使用メモリ | 204,556 KB |
最終ジャッジ日時 | 2025-01-09 23:25:01 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>using namespace std;using lint = long long int;using pint = pair<int, int>;using plint = pair<lint, lint>;struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define ALL(x) (x).begin(), (x).end()#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; returnos; }template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}";return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; returnos; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;/*#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/pb_ds/tag_and_trait.hpp>using namespace __gnu_pbds; // find_by_order(), order_of_key()template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;*/// Nonrecursive Segment Tree (point-update, range-get)// - Conditions for operations:// - datamerge: [TDATA, TDATA] -> TDATA, e(x, y) == e(y, x)// - data2ret: [TDATA, TQUERY] -> TRET// - retmerge: [TRET, TRET] -> TRET, g(defaultRET, x) == x, g(x, y) = g(y, x)// - commutability f(e(x, y), q) == g(f(x, q), f(y, q))template <typename TDATA, typename TRET, typename TQUERY>struct NonrecursiveSegmentTree{int N;TRET defaultRET;virtual TDATA datamerge(const TDATA &, const TDATA &) = 0;virtual TRET data2ret(const TDATA &, const TQUERY &) = 0;virtual TRET retmerge(const TRET &, const TRET &) = 0;std::vector<TDATA> data;inline TDATA& at(int i) { return data[i]; }inline void _merge(int i) { at(i) = datamerge(at(i << 1), at((i << 1) + 1)); }void initialize(const std::vector<TDATA> &seq, TRET RET_ZERO) {N = seq.size();defaultRET = RET_ZERO;data = seq;data.insert(data.end(), seq.begin(), seq.end());for (int i = N - 1; i; i--) _merge(i);}NonrecursiveSegmentTree() = default;void update(int pos, const TDATA &x) {assert(pos >= 0 and pos < N);at(pos + N) = x;for (int i = pos + N; i > 1;) i >>= 1, _merge(i);}// [l, r), 0-indexedTRET get(int l, int r, TQUERY query = NULL) {assert(l >= 0 and r <= N);TRET retl = defaultRET, retr = defaultRET;l += N, r += N;while (l < r) {if (l & 1) retl = retmerge(retl, data2ret(data[l++], query));if (r & 1) retr = retmerge(data2ret(data[--r], query), retr);l >>= 1, r >>= 1;}return retmerge(retl, retr);}// Calculate smallest r that satisfies g(f(x_l, q), ..., f(x_{r - 1}, q)) <= threshold// Assumption: Monotonicity of g(x_l, ..., x_r) about r (l: fixed)// Complexity: O(log N)int binary_search(int l, const TRET &threshold, TQUERY query = NULL) {std::stack<int> rs;l += N;int r = N * 2;TRET retl = defaultRET;while (l < r) {if (l & 1) {TRET ret_tmp = retmerge(retl, data2ret(data[l], query));if (threshold > ret_tmp) {while (l * 2 < N * 2) {ret_tmp = retmerge(retl, data2ret(data[l * 2], query));if (threshold > ret_tmp) l *= 2;else retl = ret_tmp, l = l * 2 + 1;}return l - N;}l++;retl = ret_tmp;}if (r & 1) rs.push(--r);l >>= 1, r >>= 1;}while (!rs.empty()) {l = rs.top();rs.pop();TRET ret_tmp = retmerge(retl, data2ret(data[l], query));if (threshold > ret_tmp) {while (l * 2 < N * 2) {ret_tmp = retmerge(retl, data2ret(data[l * 2], query));if (threshold > ret_tmp) l *= 2;else retl = ret_tmp, l = l * 2 + 1;}return l - N;}retl = ret_tmp;}return N;}template<typename T1, typename T2, typename T3>friend std::ostream &operator<<(std::ostream &os, NonrecursiveSegmentTree<T1, T2, T3> s) {os << "[SegmentTree (len: " << s.N << ')';for (int i = 0; i < s.N; i++) os << s.at(i + s.N) << ',';os << "]";return os;}};template <typename T>struct RangeGCDQuery : public NonrecursiveSegmentTree<T, T, bool>{using SegTree = NonrecursiveSegmentTree<T, T, bool>;T datamerge(const T &vl, const T &vr) override { return std::gcd(vl, vr); };T data2ret(const T &v, const bool &q) override { return v; }T retmerge(const T &vl, const T &vr) override { return std::gcd(vl, vr); };RangeGCDQuery(const std::vector<T> &seq, T defaultmin) : SegTree::NonrecursiveSegmentTree() {SegTree::initialize(seq, defaultmin);};};int main(){int N;cin >> N;vector<lint> A(N);cin >> A;RangeGCDQuery<lint> st(A, 0);lint ret = 0;REP(i, N) ret += N - st.binary_search(i, 2);cout << ret << '\n';}