第九个点！打了点却还是不过！跪辽

#include<bits/stdc++.h>
using namespace std;

const int maxn=30;		  
int n,m;
vector<int> g[maxn];

int d[maxn],ind[maxn],cpyind[maxn];
void topo(int line){
	int longest=-1;
	memset(d,0,sizeof(d));
	memcpy(cpyind,ind,sizeof(ind));
	stack<int> st;
	queue<int> ansque;
	for(int i=1;i<=n;i++)
		if(!ind[i])
			st.push(i);
	while(!st.empty()){
		int x=st.top();
		st.pop();
		longest=max(longest,d[x]);
		ansque.push(x);
		for(int i=0;i<g[x].size();i++){
			int y=g[x][i];
			d[y]=max(d[y],d[x]+1);
			if(!--cpyind[y])
				st.push(y);	
		}
	}
	if(ansque.size()<n){
		cout<<"Inconsistency found after "<<line<<" relations.";
		exit(0);
	}
	if(longest==n-1){
		cout<<"Sorted sequence determined after "<<line<<" relations:";
		while(!ansque.empty()){
			cout<<char(ansque.front()+'A'-1);
			ansque.pop();
		}
		cout<<'.'<<endl;
		exit(0);
	}
}

int main(){
	cin>>n>>m;
	
	memset(ind,0,sizeof(ind));
	
	char ch1,ch2;
	int x,y;
	for(int i=1;i<=m;i++){//ch1<ch2
		cin>>ch1>>ch2>>ch2;
		x=ch1-'A'+1,
		y=ch2-'A'+1;
		g[x].push_back(y);
		ind[y]++;
		topo(i);
	}
		
	cout<<"Sorted sequence cannot be determined.\n";
	return 0;
}