POJ 1094 Sorting It All Out 【拓扑排序】

Sorting It All Out

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 38571		Accepted: 13588

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<cstdio>
#include<cstring>
#include<vector>
using namespace std;
int n, m;
int pre[30];
char ans[30];
int Pre[30];
vector <int> V[30];
int top(){
    int flag = 3;
    memcpy(Pre, pre, sizeof Pre);
    for(int i = 0; i < n; i++){
        int pos, cnt = 0;
        for(int j = 0; j < n; j++) if(Pre[j] == 0) cnt++, pos = j;
        if(cnt == 0) return 1;
        if(cnt > 1) flag = 2;
        Pre[pos] = -1;
        ans[i] = pos + 65;
        for(int j = 0; j < V[pos].size(); j++) Pre[V[pos][j]]--;
    }
    return flag;
}
int main(){
    while(scanf("%d%d", &n, &m) != EOF && n && m){
        int ed = 0, flag;
        int step;
        memset(ans, 0, sizeof ans);
        memset(pre, 0, sizeof pre);
        for(int i = 0; i < 30; i++)
            V[i].clear();
        for(int i = 1; i <= m; i++){
            char a[10];
            scanf("%s", a);
            if(ed) continue;
            pre[a[2] - 65]++;
            V[a[0] - 65].push_back(a[2] - 65);
            flag = top();
            if(flag == 1 || flag == 3) step = i, ed = 1;
        }
        if(flag == 1)
            printf("Inconsistency found after %d relations.\n", step);
        else if(flag == 2)
            printf("Sorted sequence cannot be determined.\n");
        else
            printf("Sorted sequence determined after %d relations: %s.\n", step, ans);
    }
    return 0;
}