the-hyp0cr1t3 / cc Goto Github PK

Contributors

Stargazers

Forkers

abhinav2011 knakul853 janubalraj hritwik21 physah86 saraff13 kaustubhgangwar mujtaba1747 icedaway abhisekm2000 abhi14nexu sinhatushar sushant2308 pathikrit2407 b-martha duttaani parthkris13 ramuked ugpcis snehalmahima the-localhost subhajeet01 vijaykm01 cosmicsarthak igoswamik mrmagicpotato007 hmsayem ritz71020 sahajgupta11 tajul-islam-refath geekboi777 pulok000 perdente karmakersagar animeshagrawal26 roshnirajan1106 shahidraza77 abhishek-singh-iit yadavvikas007 arynkr kanisht09 fraz-uddin07 shreyrastogi madhav-poojari keertangh harsh19189 ravi-dinkar devanshuyadav mayankt18 mdfarhansadiq anandj123 tharun5 avneeshg03 prantaneel venuchoudhary001 vibhor14 jabeddhali samia35-2973 ahamed-sabbir nihal337 ibverma vivekdhir77 jayant-001 blayush alamriku iamkrati22 bipul1604 narendraiiitl s166harth kptriescoding lekhit kart-001 alcatrazfp muntasirnahid dineshgvs paponahasan nirmit06 vikasbairwa saavrm26 ductringuyen sthamish crazyguitar udaysaigudla1111 voldemort373 akash-sharma-1 piyushmishra5693 rahulveeran geeteshydv arunsharmalearning 9x9x9x ksj14-kumar anshg1214 kashimmirza shaiksarfraj-tech wenchuanz dhruv-1010 vijay1213 rahulverma0711 aswathm78 jasper166

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