mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
Create 1001_Shangli_Cloud.cpp
From http://acm.hdu.edu.cn/discuss/problem/post/reply.php?postid=19124&messageid=1&deep=0
This commit is contained in:
parent
cb09232659
commit
c5c5edace7
65
BestCoder/Round-1/1001_Shangli_Cloud.cpp
Normal file
65
BestCoder/Round-1/1001_Shangli_Cloud.cpp
Normal file
|
@ -0,0 +1,65 @@
|
|||
#include"iostream"
|
||||
#include"cstdio"
|
||||
#include"cstring"
|
||||
#include"algorithm"
|
||||
#include"queue"
|
||||
#include"vector"
|
||||
using namespace std;
|
||||
const int ms=30010;
|
||||
vector<int> v[ms];
|
||||
struct cmp
|
||||
{
|
||||
bool operator()(const int &a,const int &b)
|
||||
{//从大到小
|
||||
return a<b;//注意在结构体中以第二元素为基准
|
||||
}
|
||||
};
|
||||
int n,m,in[ms],ans[ms],cnt;
|
||||
void topo()
|
||||
{
|
||||
priority_queue<int,vector<int>,cmp> q;
|
||||
for(int i=1;i<=n;i++)
|
||||
if(in[i]==0)
|
||||
q.push(i);
|
||||
int x,i;
|
||||
while(!q.empty())
|
||||
{
|
||||
x=q.top();
|
||||
q.pop();
|
||||
ans[++cnt]=x;
|
||||
for(i=0;i<v[x].size();i++)
|
||||
{
|
||||
in[v[x][i]]--;
|
||||
if(in[v[x][i]]==0)
|
||||
q.push(v[x][i]);
|
||||
}
|
||||
}
|
||||
return ;
|
||||
}
|
||||
int main()
|
||||
{
|
||||
int t,a,b,i;
|
||||
cin>>t;
|
||||
while(t--)
|
||||
{
|
||||
cin>>n>>m;
|
||||
for(i=0;i<=n;i++)
|
||||
v[i].clear();
|
||||
memset(in,0,sizeof(in));
|
||||
while(m--)
|
||||
{
|
||||
scanf("%d%d",&a,&b);
|
||||
v[b].push_back(a);
|
||||
in[a]++;
|
||||
}
|
||||
cnt=0;
|
||||
topo();
|
||||
printf("%d",ans[cnt]);
|
||||
for(i=cnt-1;i>0;i--)
|
||||
{
|
||||
printf(" %d",ans[i]);
|
||||
}
|
||||
puts("");
|
||||
}
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user