제출 #255778

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255778		leaked	Garaža (COCI17_garaza)	C++14	160 / 160	1020 ms	43444 KiB

garaza

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=2e5+3;
const int N=1e5+1;
const int ppp=73;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,N),mt19937(time(0)));
void bad(){
    cout<<"NE";
    exit(0);
}
struct seg{
    vector<pii>pref,suf;
    ll ans=0;
    int le=0;
    seg() : ans(0) {}
};
void u(vector<pii> &f,const vector<pii> &s){
    for(auto &z : s){
       int nw=(sz(f) ? __gcd(z.f,f.back().f) : z.f);
       if(sz(f) && nw==f.back().f) f.back().s+=z.s;
       else f.p_b({nw,z.s});
    }
}
seg mg(const seg &l,const seg &r){
    seg c;
    c.pref=l.pref;
    c.suf=r.suf;
    c.le=l.le+r.le;
    u(c.pref,r.pref);
    u(c.suf,l.suf);
    int rt=sz(r.pref)-1;
    ll s=r.le;
//    debug()<<imie(l.suf);
    for(int lt=0;lt<sz(l.suf);lt++){
        while(rt>=0 && __gcd(r.pref[rt].f,l.suf[lt].f)==1) s-=r.pref[rt].s,rt--;
        c.ans+=1ll*s*l.suf[lt].s;
    }
    c.ans+=l.ans+r.ans;
    return c;
}
seg tree[4*N];
int a[N];
void b_tr(int v,int tl,int tr){
    if(tl==tr){
        tree[v].suf.p_b({a[tl],1});
        tree[v].pref.p_b({a[tl],1});
        tree[v].ans=(a[tl]!=1);
        tree[v].le=1;
    }else{
        int tm=(tl+tr)>>1;
        b_tr(2*v,tl,tm);
        b_tr(2*v+1,tm+1,tr);
        tree[v]=mg(tree[2*v],tree[2*v+1]);
    }
}
void upd(int p,int val,int v,int tl,int tr){
    if(tl==tr){
        a[tl]=val;
        tree[v].suf.clear();
        tree[v].pref.clear();
        tree[v].suf.p_b({a[tl],1});
        tree[v].pref.p_b({a[tl],1});
        tree[v].ans=(a[tl]!=1);
        tree[v].le=1;
        return;
    }
    int tm=(tl+tr)>>1;
    if(tm>=p) upd(p,val,2*v,tl,tm);
    else upd(p,val,2*v+1,tm+1,tr);
    tree[v]=mg(tree[2*v],tree[2*v+1]);
}
seg q(int l,int r,int v,int tl,int tr){
    if(tl>=l && tr<=r) return tree[v];
    if(tr<l || tl>r) return seg();
    int tm=(tl+tr)>>1;
    return mg(q(l,r,2*v,tl,tm),q(l,r,2*v+1,tm+1,tr));
}
int n,m;
signed main()
{
    fast_io;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i];
    b_tr(1,0,n-1);
    while(m--){
        int tp,l,r;
        cin>>tp>>l>>r;
        if(tp==1){
            upd(l-1,r,1,0,n-1);
        }else cout<<q(l-1,r-1,1,0,n-1).ans<<endl;
    }
    return 0;
}
/*
5 1
2 3 6 4 1
2 1 4
// 1,2,3,4,2 3,3 4

*/

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