Sorting It All Out
Time Limit: 2 Seconds Memory Limit: 65536 KB
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 <stdio.h>
int n, m;
int map[27][27];
char temp[27];
int isok();
int iscircle();
int main()
{
int i, j, f, f1, f2, f0;
int count_1, count_2, count_0;
char str[5], result[27];
while(scanf("%d%d", &n, &m)) {
if(n == 0 && m == 0) {
break;
}
getchar();
for(i = 0; i < n; i++) {
for(j = 0; j < n; j++) {
map[i][j] = 0;
}
}
f0 = f1 = f2 = 0;
for(i = 0; i < m; i++) {
gets(str);
map[str[2]-'A'][str[0]-'A'] = 1;
f = isok();
if(!f1 && f == 1) {
f1 = 1;
count_1 = i+1;
for(j = 0; j < n; j++) {
result[j] = temp[j];
}
}
if(f == 0) {
f0 = 1;
}
if(!f2 && iscircle()) {
f2 = 1;
count_2 = i+1;
}
}
if(f2 && f1) {
if(count_1 < count_2) {
printf("Sorted sequence determined after %d relations: ", count_1);
for(i = n-1; i >= 0; i--) {
printf("%c", result[i]);
}
printf(".\n");
} else {
printf("Inconsistency found after %d relations.\n", count_2);
}
}
else if(f1) {
printf("Sorted sequence determined after %d relations: ", count_1);
for(i = n-1; i >= 0; i--) {
printf("%c", result[i]);
}
printf(".\n");
}
else if(f2) {
printf("Inconsistency found after %d relations.\n", count_2);
}
else if(!f1 && !f2 && f0) {
printf("Sorted sequence cannot be determined.\n");
}
}
return 0;
}
int isok()
{
int i, j, into[27], t, f;
for(i = 0; i < n; i++) {
into[i] = 0;
for(j = 0; j < n; j++) {
into[i] += map[j][i];
}
}
t = 0;
while(t < n) {
f = 0;
for(i = 0; i < n; i++) {
if(into[i] == 0) {
f++;
j = i;
}
}
if(f > 1) {
return 0;
}
temp[t++] = j+'A';
into[j] = -1;
for(i = 0; i < n; i++) {
if(map[j][i]) {
into[i]--;
}
}
}
return 1;
}
int iscircle()
{
int i, j, into[27], t, f;
for(i = 0; i < n; i++) {
into[i] = 0;
for(j = 0; j < n; j++) {
into[i] += map[j][i];
}
}
t = 0;
while(t < n) {
f = 0;
for(i = 0; i < n; i++) {
if(into[i] == 0) {
into[i] = -1;
t++;
f = 1;
for(j = 0; j < n; j++) {
if(map[i][j]) {
into[j]--;
}
}
}
}
if(!f) {
return 1;
}
}
return 0;
}