HDU 2094 产生冠军



http://acm.hdu.edu.cn/showproblem.php?pid=2094

如果冠军产生代表入度为一的点有一个。

#include <map>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

int in[2020],cnt;

map <string, int> mp;
string s1,s2;

int main(){
//    freopen("in.txt", "r", stdin);
    int n;
    while(scanf("%d",&n) != EOF && n){
        cnt = 0;
        mp.clear();
        memset(in,0,sizeof(in));
        for(int i=0; i<n; i++){
            cin >> s1 >> s2;
            if(mp.find(s1) == mp.end()){
                mp[s1] = cnt;
                cnt++;
            }
            if(mp.find(s2) == mp.end()){
                mp[s2] = cnt;
                cnt++;
            }
            in[mp[s2]]++;
//            cout << mp[s1] << " " << mp[s2] << endl;
        }
        int tmp = 0;
        for(int i=0; i<cnt; i++){
//            cout << in[i] << " ";
            if(!in[i])  tmp++;
        }
        if(tmp == 1)    puts("Yes");
        else puts("No");
    }
    return 0;
}