题目传送门
题意: 题意较复杂…链接在上面。
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define int long long
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define ull unsigned long long
#define pqi priority_queue<int>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
using namespace std;
const int N=1e5+5;
const int inf=0x7fffffff;
const int mod=1e9+7;
const double eps=1e-6;
vi v[N];int c[N],u[N];int in[N],out[N],w[105][105];
pqi q;
signed main()
{
IOS;
int n,p;
cin>>n>>p;
for(int i=1;i<=n;i++)
{
cin>>c[i]>>u[i];
}
for(int i=1;i<=p;i++)
{
int x,y,z;
cin>>x>>y>>z;
v[x].pb(y);
in[y]++;
out[x]++;
w[x][y]=z;
}
for(int i=1;i<=n;i++)
{
if(in[i]==0)
{
c[i]+=u[i];
q.push(i);
}
}
while(!q.empty())
{
int x=q.top();
q.pop();
c[x]-=u[x];
for(int i=0;i<v[x].size();i++)
{
int t=v[x][i];
in[t]--;
if(c[x]>0)
c[t]+=w[x][t]*c[x];
if(in[t]==0)
q.push(t);
}
}
bool ok=0;
for(int i=1;i<=n;i++)
{
if(out[i]==0&&c[i]>0)
{
ok=1;
cout<<i<<' '<<c[i]<<endl;
}
}
if(!ok)
cout<<"NULL"<<endl;
}