// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
edi
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
template<typename T>
struct segtree {
// https://codeforces.com/blog/entry/18051
/*=======================================================*/
struct data {
vector<pll> pref, suff;
ll cnt;
data() {
cnt = 0;
}
};
data neutral = data();
data merge(data &left, data &right) {
data curr;
curr.pref = left.pref;
for (auto [x, c] : right.pref) {
if (curr.pref.empty()) {
curr.pref.pb({x, c});
}
else {
ll p = curr.pref.back().ff;
ll g = gcd(x, p);
if (g == p) {
curr.pref.back().ss += c;
}
else {
curr.pref.pb({g, c});
}
}
}
curr.suff = right.suff;
for (auto [x, c] : left.suff) {
if (curr.suff.empty()) {
curr.suff.pb({x, c});
}
else {
ll p = curr.suff.back().ff;
ll g = gcd(x, p);
if (g == p) {
curr.suff.back().ss += c;
}
else {
curr.suff.pb({g, c});
}
}
}
curr.cnt = left.cnt + right.cnt;
ll ptr = sz(right.pref) - 1;
ll guys = 0;
for (auto [x, c] : right.pref) {
guys += c;
}
for (auto [x, c] : left.suff) {
while (ptr >= 0) {
if (gcd(x, right.pref[ptr].ff) == 1) {
guys -= right.pref[ptr].ss;
ptr--;
}
else {
break;
}
}
curr.cnt += guys * c;
}
return curr;
}
void create(int i, T v) {
tr[i].pref = {{v, 1}};
tr[i].suff = {{v, 1}};
tr[i].cnt = (v > 1);
}
void modify(int i, T v) {
tr[i].pref = {{v, 1}};
tr[i].suff = {{v, 1}};
tr[i].cnt = (v > 1);
}
/*=======================================================*/
int n;
vector<data> tr;
segtree() {
}
segtree(int siz) {
init(siz);
}
void init(int siz) {
n = siz;
tr.assign(2 * n, neutral);
}
void build(vector<T> &a, int siz) {
rep(i, siz) create(i + n, a[i]);
rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
}
void pupd(int i, T v) {
modify(i + n, v);
for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
}
data query(int l, int r) {
data resl = neutral, resr = neutral;
for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
if (l & 1) resl = merge(resl, tr[l++]);
if (!(r & 1)) resr = merge(tr[r--], resr);
}
return merge(resl, resr);
}
};
void solve(int test_case)
{
ll n, q; cin >> n >> q;
vector<ll> a(n + 5);
rep1(i, n) cin >> a[i];
segtree<ll> st(n + 5);
st.build(a, n + 1);
while (q--) {
ll t; cin >> t;
if (t == 1) {
ll i, v; cin >> i >> v;
st.pupd(i, v);
}
else {
ll l, r; cin >> l >> r;
ll ans = st.query(l, r).cnt;
cout << ans << endl;
}
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
596 KB |
Output is correct |
| 2 |
Correct |
9 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
19 ms |
2000 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
94 ms |
7104 KB |
Output is correct |
| 2 |
Correct |
123 ms |
10040 KB |
Output is correct |
| 3 |
Correct |
136 ms |
9632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
283 ms |
16588 KB |
Output is correct |
| 2 |
Correct |
349 ms |
16648 KB |
Output is correct |
| 3 |
Correct |
329 ms |
19100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
487 ms |
32988 KB |
Output is correct |
| 2 |
Correct |
658 ms |
33080 KB |
Output is correct |
| 3 |
Correct |
621 ms |
31472 KB |
Output is correct |
