Colorful

 

思路：枚举取的颜色种类，判断是否合法，枚举颜色种数间再枚举该颜色的边。

反思：颜色种数小没想到直接二进制枚举~

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=3e5+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}

int num[maxn];
bool vis[maxn];
int fa[109][19];
int ans=0;
int cnt=0;
int n,m,s;
int p[maxn];

struct node
{
    int u,v,c;

};

vector <node>e[109];

int col_Find(int x,int col)
{
    return fa[x][col]==x?x:fa[x][col]=col_Find(fa[x][col],col);
}

int Find(int x)
{
    return x==p[x]?x:p[x]=Find(p[x]);
}
void join(int u,int v)
{
    int ju=Find(u);
    int jv=Find(v);
    if(ju!=jv)
    {
        p[jv]=ju;
    }
}
bool same(int u,int v)
{
    return Find(u)==Find(v);
}
int chbits(int x)//颜色种数
{
    int ans=0;
    while(x)
    {
        if(x&1) ans++;
        x>>=1;
    }
    return ans;
}
bool ch(int col)
{
    for(int i=0;i<=n;i++) p[i]=i;
    int num=0;
    for(int i=0;i<s;i++)
    {
        if((col>>i)&1)
        {
            for(int j=0;j<e[i].size();j++)
            {
                if(!same(e[i][j].u,e[i][j].v))
                {
                    join(e[i][j].u,e[i][j].v);
                    num++;
                    if(num==n-1) return 1;//n-1条边即可
                }
            }
        }
    }
    return 0;
}

int main()
{
    //FAST_IO;
    int t;
    cin>>t;
    while(t--)
    {
        cnt=0;
        for(int i=0;i<109;i++)
        {
            for(int j=0;j<109;j++) fa[i][j]=i;
        }
        for(int i=0;i<109;i++) e[i].clear();
        cin>>n>>m>>s;
        ans=INF;
        for(int i=0;i<m;i++)
        {
            int u,v,c;
            cin>>u>>v>>c;
            c--;
            int x=col_Find(u,c);
            int y=col_Find(v,c);
            if(x==y) continue;//重边

            fa[v][c]=u;
            e[c].pb({u,v,c});
        }
        for(int i=0;i<(1<<s);i++)
        {
            if(ch(i))
            {
                ans=min(ans,chbits(i));
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}