题意:1-n的同学排队,总有些奇葩的要求,比如a同学不想b同学站自己前面,也就是理解为b必须在a后面,这样的奇葩要求有m个,每个同学评价分为包括自己的前边最小id,求所有同学的最大分数和
拿到这题,看到a后面是b的要求,就能想到一条a指向b的边,a入度为0应该先考虑,a考虑了,b的入度就变成了0就该接着考虑,就可以想到用拓扑排序,维护一个最大优先权队列,先将入度为0全部入列,然后挨个pop维护minn并累加进ans里,每次都要记得更新节点入度,出现0就入列,队列空时即为结束,输出ans
tm我比赛时定义的vector数组,每次循环清空,用错了方法,导致我一直wa,写在这里,当做教训
vectorto[100005]
我用的to->clear(),其实是删掉了所有指针
应该挨个clear,像这样
for(int i=1;i<=n;i++)
{
to[i].clear();
}
all in all!
详见代码
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<set>
#include<map>
#include<sstream>
#include<iomanip>
#include<deque>
#define ll long long
#define sc(x) scanf("%d",&x)
#define pf(x) printf("%d\n",x)
using namespace std;
const int mod = 1e9 + 7;
ll t;
priority_queue<int >q;
ll n, m;
ll a, b;
ll tot[100005];
vector<ll >to[100005];
int main()
{
scanf("%lld", &t);
while (t--)
{
memset(tot, 0, sizeof(tot));
scanf("%lld%lld", &n, &m);
//to->clear();
//cout << to[1][0] << endl;
for (int i = 1; i <= n; i++)
{
to[i].clear();
}
for (ll i = 1; i <= m; i++)
{
scanf("%lld%lld", &a, &b);
to[a].push_back(b);
tot[b]++;
}
for (ll i = 1; i <= n; i++)
{
if (!tot[i])
q.push(i);
}
ll sum = 0;
ll minn = 999999;
while (!q.empty())
{
ll now = q.top();
q.pop();
minn = min(minn, now);
sum += minn;
for (ll i = 0; i < to[now].size(); i++)
{
if ((--tot[to[now][i]] )== 0)q.push(to[now][i]);
}
}
printf("%lld\n", sum);
}
}