src/math/segment_interval.hpp

View this file on GitHub
Last update: 2026-01-30 22:16:29+09:00
Include: #include "src/math/segment_interval.hpp"

Depends on

src/template.hpp

Code

#include "../template.hpp"

vector<pair<long,long>> segment_interval(long L,long R){
    vector<pair<long,long>> lv,rv;
    for(long i=0;L<R;i++){
        if((L>>i)&1){
            lv.push_back({L,L+(1l<<i)});
            L+=1l<<i;
        }
        if((R>>i)&1){
            rv.push_back({R-(1l<<i),R});
            R-=1l<<i;
        }
    }
    lv.insert(lv.end(),rv.rbegin(),rv.rend());
    return lv;
}

#line 2 "src/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#define si(a) (long)a.size()
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename S,typename F> bool chmin(S&a,F b){return b<a?(a=b,1):0;}
template<typename S,typename F> bool chmax(S&a,F b){return b>a?(a=b,1):0;}
bool _=(ios::sync_with_stdio(0),cin.tie(0),cout<<fixed<<setprecision(16),0);
#line 2 "src/math/segment_interval.hpp"

vector<pair<long,long>> segment_interval(long L,long R){
    vector<pair<long,long>> lv,rv;
    for(long i=0;L<R;i++){
        if((L>>i)&1){
            lv.push_back({L,L+(1l<<i)});
            L+=1l<<i;
        }
        if((R>>i)&1){
            rv.push_back({R-(1l<<i),R});
            R-=1l<<i;
        }
    }
    lv.insert(lv.end(),rv.rbegin(),rv.rend());
    return lv;
}