POJ - 1094 (拓扑排序)

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 output

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 input

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

题意

n 物品，m 组关系，让你从小到大排序，有三种情况，
1.关系混乱
2.可以从小到大排
3.顺序不确定
要注意，不要发现顺序不确定，就结束，还要判断是否存在关系混乱。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n,m,e[30][30];
int f1[30],f2[30],mp[30];
int topu()
{
    int i,j,t=0;
    for(i=0; i<n; i++)
        f2[i]=f1[i];
    for(i=0; i<n; i++)
    {
        int fg=0,u=0;
        for(j=0; j<n; j++)
        {
            if(f2[j]==0)
            {
                fg++;
                u=j;
            }
        }
        if(fg==0) return 2;
        if(fg>1) t=1;
        mp[i]=u;
        f2[u]=-1;
        for(j=0; j<n; j++)
        {
            if(e[u][j])
                f2[j]--;
        }
    }
    if(t==1) return 3;
    return 1;
}
int main()
{
    char c[5];
    while(~scanf("%d%d",&n,&m)&&(n || m))
    {
        int i,j,t1,t2,fg=0;
        memset(e,0,sizeof(e));
        memset(f1,0,sizeof(f1));
        for(i=1; i<=m; i++)
        {
            scanf("%s",c);
            if(fg) continue;
            t1=c[0]-'A';
            t2=c[2]-'A';
            if(e[t1][t2]==0)
            {
                e[t1][t2]=1;
                f1[t2]++;
                int h=topu();
                if(h==1)
                {
                    fg=1;
                    printf("Sorted sequence determined after %d relations: ",i);
                    for(j=0; j<n; j++)
                        printf("%c",mp[j]+'A');
                    printf(".\n");
                }
                else if(h==2)
                {
                    fg=1;
                    printf("Inconsistency found after %d relations.\n",i);
                }
            }
        }
        if(fg==0) printf("Sorted sequence cannot be determined.\n");
    }
    return 0;
}