#413994 (C++14) No.880 Yet Another Segment Tree Problem

提出ソース

結果

問題	No.880 Yet Another Segment Tree Problem
ユーザー	naoya_t
提出日時	2020-01-03 22:55:40
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	TLE
実行時間	-
コード長	10,855 bytes
コンパイル時間	2,847 ms
コンパイル使用メモリ	205,828 KB
実行使用メモリ	233,636 KB
最終ジャッジ日時	2024-11-22 19:44:50
合計ジャッジ時間	147,278 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 10,496 KB
testcase_01	AC	17 ms 131,508 KB
testcase_02	AC	22 ms 10,496 KB
testcase_03	AC	21 ms 10,496 KB
testcase_04	AC	15 ms 154,088 KB
testcase_05	AC	20 ms 154,356 KB
testcase_06	AC	10 ms 155,952 KB
testcase_07	AC	20 ms 10,496 KB
testcase_08	AC	22 ms 158,848 KB
testcase_09	AC	21 ms 150,504 KB
testcase_10	AC	21 ms 154,088 KB
testcase_11	TLE	-
testcase_12	TLE	-
testcase_13	TLE	-
testcase_14	TLE	-
testcase_15	TLE	-
testcase_16	TLE	-
testcase_17	TLE	-
testcase_18	TLE	-
testcase_19	TLE	-
testcase_20	TLE	-
testcase_21	TLE	-
testcase_22	TLE	-
testcase_23	TLE	-
testcase_24	AC	3,970 ms 101,888 KB
testcase_25	AC	4,087 ms 105,856 KB
testcase_26	AC	4,066 ms 99,712 KB
testcase_27	AC	3,905 ms 103,808 KB
testcase_28	AC	4,368 ms 100,480 KB
testcase_29	TLE	-
testcase_30	TLE	-
testcase_31	TLE	-
testcase_32	AC	3,400 ms 81,280 KB
testcase_33	AC	4,594 ms 81,792 KB
testcase_34	TLE	-
testcase_35	AC	4,780 ms 81,920 KB
testcase_36	AC	4,592 ms 83,200 KB
testcase_37	AC	4,439 ms 233,636 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


template <typename Elem, typename LazyOperand>
class LazySegmentTree {
 public:
    Elem (*f)(Elem a, Elem b);
    Elem (*g)(Elem a, LazyOperand b);
    void (*h)(LazyOperand& a, LazyOperand b);
    using fTYPE = decltype(f);
    using gTYPE = decltype(g);
    using hTYPE = decltype(h);

    Elem elem_ident;
    LazyOperand lazy_operand_ident;
    vector<Elem> elems;
    vector<LazyOperand> lazy_operands;
    int n, height;

    LazySegmentTree(fTYPE f, gTYPE g, hTYPE h,
                    Elem elem_ident, LazyOperand lazy_operand_ident)
        : f(f), g(g), h(h),
          elem_ident(elem_ident), lazy_operand_ident(lazy_operand_ident) {}

    void init(int n_temp) {
        n = 1; height = 0;
        while (n < n_temp) { n <<= 1; ++height; }
        elems.assign(2*n, elem_ident);
        lazy_operands.assign(2*n, lazy_operand_ident);
    }

    void build(const vector<Elem>& v){
        int n_temp = v.size();
        init(n_temp);
        rep(i,n_temp) elems[n+i] = v[i];
        for (int i=n-1; i>0; --i) {
            elems[i] = (*f)(elems[i*2], elems[i*2+1]);
        }
    }

    inline void swipe(int k){
        elems[k] = reflect(k);
        lazy_operands[k] = lazy_operand_ident;
    }
    inline void assign_merged_lazy(int dest, LazyOperand x) {
        (*h)(lazy_operands[dest], x);
    }

    inline Elem reflect(int k){
        return (lazy_operands[k] == lazy_operand_ident) ? elems[k] : (*g)(elems[k], lazy_operands[k]);
    }

    inline void _eval(int k){
        if (lazy_operands[k] != lazy_operand_ident) {
            assign_merged_lazy(k*2, lazy_operands[k]);
            assign_merged_lazy(k*2+1, lazy_operands[k]);

            elems[k] = reflect(k);
            lazy_operands[k] = lazy_operand_ident;
        }
    }

    inline void eval_down(int k) {
        for (int i=height; i>0; --i) {
            _eval(k >> i);
        }
    }

    inline void recalc(int k) {
        while (k >>= 1) {
            elems[k] = (*f)(reflect(k*2), reflect(k*2+1));
        }
    }

    void update(int a, int b, LazyOperand x) {
        a += n; b += n;
        eval_down(a);
        eval_down(b-1);
        for (int l=a,r=b; l<r; l>>=1,r>>=1) {
            if (l & 1) assign_merged_lazy(l++, x);
            if (r & 1) assign_merged_lazy(--r, x);
        }
        recalc(a);
        recalc(b-1);
    }

    void set_val(int a, Elem e) {
        a += n;
        eval_down(a);
        elems[a] = e;
        lazy_operands[a] = lazy_operand_ident;
        recalc(a);
    }

    Elem query(int a, int b) {
        a += n; b += n;
        eval_down(a);
        eval_down(b-1);
        Elem vl = elem_ident, vr = elem_ident;
        for (int l=a,r=b; l<r; l>>=1,r>>=1) {
            if (l & 1) vl = (*f)(vl, reflect(l++));
            if (r & 1) vr = (*f)(reflect(--r), vr);
        }
        Elem merged = (*f)(vl, vr);
        return merged;
    }

    void desc() {
    }
};


template <typename T>
class MyLazySegTree {
    using Elem = pair<pair<T,T>, unordered_map<T,int>>;
    using LazyOp = pair<int,T>;
    using LazyOperand = vector<LazyOp>;
    using Monoid = pair<Elem,int>;

    static Monoid f(Monoid a, Monoid b) {
        unordered_map<T,int> ab_map;
        T ab_sum = 0, ab_max = 0;
        for (auto& p: a.first.second) {
            ab_map[p.first] += p.second;
            ab_sum += p.first * p.second;
            ab_max = max(ab_max, p.first);
        }
        for (auto& p: b.first.second) {
            ab_map[p.first] += p.second;
            ab_sum += p.first * p.second;
            ab_max = max(ab_max, p.first);
        }
        return Monoid(Elem(make_pair(ab_sum, ab_max), ab_map), a.second+b.second);
    }
    static Monoid g(Monoid a, LazyOperand b) {
        int mag = a.second;
        unordered_map<T,int> ab_map = a.first.second, tmp_map;
        T ab_sum = 0, ab_max = 0;

        for (LazyOp& op: b) {
            T k = op.second;
            if (op.first) {
                ab_map.clear();
                ab_map[k] = mag;
                ab_sum = k*mag;
                ab_max = k;
            } else {
                tmp_map.clear();
                ab_sum = ab_max = 0;
                for (auto& p: ab_map) {
                    T g = gcd(p.first, k);
                    tmp_map[g] += p.second;
                    ab_sum += g * p.second;
                    ab_max = max(ab_max, g);
                }
                swap(ab_map, tmp_map);
            }
        }
        return Monoid(Elem(make_pair(ab_sum, ab_max), ab_map), mag);
    }
    static void h(LazyOperand& a, LazyOperand b) {
        int al = a.size(), bl = b.size();
        int a_assign = -1;
        rep(i,al){
            if (a[i].first) { a_assign = i; break; }
        }
        rep(i,bl){
            if (b[i].first) {
                a.assign(1, b[i]);
            } else {
                if (!a.empty() && !a.back().first) {
                    a.back().second = gcd(a.back().second, b[i].second);
                } else {
                    a.pb(b[i]);
                }
            }
        }
    }
public:
    LazySegmentTree<Monoid, LazyOperand> *st = nullptr;
public:
    MyLazySegTree(int size) {
        this->st = new LazySegmentTree<Monoid, LazyOperand>(
                     &f, &g, &h, Monoid(Elem(),1), vector<LazyOp>() );
        this->st->build(vector<Monoid>(size, Monoid(Elem(),1)));
    }
    MyLazySegTree(vector<T>& ar) {
        this->st = new LazySegmentTree<Monoid, LazyOperand>(
                     &f, &g, &h, Monoid(Elem(),1), vector<LazyOp>() );
        vector<Monoid> tmp(ar.size());
        rep(i, ar.size()) {
            tmp[i] = Monoid(Elem(make_pair(ar[i], ar[i]), {{ar[i], 1}}), 1);
        }
        this->st->build(tmp);
    }
    virtual ~MyLazySegTree() { if (st != nullptr) delete st; }

public:
    void assign(int l, int r, T x) {
        st->update(l, r, vector<LazyOp>{ LazyOp(1,x) });
    }
    void update_gcd(int l, int r, T x){
        st->update(l, r, vector<LazyOp>{ LazyOp(0,x) });
    }
    T query_max(int l, int r) {
        Elem elem = st->query(l, r).first;
        T ans = elem.first.second;
        return ans;
    }
    T query_sum(int l, int r) {
        Elem elem = st->query(l, r).first;
        T ans = elem.first.first;
        return ans;
    }
};

inline vll vi2vll(vi& orig) {
    int L = orig.size();
    vll dest(L);
    rep(i, L) dest[i] = (ll)orig[i];
    return dest;
}

int main() {
    int N, Q; scanf("%d %d%*c", &N, &Q);
    vi a(N); loadvec(a,N);
    vll aLL = vi2vll(a);
    MyLazySegTree<ll> st(aLL);
    rep(i,Q){
        int op, l, r, x;
        scanf("%d ", &op);
        switch (op) {
            case 1:
            {
                scanf("%d %d %d%*c", &l, &r, &x); --l;
                st.assign(l, r, x);
                break;
            }
            case 2:
            {
                scanf("%d %d %d%*c", &l, &r, &x); --l;
                st.update_gcd(l, r, x);
                break;
            }
            case 3:
            {
                scanf("%d %d%*c", &l, &r); --l;
                ll y = st.query_max(l, r);
                printf("%lld\n", y);
                break;
            }
            case 4:
            {
                scanf("%d %d%*c", &l, &r); --l;
                ll y = st.query_sum(l, r);
                printf("%lld\n", y);
                break;
            }
        }
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード