ABC283 G. Partial Xor Enumeration

Difficulty:2173

問題

解法

実装

code:cpp

bool solve(){

LL(n);

LL(l,r);

l--,r--;

vector<ll>base;

rep(i,n){

LL(a);

for(auto j:base)chmin(a,a^j);

for(auto&&j:base)chmin(j,j^a);

if(a)base.push_back(a);

}

sort(ALL(base));

ll ans{};

rep(i,60){

}

cout << ans;

rep(i,l,r){

cout<<" "<<ans;

}

cout<<endl;

return false;

}