luogu P1347 排序——拓扑排序

题目链接

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
const int maxn=105;
int head[maxn],to[2*maxn],nex[2*maxn],cnt=0;
void add(int u,int v)
{
	nex[++cnt]=head[u];
	to[cnt]=v;
	head[u]=cnt;
}
int n,m;
queue<int> q;
int in[maxn],inn[maxn];
int ans[maxn];
int num=0,sum=0;
bool flag1,flag2,vis[maxn];
int topo()
{
	flag1=0; flag2=0; num=0;
	for(int i=1;i<=26;i++)
	{
		inn[i]=in[i];
		if(!inn[i] && vis[i])
		{
			if(!flag1) flag1=1;//判断入读为0的点是否超过一个 
			else flag2=1;//如果超过一个，说明有两个的大小无法判断 
			q.push(i);
		}
	}
	if(q.empty()) return 1;//有环 
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		ans[++num]=u;
		flag1=0;
		for(int i=head[u];i;i=nex[i])
		{
			inn[to[i]]--;
			if(!inn[to[i]])
			{
				q.push(to[i]);
				if(!flag1) flag1=1;
				else flag2=1;
			}
		}
	}
	if(num!=sum) return 1;
	if(flag2) return 2;
	return 0;
}
char s;
int main()
{
	scanf("%d%d",&n,&m);
	int u,v;
	for(int i=1;i<=m;i++)
	{
		cin>>s;
		u=s-64; 
		if(!vis[u])
		{
			vis[u]=1; sum++;
		}
		cin>>s;
		cin>>s;
		v=s-64;
		if(!vis[v])
		{
			vis[v]=1; sum++;
		}
		in[v]++;
		add(u,v);
		if(topo()==1) 
		{
			printf("Inconsistency found after %d relations.",i);//存在矛盾 
            return 0;
		}
		if(sum==n && !topo())
		{
			printf("Sorted sequence determined after %d relations: ",i);
            for(int j=1;j<=n;j++) printf("%c",ans[j]+64);
            printf(".");
            return 0;
		}
	}
	printf("Sorted sequence cannot be determined.");
    return 0;
}