the-hyp0cr1t3/cc

Everything competitive programming related - introductory guide, topics/concepts, practice problems, snippets & templates, tips & tricks and more.

cc's Issues

Hook

Can't make the Hook plugin work.

Suggestion on Two Pointers

The first quoted resource is not available. You need to subscribe to the author's quora to be able to see the article. Therefore I'd suggest citing other resources or taking into consideration removing this one.

Quoted source:
https://www.quora.com/q/techparoksha/The-Two-Pointer-Algorithm

how can i change merge and build function (lazy segment tree)

as we create merge/combine function to handle queries like sum , gcd , lcm , min , max in [l,r]
( i use kactl templete for classic )
or change [l,r]=x
how can i change in this in your lazy templete

class SegmentTree {
    typedef int T;
    static constexpr T unit = INT_MAX;        //change this {INT_MAX,INT_MIN,0}
    T fun(T a, T b) { return a & b; } // (any associative fn)
    vector<T> s; int n;
public:
    SegmentTree(int n = 0, T def = unit) : s(2 * n, def), n(n) {}
    void update(int pos, T val) {
        for (s[pos += n] = val; pos /= 2;)
            s[pos] = fun(s[pos * 2], s[pos * 2 + 1]);
    }
    T query(int b, int e) { // query [b, e)
        T ra = unit, rb = unit;
        for (b += n, e += n; b < e; b /= 2, e /= 2) {
            if (b % 2) ra = fun(ra, s[b++]);
            if (e % 2) rb = fun(s[--e], rb);
        }
        return fun(ra, rb);
    }
};  
it has fun to change accordingly

Add driver functions( main() function )

I read the snippets but couldn't understand how to use it, please add a driver function or comments on how to use snippets in code.

GUIDE

Can anyone guide , how to run random tree generate code.
Simply copying the code is not working,

Ferris Wheel

Location CSES/Sorting and Searching/Ferris Wheel.cpp
For n=6, x=20, weights=19, 6, 5, 2, 3, 4
We just need 2 gondolas but here your program says we need 4.

A note on prefix sums