結果

問題 No.3444 Interval Xor MST
コンテスト
ユーザー noya2
提出日時 2026-01-07 01:31:07
言語 C++23
(gcc 15.2.0 + boost 1.89.0)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 8,773 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 4,522 ms
コンパイル使用メモリ 359,588 KB
実行使用メモリ 7,972 KB
最終ジャッジ日時 2026-02-06 20:53:23
合計ジャッジ時間 6,038 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/dsu.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/data_structure/dsu.hpp"

namespace noya2{

struct dsu {
  public:
    dsu() : _n(0), _cc(0) {}
    dsu(int n) : _n(n), _cc(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        _cc--;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    int group_count() const {
        return _cc;
    }

  private:
    int _n, _cc;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

} // namespace noya2
#line 4 "c.cpp"

ll naive(ll L, ll R){
    dsu d(R-L);
    vector<pair<ll,pll>> es;
    for (ll x = L; x < R; x++) for (ll y = x+1; y < R; y++){
        es.emplace_back(x ^ y, pll(x,y));
    }
    sort(all(es));
    ll ans = 0;
    for (auto [c, e] : es){
        auto [u, v] = e;
        u -= L;
        v -= L;
        if (d.same(u,v)) continue;
        ans += c;
        d.merge(u,v);
    }
    return ans;
}

ll slow(ll L, ll R){
    auto dfs = [&](auto sfs, ll l, ll r) -> ll {
        if (r <= L || l >= R) return 0;
        ll k = countr_zero<uint64_t>(r - l);
        if (k == 0) return 0;
        if (L <= l && r <= R){
            return (k << (k-1));
        }
        ll m = midpoint(l, r);
        ll ans = sfs(sfs,l,m) + sfs(sfs,m,r);
        if (m <= L || m >= R) return ans;
        ll il = max(l,L);
        ll ir = min(r-1,R-1);
        ll mi = linf;
        for (ll x = il; x < m; x++) for (ll y = m; y <= ir; y++){
            chmin(mi,x^y);
        }
        return ans + mi;
    };
    ll ans = dfs(dfs,0LL,1LL<<32);
    return ans;
}

ll fast(ll L, ll R){
    auto dfs = [&](auto sfs, ll l, ll r) -> ll {
        if (r <= L || l >= R) return 0;
        ll k = countr_zero<uint64_t>(r - l);
        if (k == 0) return 0;
        if (L <= l && r <= R){
            return (k << (k-1));
        }
        ll m = midpoint(l, r);
        ll ans = sfs(sfs,l,m) + sfs(sfs,m,r);
        if (m <= L || m >= R) return ans;
        ans += (1LL << (k-1));
        ll il = max(l,L);
        ll ir = min(r,R);
        ll lc = m - il, rc = ir - m;
        ll i = k-1;
        while (lc + rc <= (1LL << i)){
            assert(i >= 1);
            if (lc > (1LL << (i-1))){
                lc -= (1LL << (i-1));
            }
            else if (rc > (1LL << (i-1))){
                rc -= (1LL << (i-1));
            }
            else {
                ans += (1LL << (i-1));
            }
            i--;
        }
        return ans;
    };
    ll ans = dfs(dfs,0LL,1LL<<32);
    return ans;
}

void jikken1(){
    ll L, R; in(L,R);
    ll nans = naive(L,R);
    ll sans = slow(L,R);
    ll fans = fast(L,R);
    if (nans == fans) return ;
    // if (nans == sans) return ;
    out(L,R);
    out(nans);
    out(sans);
    out(fans);
    cout << flush;
    exit(1);
}

void solve(){
    // jikken1(); return ;
    auto [L, R] = [&]{
        ll n, m; in(n,m);
        return pll(m,m+n);
    }();
    ll ans = fast(L,R);
    out(ans);
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}
0