Submission #46510029

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename T>
void space(const vector<T> &vs){
  for(size_t i=0;i<vs.size();i++){
    if(i) cout<<' ';
    cout<<vs[i];
  }
  cout<<'\n';
}

//INSERT ABOVE HERE
void solve(){

  Int n,m;
  cin>>n>>m;

  using ll = long long;
  auto ast=[&](set<ll>& ss){
    while(1){
      set<ll> nx;
      for(auto&a:ss){
        for(auto&b:ss){
          nx.emplace(a|b);
          nx.emplace(a&b);
        }
      }
      if(nx.size()==ss.size()) break;
      ss=nx;
    }
  };

  mt19937 mt(1333);
  uniform_int_distribution<ll> ud(0,(ll(1)<<n)-1);

  set<ll> ss;
  while((Int)ss.size()!=m){
    ss.clear();
    ss.emplace(0);
    ss.emplace((ll(1)<<n)-1);
    while((Int)ss.size()<m){
      ll v=ud(mt);
      while(ss.count(v)) v=ud(mt);
      ss.emplace(v);
      ast(ss);
    }
  }
  space(vector<ll>(ss.begin(),ss.end()));
}

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  int T;
  cin>>T;
  while(T--) solve();
  return 0;
}

Submission Info

Judge Result