矩阵树定理2020HDU多校第6场j-Expectation[位运算+期望]

矩阵树定理

用于求解图上面生成树的个数，生成树的个数等于基尔霍夫矩阵的任何一个N-1阶主子式的行列式的绝对值

---

---

矩阵树模板

struct Matrix_Tree
{
    ll a[N][N];
    Matrix_Tree () {ms(a,0);}
    void init_cnt(ll val) 
    {
        memset(a,0,sizeof(a));
        for(int i = 1; i <= m; i ++)
        {
            int u = e[i].from,v = e[i].to;
            if(val == -1 || e[i].val & val)
            {
                a[u][u]++;a[v][v]++;
                a[u][v]--;a[v][u]--;
            }
        }
    }
    ll Guass()
    {
        ll ans=1;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(a[i][j]<0) a[i][j]=(a[i][j]+mod)%mod;
        for(int i=1;i<n;i++)
        {
            for(int j=i+1;j<n;j++)
            {
                while (a[j][i])
                {
                    ll t=a[i][i]/a[j][i];
                    for(int k=i;k<n;k++) a[i][k]=(a[i][k]-a[j][k]*t%mod+mod)%mod;
                    swap(a[i],a[j]);
                    ans=-ans;
                }
            }
            ans=ans*a[i][i]%mod;
            if(!ans) return 0;
        }
        return (ans+mod)%mod;
    }
}tree;

---

Expectation

---

题目大意：就是给你一张图，定义一个生成树的权值为生成树的所有边权相and的结果，问你随机生成一个生成树的期望权值是多少

---

解题思路：就是我们可以按照每一位去思考，如果这一位有贡献每一条边必须的二进制位上为1。按照这样建图就可以了

---

#include <iostream>
#include <cstdio>
#include <stack>
#include <sstream>
#include <limits.h>
#include <vector>
#include <map>
#include <cstring>
#include <deque>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#define mid ((l + r) >> 1) 
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define hash Hash
#define next Next
#define pb push_back
#define f first
#define s second
using namespace std;
const int N = 110, mod = 998244353;
const long double eps = 1e-5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
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;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
    read(first);
    read(args...);
}

struct node {
    ll from, to, val;
}e[N * N];
ll n, m;
ll qmi(ll a, ll b)
{
  ll res = 1;
  while(b)
  {
      if(b & 1) res = res * a % mod;
      b >>= 1;
      a = a * a % mod;
  }
  return res % mod;
}

inline ll inv(ll a)
{
    return qmi(a % mod,mod-2);
}

struct Matrix_Tree
{
    ll a[N][N];
    Matrix_Tree () {ms(a,0);}
    void init_cnt(ll val) 
    {
        memset(a,0,sizeof(a));
        for(int i = 1; i <= m; i ++)
        {
            int u = e[i].from,v = e[i].to;
            if(val == -1 || e[i].val & val)
            {
                a[u][u]++;a[v][v]++;
                a[u][v]--;a[v][u]--;
            }
        }
    }
    ll Guass()
    {
        ll ans=1;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(a[i][j]<0) a[i][j]=(a[i][j]+mod)%mod;
        for(int i=1;i<n;i++)
        {
            for(int j=i+1;j<n;j++)
            {
                while (a[j][i])
                {
                    ll t=a[i][i]/a[j][i];
                    for(int k=i;k<n;k++) a[i][k]=(a[i][k]-a[j][k]*t%mod+mod)%mod;
                    swap(a[i],a[j]);
                    ans=-ans;
                }
            }
            ans=ans*a[i][i]%mod;
            if(!ans) return 0;
        }
        return (ans+mod)%mod;
    }
}tree;

int main()
{
    int T;
    read(T);
    while(T --)
    {
        read(n,m);
        for(int i = 1; i <= m; ++ i)
          read(e[i].from,e[i].to,e[i].val);
        ll ans = 0;
        for(int i = 0; i <= 30; ++ i)
        {
            tree.init_cnt(1ll << i);
            ans = (ans + tree.Guass() * (1ll << i) % mod) % mod;
        }
        tree.init_cnt(-1);
        printf("%lld\n",ans * qmi(tree.Guass(),mod-2) % mod);
    }
    return 0;
}