POJ-1094 Sorting It All Out 解题报告

原创 2012年03月24日 01:03:05

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.



       题目链接:http://poj.org/problem?id=1094
       解法类型:拓扑排序
       解题思路:这几天看了下拓扑排序,于是就在POJ上找了一道题目练练手,一道很典型的拓扑排序题。建立一个邻接矩阵,然后深度搜索入度数为零的结点即可。但要做一些简单的剪枝,搜索到2个或者有回路就可以退出搜索了,这里一定要注意回溯!(我在这里被坑了= =!)。为了提高判断结点的入度数是否为零的效率,这里可以使用位运算,为了减小位运算的出错,最好写成宏定义。
       算法实现:
//STATUS:C++_AC_16MS_136K
#include<stdio.h>
#include<string.h>
#define get(u,v) (G[u]&(1<<v))     //位运算处理
#define put(u,v) (G[u]|=(1<<v))
const int MAXN=30;
char A[MAXN];
int topo_dfs(int cur);
int is_zero(int v);
int s,n,m,G[MAXN],map[MAXN],tot;
int main()
{
//	freopen("in.txt","r",stdin);
	int i,u,v,ok,result,w;
	char a,b,ch[5];
	while(~scanf("%d%d",&n,&m) && n)
	{
		tot=result=0;         //初始化
		memset(G,0,sizeof(G));
		memset(map,0,sizeof(map));
		getchar();

		for(i=0;i<m;i++){
			scanf("%c<%c\n",&a,&b);
			u=a-'A',v=b-'A';
			if(!get(u,v))put(u,v);       //位运算
			if(!map[u])map[u]=1,tot++;
			if(!map[v])map[v]=1,tot++;
			s=0;
			ok=topo_dfs(0);
			if(ok==-1){result=1;w=i+1;break;}
			else if(s==1){A[n]='\0';result=2;w=i+1;break;}
		}
		for(i++;i<m;i++)
			gets(ch);

		if(result==1)printf("Inconsistency found after %d relations.\n",w);    //按情况输出
		else if(result==2)printf("Sorted sequence determined after %d relations: %s.\n",w,A);
		else printf("Sorted sequence cannot be determined.\n");
	}
	return 0;
}

int topo_dfs(int cur)
{
	if(cur==n){s++;return 1;}
	if(s==2)return 2;    //有多个
	else if(cur==tot)return 3; //搜索完成
	int v,ok,t,ans;
	for(ok=0,v=0;v<n;v++){
		if( is_zero(v) && map[v] ){
			ok=1;
			t=G[v];      //位运算很方便的解决了赋值问题
			G[v]=0;
			map[v]=0;
			A[cur]=v+'A';
			ans=topo_dfs(cur+1);
			if(ans==-1)return -1;   //存在回路
			if(ans==2){G[v]=t;map[v]=1;return 2;}   //这里一定要注意剪枝和回溯
			if(ans==3){G[v]=t;map[v]=1;return 3;}   //这里一定要注意剪枝和回溯
			G[v]=t;
			map[v]=1;
		}
	}
	if(ok)return 0;
	else return -1;    //存在回路
}

int is_zero(int v)      //结点入度数是否为零
{
	for(int i=0;i<n;i++)
		if(get(i,v))return 0;
	return 1;
}

相关文章推荐

poj1094Sorting It All Out(拓朴排序)

Sorting It All Out Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 32797   Accept...

poj1094Sorting It All Out(拓朴排序)

Sorting It All Out Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3279...

poj 1094 Sorting It All Out(拓扑排序)

链接: http://poj.org/problem?id=1094 题目: Sorting It All Out Time Limit: 1000MS ...

poj1094 Sorting It All Out

一道有点猥琐的拓扑题,之前对于输出样例的数字有点不太理解,后来明白是推到给定的第几组输入可以唯一确定一个拓扑的结果(唯一、没有、还是有回路),那么就需要我们输入一条边处理一条边,每对一次输入拓扑之后要...

nyoj 349 Sorting It All Out(拓扑排序度的理解)

Sorting It All Out 时间限制:3000 ms  |  内存限制:65535 KB 难度:3 描述 An ascending sorted sequence...
  • ling_du
  • ling_du
  • 2015年09月19日 19:18
  • 485

POJ - 1094 Sorting It All Out解题报告

Kahn····

POJ 1094 Sorting It All Out (拓扑排序) -- 解题报告

题目翻译描述一个升序序列中不同元素之间可以用带小于号的关系式来从小到大排列元素。例如,有序序列 A, B, C, D 中包含关系 A输入输入包含多组实例。每组实例的第一行包含两个正整数 n, m,前者...

拓扑排序 附POJ 1094 Sorting It All Out 解题报告

拓扑排序是针对有向无环图的概念,通常是用于将一些点进行拓扑排序之后形成一个序列能够形成先后的关系,所以拓扑排序可以用于解决点之间又先后关系的序列。         POJ1094这道题是说给你一些大...

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

Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions:...

poj-1094 Sorting It All Out[拓扑排序]

感觉需要注意的细节有点多。 (1)先判断是否有环  用used表示能拓扑的点 vis表示能搜索到的点 假如两者总数不等说明有环。 (2)再判断拓扑序是否唯一 假如一次寻找0入度节点有多个即不唯...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ-1094 Sorting It All Out 解题报告
举报原因:
原因补充:

(最多只允许输入30个字)