问题 B: 确定比赛名次 codeup拓扑排序问题

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<queue>
#include<cstring>
#include<vector>
using namespace std;
const int maxn = 510;
int inDegree[maxn] = { 0 }; //记录每个节点的入度
int n; //节点个数
vector<int> Adj[maxn]; //邻接表
bool topologicalSort() {
	priority_queue<int, vector<int>, greater<int> > q;
	for (int i = 1; i <= n; i++) {
		if (inDegree[i] == 0)
			q.push(i); //把入度为0的节点压入
	}
	int num = 0; //记录已经位于拓扑排序序列中的节点个数
	while (!q.empty()) {
		int t = q.top();
		//输出结果
		printf("%d", t);
		if (num < n)
			printf(" ");
		else
			printf("\n");
		q.pop();
		num++;
		for (int i = 0; i < Adj[t].size(); i++) {
			int tmp = Adj[t][i];
			inDegree[tmp]--;
			if (inDegree[tmp] == 0) {
				q.push(tmp);
			}
		}
	}
	if (num == n) {
		return true;
	}
	return false;
}
int main() {
	int m;
	while (scanf("%d %d", &n, &m) , n!=0||m!=0) {
		memset(inDegree, 0, sizeof(inDegree));
		for (int i = 0; i < m; i++) {
			int a, b;
			scanf("%d %d", &a, &b);
			inDegree[b]++;
			Adj[a].push_back(b);
		}
		topologicalSort();
		//邻接表清空
		for (int i = 0; i < maxn; i++)
			Adj[i].clear();
	}

}

问题 B: 确定比赛名次 - Codeup新家 (hustoj.com)http://codeup.hustoj.com/problem.php?cid=100000623&pid=1#