HDU 2094 产生冠军 （水拓扑）

HDU - 2094

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 1000000007
#define inf 0x3f3f3f3f
using namespace std;
int ind[1005];
int n;
int cnt;
void topo()
{
    int cnt1 = 0;
    for(int i = 1; i <= cnt; i ++)
    {
        if(! ind[i])
            cnt1 ++;
    }
    if(cnt1 == 1) printf("Yes\n");
    else printf("No\n");
}
int main()
{
    while(scanf("%d", &n) != EOF && n)
    {
        memset(ind, 0, sizeof(ind));
        map<string, int> m;
        string s1, s2;
        cnt = 0;
        for(int i = 1; i <= n; i ++)
        {
            cin>>s1>>s2;
            if(! m[s1]) m[s1] = ++ cnt;
            if(! m[s2]) m[s2] = ++ cnt;
            ind[m[s2]] ++;
        }
        topo();
    }
    return 0;
}