topo sort

P1038 神經網路，拓撲排序板子題

include <bits/stdc++.h>

using namespace std;
const int N=1e2+10;
struct node
{
int v,w;
};
vector g[N];
queue q;
int n,m;
bool flag=true;
int c[N],in[N],out[N],vis[N];
void topsort()
{
while(!q.empty())
{
int u=q.front();
q.pop();
if(c[u]<=0) continue;
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i].v;
c[v]+=c[u]*g[u][i].w;
if(!(--in[v]))
{
q.push(v);
// vis[v]=1;
}
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen("xxx.in","r",stdin);
//freopen("xxx.out","w",stdout);
cin>>n>>m;
for(int i=1;i<=n;i++)
{
int x;
cin>>c[i]>>x;
if(c[i]>0)
{
q.push(i);
vis[i]=1;
}
else
{
c[i]-=x;
}
}
for(int i=1;i<=m;i++)
{
int u,v,w;
cin>>u>>v>>w;
g[u].push_back({v,w});
out[u]=1;
in[v]++;
}
topsort();
for(int i=1;i<=n;i++)
{
if(c[i]>0&&!out[i])
{
flag=false;
cout<<i<<' '<<c[i]<<'\n';
}
}
if(flag) cout<<"NULL"<<endl;
return 0;
}