hdu 6370 多校第6场 Werewolf （dfs)

Werewolf

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 940    Accepted Submission(s): 254

Problem Description

"The Werewolves" is a popular card game among young people.In the basic game, there are 2 different groups: the werewolves and the villagers.

Each player will debate a player they think is a werewolf or not. 

Their words are like "Player x is a werewolf." or "Player x is a villager.".

What we know is :

1. Villager won't lie.

2. Werewolf may lie. 

Of cause we only consider those situations which obey the two rules above. 

It is guaranteed that input data exist at least one situation which obey the two rules above.

Now we can judge every player into 3 types :

1. A player which can only be villager among all situations, 

2. A player which can only be werewolf among all situations.

3. A player which can be villager among some situations, while can be werewolf in others situations.

You just need to print out the number of type-1 players and the number of type-2 players. 

No player will talk about himself.

Input

The first line of the input gives the number of test cases T.Then T test cases follow.

The first line of each test case contains an integer N,indicating the number of players.

Then follows N lines,i-th line contains an integer x and a string S,indicating the i-th players tell you,"Player x is a S."

limits:

1≤T≤10

1≤N≤100,000

1≤x≤N

S∈ {"villager"."werewolf"}

Output

For each test case,print the number of type-1 players and the number of type-2 players in one line, separated by white space.

Sample Input

1 2 2 werewolf 1 werewolf

Sample Output

0 0

Source

2018 Multi-University Training Contest 6

Recommend

chendu

狼人边不管 直接反向建立所有村民边， 根就是说(假定为a)为狼人的点，然后从根开始dfs 过程中在a后面的点就都是狼人（包括a）因为如果a后面为村民 那么根也为村民 但根说a为狼人，所以矛盾，故a后面全为狼人。注意 如果a不在当前树上 不用统计，之前错误的写法 

下面为正确写法 

 

#pragma GCC optimize(2)
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf  0x7fffffff
#define linf 0x7fffffffffffffff
#define mem(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define debug printf("!!\n");
#define N 200005
#define M 4000009
#define pi acos(-1)
#define eps 1e-2
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);// freopen("in.txt","r",stdin);
using namespace std;
typedef unsigned long long  ll;
typedef long long  LL;
typedef double db;
const int mod=998244353;
int son[N];
int ans=0;
struct edge
{
    int d,next,flag;
}e[N];
int h[N],with=1;
void dfs(int x,int st,int f)
{
    if(x==st) f=1;
    if(f) ans++;

    for(int i=h[x];i!=-1;i=e[i].next)
    {
        int tp=e[i].d;
        if(e[i].flag==1) dfs(tp,st,f);
    }
}
void add(int x,int y,int z)
{
    e[with].flag=z;
    e[with].d=y;
    e[with].next=h[x];
    h[x]=with++;
}
int main()
{
 //   freopen("in","r",stdin);
    int t;
    sd(t);
    while(t--)
    {
        with=1;
        mem(h,-1);
        mem(e,-1);
        int n;
        sd(n);
        fup(i,1,n)
        {
            int s;
            char c[25];
            sd(s);
            sc(c);
            if (c[0]=='w') son[i]=-s;
            else add(s,i,1),son[i]=s;
        }
        ans=0;
        fup(i,1,n)
        {
            if(son[i]<0) dfs(i,-son[i],0);
        }
        printf("0 %d\n",ans);
    }
    return 0;
}