确定比赛名次 HDU - 1285 拓扑排序

标题

问题本质就是输出入度为0的节点然后删边继续
拓扑排序模版题 使用优先队列解决多种情况下输出最小编号的问题

AC代码

#include <stdio.h>
#include <bits\stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const int MAXN = 510;
vector<int> edge[MAXN];
int deg[MAXN], ans[MAXN];

void DAG(int n)
{
	priority_queue<int, vector<int>, greater<int> > pq; //使用优先队列存储解决输出最小问题
	for (int i = 1; i <= n; i++)
		if (!deg[i])
			pq.push(i);
	int cnt = 0;
	while (!pq.empty())
	{
		int u = pq.top();
		pq.pop();
		ans[++cnt] = u;
		for (int i = 0; i < edge[u].size(); i++)
		{
			int v = edge[u][i];
			deg[v]--;
			if (!deg[v]) //度为0则入队
				pq.push(v);
		}
	}
}
int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
	int N, M;
	while (cin >> N >> M)
	{
		for (int i = 1; i <= N; i++)
			edge[i].clear();
		for (int i = 0; i < M; i++)
		{
			int u, v;
			scanf("%d%d", &u, &v);
			edge[u].push_back(v);
			deg[v]++;
		}
		DAG(N);
		for (int i = 1; i <= N; i++)
		{
			if (i != 1)
				putchar(' ');
			printf("%d", ans[i]);
		}
		cout << endl;
	}
	
	return 0;
}