Sorting It All Out（拓扑排序）

An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A < B, B < C and C < D. in this problem, we will give you a set of relations of the form A < B and ask you to determine whether a sorted order has been specified or not.

Input

Input consists of multiple problem instances. Each instance starts with a line containing two positive integers n and m. the first value indicated the number of objects to sort, where 2 <= n <= 26. The objects to be sorted will be the first n characters of the uppercase alphabet. The second value m indicates the number of relations of the form A < B which will be given in this problem instance. Next will be m lines, each containing one such relation consisting of three characters: an uppercase letter, the character “<” and a second uppercase letter. No letter will be outside the range of the first n letters of the alphabet. Values of n = m = 0 indicate end of input.

Output

For each problem instance, output consists of one line. This line should be one of the following three:

Sorted sequence determined after xxx relations: yyy…y.
Sorted sequence cannot be determined.
Inconsistency found after xxx relations.

where xxx is the number of relations processed at the time either a sorted sequence is determined or an inconsistency is found, whichever comes first, and yyy…y is the sorted, ascending sequence.

Sample Input

4 6
A<B
A<C
B<C
C<D
B<D
A<B
3 2
A<B
B<A
26 1
A<Z
0 0

Sample Output

Sorted sequence determined after 4 relations: ABCD.
Inconsistency found after 2 relations.
Sorted sequence cannot be determined.

思路
对每一次操作，对该次操作进行一次拓扑排序，若此时存在多个入度为0的点，则可认为其为闭环，若只有一个入度为0的点，则此时该队列已成立，输出答案，以上两种情况成立时，结束操作，继续输入，若输入结束后操作未结束，则该队列无法成立

代码实现

#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int N=30;

int n,m;
queue<int>que;
int mp[N][N],temp[N];
char s[N];
int ideg[N];
bool finsh;

void judge(int x)
{
    int pos=0;
    bool flag=true;
    while(!que.empty()) que.pop();
    for(int i=0;i<n;i++) temp[i]=ideg[i];
    for(int i=0;i<n;i++)
    {
        int cnt=0;
        for(int j=0;j<n;j++)
        {
            if(!temp[j])
            {
                cnt++;
                pos=j;
            }
        }
        if(!cnt)
        {
            finsh=true;
            printf("Inconsistency found after %d relations.\n",x);
            return ;
        }
        else
        {
            if(cnt>1) flag=false;
            for(int j=0;j<n;j++) if(mp[pos][j]) temp[j]--;
            temp[pos]--;
            que.push(pos);
        }
    }
    if(flag)
    {
        printf("Sorted sequence determined after %d relations: ",x);
        while(!que.empty())
        {
            printf("%c",que.front()+'A');
            que.pop();
        }
        puts(".");
        finsh=true;
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        if(!n&&!m) break;
        memset(ideg,0,sizeof(ideg));
        memset(mp,0,sizeof(mp));
        finsh=false;
        for(int i=1;i<=m;i++)
        {
            scanf("%s",s);
            if(finsh) continue;
            int u=s[0]-'A',v=s[2]-'A';
            mp[u][v]=1;
            ideg[v]++;
            judge(i);
        }
        if(!finsh) puts("Sorted sequence cannot be determined.");
    }
    return 0;
}