Sicily 14184. Incognito

14184. Incognito

Constraints

Time Limit: 1 secs, Memory Limit: 256 MB

Description

Spies use attributes to disguise themselves to make sure that they are not recognized. For example, when putting on sunglasses, a spy suddenly looks completely different and cannot be recognized anymore. Every combination of attributes gives a different appearance, but not all combinations are possible. For example, a hat and a turban are both headgear and cannot be used at the same time. Given the list of available attributes, compute how many distinct disguises can be made.

Input

On the first line one positive number: the number of test cases, at most 100. After that per test case:

• one line with an integer n (0 ≤ n ≤ 30): the number of available attributes. 
• n lines with two space-separated strings: the name and the category of the attribute. All strings consist of at least 1 and at most 20 lowercase letters. Within a test case all names are distinct.

Output

Per test case:

• one line with an integer: the number of possible distinct disguises that can be made with the given attributes, such that at most one attribute from each category is used.

Sample Input

23hat headgearsunglasses eyewearturban headgear3mask facesunglasses facemakeup face

Sample Output

53

Problem Source

2015年每周一赛第七场

#include <iostream>#include <map>#include <string>using namespace std;int n;int ans;map<string, int> m;int main() {int caseNum;cin >> caseNum;while (caseNum--) {cin >> n;for (int i = 0; i < n; i++) {string s;cin >> s >> s;if (m.find(s) == m.end()) m[s] = 1;else m[s]++;}ans = 1;for (map<string, int>::iterator iter = m.begin(); iter != m.end(); iter++) {ans *= iter->second + 1;}cout << ans - 1 << endl;m.clear();}return 0;}