LightOJ1003---Drunk(拓扑排序判环)

One of my friends is always drunk. So, sometimes I get a bit confused whether he is drunk or not. So, one day I was talking to him, about his drinks! He began to describe his way of drinking. So, let me share his ideas a bit. I am expressing in my words.

There are many kinds of drinks, which he used to take. But there are some rules; there are some drinks that have some pre requisites. Suppose if you want to take wine, you should have taken soda, water before it. That’s why to get real drunk is not that easy.

Now given the name of some drinks! And the prerequisites of the drinks, you have to say that whether it’s possible to get drunk or not. To get drunk, a person should take all the drinks.
Input

Input starts with an integer T (≤ 50), denoting the number of test cases.

Each case starts with an integer m (1 ≤ m ≤ 10000). Each of the next m lines will contain two names each in the format a b, denoting that you must have a before having b. The names will contain at most 10 characters with no blanks.
Output

For each case, print the case number and ‘Yes’ or ‘No’, depending on whether it’s possible to get drunk or not.
Sample Input

Output for Sample Input

2

2

soda wine

water wine

3

soda wine

water wine

wine water

Case 1: Yes

Case 2: No

Problem Setter: Jane Alam Jan

拓扑排序判环

/*************************************************************************
    > File Name: LightOJ1003.cpp
    > Author: ALex
    > Mail: zchao1995@gmail.com 
    > Created Time: 2015年06月03日 星期三 10时19分43秒
 ************************************************************************/

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <bitset>
#include <set>
#include <vector>

using namespace std;

const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double eps = 1e-15;
typedef long long LL;
typedef pair <int, int> PLL;

static const int N = 10100;
struct node {
    int nxt;
    int to;
}edge[N + 10];
int head[N], tot;

void addedge(int from, int to) {
    edge[tot].to = to;
    edge[tot].nxt = head[from];
    head[from] = tot++;
}
map <string, int> mp;
char A[20], B[20];
int in_deg[N];

void toposort(int n) {
    queue <int> qu;
    int rest = n;
    for (int i = 1; i <= n; ++i) {
        if (!in_deg[i]) {
            qu.push(i);
        }
    }
    while (!qu.empty()) {
        int u = qu.front();
        qu.pop();
        --rest;
        for (int i = head[u]; ~i; i = edge[i].nxt) {
            int v = edge[i].to;
            --in_deg[v];
            if (!in_deg[v]) {
                qu.push(v);
            }
        }
    }
    if (rest) {
        printf("No\n");
    }
    else {
        printf("Yes\n");
    }
}

int main() {
    int t, icase = 1;
    scanf("%d", &t);
    while (t--) {
        mp.clear();
        int m;
        scanf("%d", &m);
        memset(head, -1, sizeof(head));
        tot = 0;
        int n = 0;
        memset(in_deg, 0, sizeof(in_deg));
        for (int i = 1; i <= m; ++i) {
            scanf("%s%s", A, B);
            if (mp.find(A) == mp.end()) {
                mp[A] = ++n;
            }
            if (mp.find(B) == mp.end()) {
                mp[B] = ++n;
            }
            ++in_deg[mp[B]];
            addedge(mp[A], mp[B]);
         }
        printf("Case %d: ", icase++);
        toposort(n);
    }
    return 0;
}

转载于:https://www.cnblogs.com/mfmdaoyou/p/6956716.html