uva 10420 List of Conquests

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <map>
#include <set>
using namespace std;
int main()
{
int n,t=0;
char work1[100],work2[100];
map<string,int> adj;
map<string,int>::iterator it;
set<string> strset[2005];

scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",work1); gets(work2);
if(adj.find(work1)==adj.end()) adj.insert(pair<string,int>(work1,++t));
strset[adj[work1]].insert(work2);
}
for(it=adj.begin();it!=adj.end();it++)
{
printf("%s %d\n",(it->first).c_str(),strset[it->second].size());
}
return 0;
}