AcWing 343. 排序 题解（floyd性质实现传递闭包）

AcWing 343. 排序
利用floyd三重循环实现闭包传递，学到了，利用最短路性质实现别的功能

#include<bits/stdc++.h>

using namespace std;

const int N = 26;

bool d[N][N], g[N][N], st[N];
int n, m;

void floyd(){
	memcpy(d, g, sizeof g);
	for(int k = 0; k < n; k ++ ){
		for(int i = 0; i < n; i ++ ){
			for(int j = 0; j < n; j ++ ){
				d[i][j] |= d[i][k] && d[k][j];
			}
		}
	}
}

int check(){
	for(int i = 0; i < n; i ++ ){
		if(d[i][i]) return 2;  //矛盾 
	} 
	//关系不能确定  
	for(int i = 0; i < n; i ++ ){
		for(int j = 0; j < i; j ++ ){
			if(!d[j][i] && !d[i][j]) return 0;  //在前面的字母不一定小，所以正反都要判断
		}
	}
	
	return 1;
}

char get_min(){
	for(int i = 0; i < n; i ++ ){
		if(!st[i]){
			bool flag = true;
			for(int j = 0; j < n; j ++ ){
				if(!st[j] && d[j][i]){
					flag = false;
					break;
				}	
			}
			//要遍历完所有字母之后进行输出 
			if(flag){
				st[i] = true; 
				return i + 'A';
			}			
		}
	}
}

int main()
{
	while(cin>>n>>m, m || n){
		memset(g, 0, sizeof g);
		int type = 0, t; 
		for(int i = 1; i <= m; i ++ ){
			char str[5];
			cin>>str;
			int a = str[0] - 'A', b = str[2] - 'A';  //字符转化成数字 
			if(!type){
				g[a][b] = 1;
				floyd();  //添加新关系
				type = check();
				if(type) t = i;
			}
		}
		if(!type) cout<<"Sorted sequence cannot be determined."<<endl;
		else if(type == 2) cout<<"Inconsistency found after "<<t<<" relations."<<endl;
		else{
			cout<<"Sorted sequence determined after "<<t<<" relations: ";
			memset(st, 0, sizeof st);
			for(int i = 0; i < n; i ++ ){
				cout<<get_min();
			}
			cout<<"."<<endl;
		}
	}
	return 0;
}