HDU6836 期望+拆位+矩阵树定理

最新推荐文章于 2021-03-26 22:37:38 发布

卡常带师

最新推荐文章于 2021-03-26 22:37:38 发布

阅读量159

点赞数

分类专栏：矩阵树

本文链接：https://blog.csdn.net/Zenith_Habitant/article/details/107856800

版权

矩阵树专栏收录该内容

1 篇文章 0 订阅

订阅专栏

//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(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;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int T;
int n , m;
ll g[105][105], G[105][105][35];
const int mod =  998244353;
ll Gauss()
{
    ll ans = 1;
    for(int i = 1; i < n; i ++)
    {
        for(int j = i + 1; j < n; j ++)
            while(g[j][i])
            {
                ll t = g[i][i] / g[j][i];
                for(int k = i; k < n; k ++)
                    g[i][k] = (g[i][k] - g[j][k] * t) % mod;
                swap(g[i], g[j]);
                ans = -ans;
            }
        ans = (ans * g[i][i]) % mod;
        if(!ans) return 0;
    }
    return (ans + mod) % mod;
}
ll q_pow(ll a, ll p) {
    ll sum = 1;
    while(p) {
        if(p & 1) {
            sum = (sum * a) % mod;
        }
        a = (a * a) % mod;
        p >>= 1;
    }
    return sum;
}
struct node {
    int u , v , w;
}edge[20005];
ll tot , ans;
int main()
{
    read (T);
    while (T --)
    {
        tot = ans = 0;
        read(n, m);
        mem(g,0) , mem(G,0);
        for (int u, v, w, i = 1; i <= m; i++) {
            read(u, v, w);
            for (int i = 0; (1ll << i) <= w; i++)
                if (w & (1ll << i)) G[u][v][i] = ++G[v][u][i];
            g[u][v] = --g[v][u];
            ++g[u][u], ++g[v][v];
        }
        tot = Gauss();
        ll inv = q_pow(tot,mod-2);
        for (int k = 0; (1ll << k) <= 1e9; k++) {
            mem(g, 0);
            for (int i = 1; i <= n; i++)
                for (int j = 1; j <= n; j++)
                    if (G[i][j][k]) g[i][j] = -G[i][j][k], g[i][i] += G[i][j][k];
            ans = (ans + (1ll << k) * Gauss() % mod * inv % mod) % mod;
        }
        write(ans), LF;
    }
}
/*
2
6 5
0 1 0 1 0 1
1 3
3 5
1 2
2 4
4 5
 */