題目連結

#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int N=1e6+10,mod=998244353;
struct node{
	int u,d,pre,rnk;
	node(){}
	node(int _u,int _d,int _pre,int _rnk):u(_u),d(_d),pre(_pre),rnk(_rnk){}
};
bool operator<(node a,node b)
{
	if(a.d!=b.d)return a.d>b.d;
	return a.pre==b.pre?a.rnk>b.rnk:a.pre>b.pre;
}
struct Edge{
	int v,w,nx;
}e[N];
int n,m,tot,cnt,deg[N],ans[N],rnk[N],pre[N],pw[N],dis[N],hd[N];
priority_queue<node>q;
inline void add(int u,int v,int w)
{
	e[++tot].v=v;e[tot].w=w;e[tot].nx=hd[u];hd[u]=tot;
}
int main()
{
	//freopen("in.txt","r",stdin);
	memset(ans,-1,sizeof(ans));
    scanf("%d%d",&n,&m);
    for(int i=1,u,v,w;i<=m;i++)scanf("%d%d%d",&u,&v,&w),add(v,u,w),deg[u]++;
    for(int i=1;i<=n;i++)if(!deg[i])ans[i]=0,q.push(node(i,0,0,0));
    while(q.size())
    {
    	int u=q.top().u;q.pop();rnk[u]=++cnt;
    	if(ans[u]==-1)ans[u]=29ll*(ans[pre[u]]+pw[u])%mod;
    	for(int i=hd[u];i;i=e[i].nx)
    	{
    		if(dis[u]+1>dis[e[i].v])dis[e[i].v]=dis[u]+1,pw[e[i].v]=e[i].w,pre[e[i].v]=u;
    		else if(dis[u]+1==dis[e[i].v]&&(e[i].w<pw[e[i].v]||e[i].w==pw[e[i].v]&&rnk[pre[e[i].v]]>rnk[u]))pw[e[i].v]=e[i].w,pre[e[i].v]=u;
    		if(!--deg[e[i].v])q.push(node(e[i].v,dis[e[i].v],pw[e[i].v],rnk[pre[e[i].v]]));
		}
	}
	for(int i=1;i<=n;i++)
	    if(ans[i]==-1)puts("Infinity");
	    else printf("%d\n",ans[i]);
	return 0;
}
 

總結

無