HDU多校Round 6

Solved:2

rank:452

I. Werewolf

没有铁人 找铁狼 如果一个环中只有一条狼人边那个人就是铁狼

说铁狼是好人的人也是铁狼

#include <bits/stdc++.h>
using namespace std;

int tmp, ans, lang;
char s[];
struct node
{
    int to, nex, ty;
}E[];
int head[];
int col[];
int l[];
int r[];

void dfs(int x, int fa)
{
    col[x] = tmp;
    int c = head[x];
    for(int i = c; i; i = E[i].nex)
    {
        int v = E[i].to;
        if(v == fa) continue;
        if(col[v]) continue;
        dfs(v, x);
    }
}

void dfs1(int x, int fa)
{
    ans++;
    int c = head[x];
    for(int i = c; i; i = E[i].nex)
    {
        int v = E[i].to;
        if(v == fa) continue;
        if(E[i].ty) dfs1(v, x);
    }
}

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int cnt = ;
        lang = tmp = ans = ;
        int n; scanf("%d", &n);
        memset(head, , sizeof(int) * (n + ));
        memset(col, , sizeof(int) * (n + ));
        for(int i = ; i <= n; i++)
        {
            int x; scanf("%d%s", &x, s);
            if(s[] == 'v')
            {
                E[++cnt].to = x; E[cnt].nex = head[i]; E[cnt].ty = ; head[i] = cnt;
                E[++cnt].to = i; E[cnt].nex = head[x]; E[cnt].ty = ; head[x] = cnt;
            }
            else
            {
                lang++;
                l[lang] = i;
                r[lang] = x;
            }
        }

        for(int i = ; i <= n; i++)
        {
            if(col[i]) continue;
            tmp++;
            dfs(i, );
        }

        for(int i = ; i <= lang; i++)
            if(col[l[i]] == col[r[i]]) dfs1(r[i], );
        printf("0 %d\n", ans);
    }
    return ;
}