백준 9375번: 패션왕 신해빈 / C++

 
#include <iostream>
#include <map>
using namespace std;
 
int main()
{
    int TestCase =0;
    cin >> TestCase;
    for(int i=0; i<TestCase; ++i)
    {
        int Clothes =0;
        cin >>Clothes;
        
        if(Clothes == 0)
        {
            cout << 0 << '\n';
            continue;
        }
        
        map<string,int> Closet;
        for(int j=0; j<Clothes; ++j)
        {
            string name{};
            string ClothesType{};
            cin >> name >>ClothesType;
            
            if(Closet.find(ClothesType) == Closet.end())
            {
                Closet.insert(pair<string,int>(ClothesType,1));
            }
            else
            {
                ++Closet.find(ClothesType)->second;
            }
        }
 
        int Result = 1;
        for(auto iter = Closet.begin(); iter!=Closet.end(); ++iter)
            {
                Result *= iter->second+1;
            }
            
        cout << Result-1 << '\n';
    }
    return 0;
}