今天上午做这道题一直wa,也不知道哪里出错了,后来发现还是自己对拓扑排序理解不够深入,尤其是排序过程,好容易ac
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int ind[10005];
//int to[10005];
int main()
{
int m, n;
while(scanf("%d%d",&n,&m) != EOF)
{
vector<int>e[10005];
memset(ind, 0, sizeof(ind));
int u, v;
while(m --)
{
scanf("%d%d",&u,&v);
e[v].push_back(u);
ind[u] ++;
}
queue<pair<int, int> >q;
int ans = 0;
int ct = 0;
for(int i = 1 ; i <= n; i ++)
if(! ind[i])
{
q.push(pair<int, int>(i, 888));
ans += 888;
ct ++;
}
//int cnt1 = 1;
while(!q.empty())
{
pair<int, int> h = q.front();
q.pop();
//to[cnt ++] = h;
for(int i = 0; i < e[h.first].size(); i ++)
{
int H = e[h.first][i];
ind[H] --;
if(! ind[H])
{
q.push(pair<int, int>(H, h.second + 1));
ans += h.second + 1;
//ans += cnt1;
ct ++;
}
}
//cnt1++;
}
if(ct == n)
printf("%d\n",ans);
else printf("-1\n");
}
return 0;
}