Submission #1293364

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293364		ndan	Garaža (COCI17_garaza)	C++20	160 / 160	851 ms	48700 KiB

garaza

#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define file "test"
#define forr(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define forf(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define MASK(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
const int maxn = 1e5 + 3;
const int MOD = 1e9 + 7; // 998244353 // 1e9 + 2277 // 1e9 + 5277
const int inf = 1e18;
const int oo = 1e9 + 7;
const float eps = 1e-6;

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y) {
            x = y;
            return true;
        }
        return 0;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y) {
            x = y;
            return true;
        }
        return 0;
    }
/* END OF TEMPLATE. WHAT A SIGMA! TAKE A DEEP BREATH AND READY FOR CODING :D */

int n, q, a[maxn];

struct node {
    int len, all_g, cnt_g1;
    vector<pii> pref, suf;
} st[maxn << 2];

node merge(node a, node b) {
    if (!a.len) return b;
    if (!b.len) return a;
    node res;
    res.len = a.len + b.len;
    res.all_g = __gcd(a.all_g, b.all_g);
    res.pref = a.pref;
    for (pii &it : b.pref) {
        int g = __gcd(a.all_g, it.fi);
        if (res.pref.size() && res.pref.back().fi == g) res.pref.back().se += it.se;
        else res.pref.pb({g, it.se});
    }
    res.suf = b.suf;
    for (pii& it : a.suf) {
        int g = __gcd(b.all_g, it.fi);
        if (res.suf.size() && res.suf.back().fi == g) res.suf.back().se += it.se;
        else res.suf.pb({g, it.se});
    }
    res.cnt_g1 = a.cnt_g1 + b.cnt_g1;
    for (pii &it : a.suf) 
        for (pii& it2 : b.pref) 
            if (__gcd(it.fi, it2.fi) == 1)
                res.cnt_g1 += it.se * it2.se;
    return res;
}

void build(int id, int l, int r) {
    if (l == r) {
        node cur;
        cur.len = 1;
        cur.all_g = a[l];
        cur.pref.clear(); cur.pref.pb({a[l], 1});
        cur.suf.clear(); cur.suf.pb({a[l], 1});
        cur.cnt_g1 = (a[l] == 1 ? 1 : 0);
        st[id] = cur;
        return;
    }
    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    st[id] = merge(st[id << 1], st[id << 1 | 1]);
}

void update(int id, int l, int r, int i, int val) {
    if (l > i || r < i) return; 
    if (l == r) {
        node cur;
        cur.len = 1;
        cur.all_g = val;
        cur.pref.clear(); cur.pref.pb({val, 1});
        cur.suf.clear(); cur.suf.pb({val, 1});
        cur.cnt_g1 = (val == 1 ? 1 : 0);
        st[id] = cur;
        return;
    }
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, i, val);
    update(id << 1 | 1, mid + 1, r, i, val);
    st[id] = merge(st[id << 1], st[id << 1 | 1]);
}

node get(int id, int l, int r, int u, int v) {
    if (l >= u && r <= v) return st[id];
    int mid = (l + r) >> 1;
    if (v <= mid) return get(id << 1, l, mid, u, v);
    if (u > mid) return get(id << 1 | 1, mid + 1, r, u, v);
    node L = get(id << 1, l, mid, u, v);
    node R = get(id << 1 | 1, mid + 1, r, u, v);
    return merge(L, R);
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> q;
    forr(i, 1, n) cin >> a[i];
    build(1, 1, n);
    while (q--) {
        int op, x, y;
        cin >> op >> x >> y;
        if (op == 1) update(1, 1, n, x, y);
        else {
            node res = get(1, 1, n, x, y);
            int len = res.len;
            int tot = len * (len + 1) / 2;
            int ans = tot - res.cnt_g1;
            cout << ans << "\n";
        }
    }
    return 0;
}

• Subtask 1: 40 / 40
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40
• Subtask 4: 40 / 40