来自玄学的乱搞,做题的时候一脸蒙逼…没看懂题orz
我这智商感觉手表是用不了了
标解是线段树,但是这种乱搞能过…大概是因为这个DAG是稀疏图的缘故【妈的怎么稠密
乱搞非常暴力…
优先队列把所有可以使用的点(入度不大于k,即可以有效删去使它成为入度为0的点)全部丢进去,从满足要求的字典序第一位开始查找,贪心地将点丢进答案…顺便更新k就行辣
#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
#include <cstring>
#define MOD 1000000007
using namespace std;
const int maxn = 100005;
int T,n,m,k,u,v,tot,temp;
int ans[maxn], vis[maxn], in[maxn];
long long sum;
vector <int> edge[maxn];
priority_queue <int> q;
int main(void)
{
scanf("%d", &T);
while(T--)
{
tot = 0;
scanf("%d%d%d", &n, &m, &k);
memset(vis, 0, sizeof(vis));
memset(in, 0, sizeof(in));
for(int i = 1; i <= n; i++)
edge[i].clear();
for(int i = 0; i < m; i++)
{
scanf("%d%d", &u, &v);
in[v]++;
edge[u].push_back(v);
}
for(int i = 1; i <= n; i++)
if(in[i] <= k) q.push(-i), vis[i] = 1;
while( !q.empty() )
{
temp = -(q.top()); q.pop();
if(k >= in[temp]) ans[tot++] = temp, k -= in[temp];
else
{
vis[temp] = 0;
continue;
}
for(int i = 0; i < edge[temp].size(); i++)
{
in[edge[temp][i]]--;
if(in[edge[temp][i]] <= k && !vis[edge[temp][i]])
q.push(-edge[temp][i]),
vis[edge[temp][i]] = 1;
}
}
sum = 0;
for(int i = 0; i < tot; i++)
{
sum += (long long)ans[i]*(long long)(i+1);
sum %= MOD;
}
cout<<sum<<endl;
}
return 0;
}