题目
题意: 给定n个点m条边,求一个最小生成树。not权值和最小,而是所有边的or值最小。
思路:
考虑到边权不超过1e9,对应2^30.
可以枚举答案,即设置0-29位均为1,从大到小将其置为0,判断满足当前or值前提下能否生成一个树,若可以,该位完全可以置为1;否则,该位必须保留。
时间复杂度: O(30 * mlogm),对于每一位执行一次Kru算法
代码:
// Problem: G. MinOr Tree
// Contest: Codeforces - Codeforces Round #764 (Div. 3)
// URL: https://codeforces.com/contest/1624/problem/G
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i)
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 2e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
if(x<0)
{
putchar('-');
x=-x;
}
if(x>9)
{
write(x/10);
}
putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
x = 0;char ch = getchar();ll f = 1;
while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
struct node{
int u,v,w;
bool operator<(const node&rhs)
{
return w < rhs.w;
}
}a[N];
int fa[N];
int find(int x)
{
return x==fa[x]?x:fa[x] = find(fa[x]);
}
bool Merge(int u,int v)
{
u = find(u),v = find(v);
if(u != v)
{
fa[v] = u;
return true;
}
return false;
}
bool check(int x)
{
int cnt = 0;
fir(i,1,n) fa[i] = i;
for(int i=0;i<m;++i)
{
if((a[i].w|x) == x)
{
if(Merge(a[i].u,a[i].v))
cnt++;
}
}
return cnt == n-1;
}
void solve()
{
int tot = 0;
cin>>n>>m;
for(int i=0;i<m;++i)
{
int x,y,z; cin>>x>>y>>z;
a[tot++] = {x,y,z};
}
int ans = (1<<30); ans -- ; //全1
for(int i=29;i>=0;--i)
{
ans ^= (1<<i);
if(!check(ans)) ans ^= (1<<i);
}
cout<<ans<<"\n";
}
signed main(void)
{
// T = 1;
OldTomato; cin>>T;
// read(T);
while(T--)
{
solve();
}
return 0;
}