朋友 HDU - 5963

https://cn.vjudge.net/problem/HDU-5963

先一条链分析，发现胜负只与根连的边有关（0负，1胜） ；扩展到多条边连根；

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

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

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

map<pair<int,int>,bool >mp;
int sum[maxn];
int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);
    //freopen("powers.in","r",stdin);

    int T;
    cin>>T;
    while(T--)
    {
        mp.clear();
        int n,m;
        cin>>n>>m;
        for(int i=1;i<=n;i++) sum[i]=0;
        for(int i=1;i<=n-1;i++)
        {
            int u,v,z;
            cin>>u>>v>>z;
            if(z)
            {
                sum[u]++;
                sum[v]++;
                if(u>v) swap(u,v);
                mp[{u,v}]=1;
            }
        }

        while(m--)
        {
            int op;
            cin>>op;
            if(op)
            {
                int u,v,z;
                cin>>u>>v>>z;
                if(u>v) swap(u,v);

                if(z)
                {
                    if(mp[{u,v}]==1) continue;
                    sum[u]++;
                    sum[v]++;
                    mp[{u,v}]=1;
                }
                else
                {
                    if(mp[{u,v}]==0) continue;
                    sum[u]--;
                    sum[v]--;
                    mp[{u,v}]=0;
                }
            }
            else
            {
                int x;
                cin>>x;
                if(sum[x]%2) puts("Girls win!");
                else puts("Boys win!");
            }
        }
    }


    return 0;
}