POJ 1094 Sorting It All Out

Sorting It All Out

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 32802		Accepted: 11395

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.

并查集的简单应用，题目不难，就是有点麻烦。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>

using namespace std;

int n,m;
int in[66];
int cun[66];
int mp[66][66];
int ans;
int xx[66];

int st()
{
    queue<int>Q;
    int flag=0;
    for(int i=0;i<n;i++) if(!in[i]) Q.push(i);
    int ans=0;
    while(!Q.empty())
    {
        if(Q.size()>1) flag=1;
        int yy=Q.front();
        Q.pop();
        xx[ans++]=yy;
        for(int i=0;i<n;i++)
        {
            if(mp[yy][i])
            {
                in[i]--;
                if(!in[i]) Q.push(i);
            }
        }
    }
    if(ans<n) return 1;
    else if(flag) return 0;
    return 2;
}

int main()
{
    while(~scanf("%d%d%*c",&n,&m))
    {
        if(n==0&&m==0) break;
        memset(in,0,sizeof(in));
        memset(mp,0,sizeof(mp));
        int stop,flag=0,zhuangtai=0;
        for(int i=1;i<=m;i++)
        {
            char a,b,c;
            scanf("%c%c%c%*c",&a,&b,&c);
            if(flag) continue;
            int A=a-'A',C=c-'A';
            if(b=='<')
            {
                if(!mp[C][A])
                {
                    mp[C][A]=1;
                    in[A]++;
                }
            }
            if(b=='>')
            {
                if(!mp[A][C])
                {
                    mp[A][C]=1;
                    in[C]++;
                }
            }
           memcpy(cun,in,sizeof(in));
           zhuangtai=st();
            memcpy(in,cun,sizeof(cun));
            if(zhuangtai)
            {
                stop=i;
                flag=1;
            }
        }
        if(zhuangtai==0) cout<<"Sorted sequence cannot be determined."<<endl;
        else if(zhuangtai==1) printf("Inconsistency found after %d relations.\n",stop);
        else if(zhuangtai==2)
        {
            printf("Sorted sequence determined after %d relations: ",stop);
            for(int i=n-1;i>=0;i--) printf("%c",xx[i]+'A');
            cout<<".";
            cout<<endl;
        }
    }
    return 0;
}