POJ1094~Sorting It All Out（拓扑排序）

Sorting It All Out

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 35010		Accepted: 12276

Description

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.

Source

East Central North America 2001

基础拓扑排序，给出条件，判断是否能够给出拓扑排序后的序列

此处一共分为三种情况：

（1）关系矛盾，即存在环

（2）关系不确定，排序得到的元素个数小于给定元素个数

（3）可以给出拓扑排序

#include<stdio.h>
#include<string.h>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int N = 29;
int e[N][N],indegree[N],tot,q[N];
int topsort(int n)
{
    int temp[N],x,flag=1,c=0;
    memcpy(temp,indegree,n*4+4);
    for(int i=1;i<=n;i++)
    {
        int m=0;
        for(int j=1;j<=n;j++)
        {
            if(!temp[j])
            {
                m++;
                x=j;
            }
        }
        if(!m)return 0;
        if(m>1)flag=-1;
        q[c++]=x;
       temp[x]=-1;
        for(int j=1;j<=n;j++)
        {
            if(e[x][j]==1)
                temp[j]--;
        }
    }
    return flag;
}
int main()
{
    int n,m,flag;
    char str[5];
    while(~scanf("%d%d",&n,&m)&&n+m)
    {
        flag=0;
        mem(e,0);
        mem(indegree,0);
        for(int i=1;i<=m;i++)
        {
         scanf("%s",str);
         if(flag)continue;
         int u=str[0]-'A'+1;
         int v=str[2]-'A'+1;
         e[u][v]=1;
         indegree[v]++;
         int s=topsort(n);
         if(!s)
         {
             printf("Inconsistency found after %d relations.\n",i);
             flag=1;
         }
          if(s==1)
         {
             printf("Sorted sequence determined after %d relations: ",i);
             for(int j=0;j<n;j++)
                printf("%c",q[j]+'A'-1);
                printf(".\n");
             flag=1;
         }
        }
        if(!flag)

            printf("Sorted sequence cannot be determined.\n");

    }
}