Submission #631608

#	Time	Username	Problem	Language	Result	Execution time	Memory
631608		Soul234	Garaža (COCI17_garaza)	C++14	120 / 160	698 ms	33608 KiB

garaza

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

void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << h; if(sizeof...(t)) cerr << ", ";
    DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL

#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
#define fi first
#define se second

using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;

void setIO(string NAME = "") {
    cin.tie(0)->sync_with_stdio(0);
    if(sz(NAME)) {
        freopen((NAME + ".inp").c_str(),"r",stdin);
        freopen((NAME + ".out").c_str(),"w",stdout);
    }
}

tcT> bool ckmin(T&a, const T&b) {
    return b < a ? a=b,1 : 0; }
tcT> bool ckmax(T&a, const T&b) {
    return b > a ? a=b,1 : 0; }

const int MOD = 1e9 + 7;

struct Dat {
    V<pi> l, r;
    ll cnt;
    Dat() : cnt(0) {}
    Dat(int val) {
        l = r = { {0,0}, {1, val} };
        cnt = val != 1 ? 1 : 0;
    }
};

void expand(V<pi> &ret, const V<pi> &rhs) {
    int st = ret.back().fi;
    each(p, rhs) {
        int pos = st + p.fi;
        if(p.se % ret.back().se == 0) ret.back().fi = pos;
        else ret.pb({pos, __gcd(p.se, ret.back().se)});
    }
}

Dat comb(const Dat& lf, const Dat& rt) {
    if(lf.l.empty()) return rt;
    if(rt.l.empty()) return lf;

    Dat res; res.l = lf.l; res.r = rt.r;
    expand(res.l, rt.l);
    expand(res.r, lf.r);
    int j = sz(rt.l) - 1;
    res.cnt = lf.cnt + rt.cnt;
    FOR(i,1,sz(lf.r)) {
        while(j > 0 && __gcd(rt.l[j].se, lf.r[i].se) == 1) j--;
        res.cnt += (lf.r[i].fi - lf.r[i-1].fi) * rt.l[j].fi;
    }
    return res;
}

struct SegTree {
    int N; V<Dat> seg;
    const Dat ID = Dat();
    void init(int _N) {
        for(N = 1; N<_N; ) N*=2;
        seg.assign(N*2, ID);
    }
    void pull(int p) { seg[p] = comb(seg[p<<1], seg[p<<1|1]); }
    void upd(int p, const Dat&val) {
        seg[p += N] = val;
        for(p >>= 1; p>0; p >>= 1)
            pull(p);
    }
    Dat query(int l, int r) {
        Dat resl = ID, resr = ID;
        for(l += N, r += N+1; l<r; l >>= 1, r >>= 1) {
            if(l&1) resl = comb(resl, seg[l++]);
            if(r&1) resr = comb(seg[--r], resr);
        }
        return comb(resl, resr);
    }
};

int N, Q;
SegTree st;

void solve() {
    cin >> N >> Q;
    st.init(N+1);
    FOR(i,1,N+1) {
        int val; cin >> val;
        st.upd(i, Dat(val));
    }
    while(Q-- > 0) {
        int t;
        cin >> t;
        if(t == 1) {
            int p, val;
            cin >> p >> val;
            st.upd(p, Dat(val));
        }
        else {
            int l, r;
            cin >> l >> r;
            cout << st.query(l, r).cnt << nl;
        }
    }
}

int main() {
    setIO();

    int t=1;
    //cin>>t;
    while(t-->0) {
        solve();
    }

    return 0;
}

Compilation message (stderr)

garaza.cpp: In function 'void setIO(std::string)':
garaza.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen((NAME + ".inp").c_str(),"r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
garaza.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((NAME + ".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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