POJ 1094 Sorting It All Out(拓扑排序·判断+实现)
2015-08-19 14:59
225 查看
题意 由一些不同元素组成的升序序列是可以用若干个小于号将所有的元素按从小到大的顺序 排列起来的序列。例如,排序后的序列为 A, B, C, D,这意味着 A < B、B < C和C < D。在本题中, 给定一组形如 A < B的关系式,你的任务是判定是否存在一个有序序列。 输出到哪一项可以确定顺序或者在这一项最先出现冲突,若所有的小于关系都处理完了都不能确定顺序也没有出现冲突,就输出不能确定
每来一个小于关系就进行一次拓扑排序 直到出现冲突(也就是出现了环)或者已经能确定顺序 当结果已经确定时 后面的小于关系也就没有必要处理了 因此可以用一个flag标记结果是否已经确定
Sorting It All Out
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
Sample Output
每来一个小于关系就进行一次拓扑排序 直到出现冲突(也就是出现了环)或者已经能确定顺序 当结果已经确定时 后面的小于关系也就没有必要处理了 因此可以用一个flag标记结果是否已经确定
#include <cstdio> #include <cstring> #include <vector> using namespace std; const int N = 30; int n, m, in ; char ans , q ; vector<int> e ; int topoSort() //拓扑排序 { int d , ret = 1; memcpy(d, in, sizeof(d)); int front = 0, rear = 0, p = 0; for(int i = 0; i < n; ++i) if(d[i] == 0) q[rear++] = i; while(front < rear) { if(rear - front > 1) ret = 0; //顺序不能确定 int cur = q[front++]; ans[p++] = 'A' + cur; for(int i = 0; i < e[cur].size(); ++i) { int j = e[cur][i]; if((--d[j]) == 0) q[rear++] = j; } } if(p < n) return -1; //有环 ans[p] = 0; return ret; } int main() { char a, b; while(scanf("%d%d", &n, &m), n || m) { for(int i = 0; i < n; ++i) e[i].clear(); memset(in, 0, sizeof(in)); int flag = 0; for(int i = 0; i < m; ++i) { scanf(" %c<%c", &a, &b); if(flag) continue; a -= 'A', b -= 'A'; e[a].push_back(b); ++in[b]; flag = topoSort(); if(flag == 1) printf("Sorted sequence determined after %d relations: %s.\n", i + 1, ans); if(flag == -1) printf("Inconsistency found after %d relations.\n", i + 1); } if(!flag) puts("Sorted sequence cannot be determined."); } return 0; } //Last modified : 2015-08-19 13:45 CST
Sorting It All Out
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.
相关文章推荐
- 数据结构 C语言实现选择排序
- 远程执行命令的psexec工具的基本使用——简单、强大
- 【POJ 1850】 Code
- (leetcode)Ugly Number
- Linux Tomcat 6.0安装配置实践总结
- viewpager获取当前view报空指针的解决方法
- matlab_无约束的非线性优化
- Android 不归路之广播BoradCast篇
- HDU 5400 Arithmetic Sequence(左d1等差右d2等差的区间个数)(枚举位置,求最大区间,算区间个数)
- LinearLayout、RelativeLayout、FrameLayout居中显示整理
- 为什么匿名内部类和局部内部类只能访问final变量
- Eclipse快捷键大全
- 我所认知的软件开发
- js中的json语法
- 利用grunt+browserify预编译js模板文件,支持commonJS加载
- JS提交对象数组到服务端的方法总结(C#实例)
- hdu4810 Wall Painting
- curl多批次抓取,
- eclipse 与 android studio 一些常用的对应快捷键
- 机器学习笔记之AdaBoost算法