rcpl

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub ruthen71/rcpl

:heavy_check_mark: segment_tree/test/segment_tree_gcd.test.cpp

Depends on

Code

#define PROBLEM "https://yukicoder.me/problems/no/1036"

#include <iostream>
#include <numeric>

#include "../../algebra/monoid/monoid_gcd.hpp"
#include "../../segment_tree/segment_tree.hpp"

int main() {
    int N;
    std::cin >> N;
    std::vector<long long> A(N);
    for (int i = 0; i < N; i++) std::cin >> A[i];
    SegmentTree<MonoidGcd<long long>> seg(A);
    auto f = [](long long v) -> bool { return v != 1LL; };
    long long ansL = 0, ansR = 0;
    for (int l = 0; l < N; l++) {
        int r = seg.max_right(l, f);
        ansL += N - r;
    }
    for (int r = N; r > 0; r--) {
        int l = seg.min_left(r, f);
        ansR += l;
    }
    assert(ansL == ansR);
    std::cout << ansL << '\n';
    return 0;
}
#line 1 "segment_tree/test/segment_tree_gcd.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/1036"

#include <iostream>
#include <numeric>

#line 2 "algebra/monoid/monoid_gcd.hpp"

template <class T> struct MonoidGcd {
    using value_type = T;
    static constexpr T operation(const T& a, const T& b) noexcept {
        return std::gcd(a, b);
    }
    static constexpr T identity() noexcept { return T(0); }
    static constexpr bool commutative = true;
};
#line 2 "segment_tree/segment_tree.hpp"

#line 2 "misc/bit_ceil.hpp"

#include <cassert>

#if __cplusplus >= 202002L
#include <bit>
#endif

// bit_ceil
// (0, 1, 2, 3, 4) -> (1, 1, 2, 4, 4)
#if __cplusplus >= 202002L
using std::bit_ceil;
#else
unsigned int bit_ceil(unsigned int x) {
    unsigned int p = 1;
    while (p < x) p *= 2;
    return p;
}
unsigned long long int bit_ceil(unsigned long long int x) {
    unsigned long long int p = 1;
    while (p < x) p *= 2;
    return p;
}
#endif
int bit_ceil(int x) {
    assert(x >= 0);
    return bit_ceil((unsigned int)(x));
}
long long int bit_ceil(long long int x) {
    assert(x >= 0);
    return bit_ceil((unsigned long long int)(x));
}
#line 2 "misc/countr_zero.hpp"

#if __cplusplus >= 202002L
#include <bit>
#endif

// countr_zero
// (000, 001, 010, 011, 100) -> (32, 0, 1, 0, 2)
#if __cplusplus >= 202002L
using std::countr_zero;
#else
int countr_zero(unsigned int x) {
    return x == 0 ? 32 : __builtin_ctz(x);
}
int countr_zero(unsigned long long int x) {
    return x == 0 ? 64 : __builtin_ctzll(x);
}
#endif
int countr_zero(int x) { return countr_zero((unsigned int)(x)); }
int countr_zero(long long int x) {
    return countr_zero((unsigned long long int)(x));
}
#line 5 "segment_tree/segment_tree.hpp"

#line 7 "segment_tree/segment_tree.hpp"
#include <vector>

// Segment Tree
template <class MS> struct SegmentTree {
  public:
    using S = typename MS::value_type;

    SegmentTree() = default;

    explicit SegmentTree(int n)
        : SegmentTree(std::vector<S>(n, MS::identity())) {}

    explicit SegmentTree(const std::vector<S>& v) : n((int)(v.size())) {
        size = bit_ceil(n);
        log = countr_zero(size);
        d = std::vector<S>(size << 1, MS::identity());
        for (int i = 0; i < n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, const S& x) {
        assert(0 <= p and p < n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    void add(int p, const S& x) {
        assert(0 <= p and p < n);
        p += size;
        d[p] = MS::operation(d[p], x);
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S operator[](int p) const {
        assert(0 <= p and p < n);
        return d[p + size];
    }

    S get(int p) const {
        assert(0 <= p && p < n);
        return d[p + size];
    }

    S prod(int l, int r) const {
        assert(0 <= l and l <= r and r <= n);
        S sml = MS::identity(), smr = MS::identity();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = MS::operation(sml, d[l++]);
            if (r & 1) smr = MS::operation(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return MS::operation(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <class G> int max_right(int l, G& g) const {
        assert(0 <= l and l <= n);
        assert(g(MS::identity()));
        if (l == n) return n;
        l += size;
        S sm = MS::identity();
        do {
            while ((l & 1) == 0) l >>= 1;
            if (!g(MS::operation(sm, d[l]))) {
                while (l < size) {
                    l <<= 1;
                    if (g(MS::operation(sm, d[l]))) {
                        sm = MS::operation(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = MS::operation(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return n;
    }

    template <class G> int min_left(int r, G& g) const {
        assert(0 <= r and r <= n);
        assert(g(MS::identity()));
        if (r == 0) return 0;
        r += size;
        S sm = MS::identity();
        do {
            r--;
            while (r > 1 and (r & 1)) r >>= 1;
            if (!g(MS::operation(d[r], sm))) {
                while (r < size) {
                    r = (r << 1) | 1;
                    if (g(MS::operation(d[r], sm))) {
                        sm = MS::operation(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = MS::operation(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

    std::vector<S> make_vector() const {
        std::vector<S> vec(n);
        for (int i = 0; i < n; i++) vec[i] = get(i);
        return vec;
    }

  private:
    int n, log, size;
    std::vector<S> d;

    inline void update(int k) {
        d[k] = MS::operation(d[k << 1], d[(k << 1) | 1]);
    }
};
#line 8 "segment_tree/test/segment_tree_gcd.test.cpp"

int main() {
    int N;
    std::cin >> N;
    std::vector<long long> A(N);
    for (int i = 0; i < N; i++) std::cin >> A[i];
    SegmentTree<MonoidGcd<long long>> seg(A);
    auto f = [](long long v) -> bool { return v != 1LL; };
    long long ansL = 0, ansR = 0;
    for (int l = 0; l < N; l++) {
        int r = seg.max_right(l, f);
        ansL += N - r;
    }
    for (int r = N; r > 0; r--) {
        int l = seg.min_left(r, f);
        ansR += l;
    }
    assert(ansL == ansR);
    std::cout << ansL << '\n';
    return 0;
}
Back to top page