CF1594D.The Number of Imposters
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Theofanis started playing the new online game called "Among them". However, he always plays with Cypriot players, and they all have the same name: "Andreas" (the most common name in Cyprus).
In each game, Theofanis plays with n other players. Since they all have the same name, they are numbered from 1 to n .
The players write m comments in the chat. A comment has the structure of " i j c " where i and j are two distinct integers and c is a string ( 1≤i,j≤n ; i=j ; c is either imposter or crewmate). The comment means that player i said that player j has the role c .
An imposter always lies, and a crewmate always tells the truth.
Help Theofanis find the maximum possible number of imposters among all the other Cypriot players, or determine that the comments contradict each other (see the notes for further explanation).
Note that each player has exactly one role: either imposter or crewmate.
输入格式
The first line contains a single integer t ( 1≤t≤104 ) — the number of test cases. Description of each test case follows.
The first line of each test case contains two integers n and m ( 1≤n≤2⋅105 ; 0≤m≤5⋅105 ) — the number of players except Theofanis and the number of comments.
Each of the next m lines contains a comment made by the players of the structure " i j c " where i and j are two distinct integers and c is a string ( 1≤i,j≤n ; i=j ; c is either imposter or crewmate).
There can be multiple comments for the same pair of (i,j) .
It is guaranteed that the sum of all n does not exceed 2⋅105 and the sum of all m does not exceed 5⋅105 .
输出格式
For each test case, print one integer — the maximum possible number of imposters. If the comments contradict each other, print −1 .
输入输出样例
输入#1
5 3 2 1 2 imposter 2 3 crewmate 5 4 1 3 crewmate 2 5 crewmate 2 4 imposter 3 4 imposter 2 2 1 2 imposter 2 1 crewmate 3 5 1 2 imposter 1 2 imposter 3 2 crewmate 3 2 crewmate 1 3 imposter 5 0
输出#1
2 4 -1 2 5
说明/提示
In the first test case, imposters can be Andreas 2 and 3 .
In the second test case, imposters can be Andreas 1 , 2 , 3 and 5 .
In the third test case, comments contradict each other. This is because player 1 says that player 2 is an imposter, and player 2 says that player 1 is a crewmate. If player 1 is a crewmate, then he must be telling the truth, so player 2 must be an imposter. But if player 2 is an imposter then he must be lying, so player 1 can't be a crewmate. Contradiction.