bfs60pts求助，1,2,3AC,4MLE,5TLE

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100005,mod=100003;
struct node{
	int u;
	int l;
};
queue<node>q;
vector<int>a[N];
int n,m;
int ans[N];
int minn[N];
int f[N];
void bfs()
{
	while(!q.empty())
	{
		node k=q.front();
		q.pop();
		int g=k.u,d=k.l;f[g]=1;
		int len=a[g].size();
		for(int i=0;i<len;i++)
		{
			if(f[a[g][i]]==0)
			{
				q.push((node){a[g][i],d+1});
				if(d+1<minn[a[g][i]])
				{
					ans[a[g][i]]=0;
					minn[a[g][i]]=d+1;
				}
				if(d+1==minn[a[g][i]])
					ans[a[g][i]]=(ans[a[g][i]]+1)%mod;	
			}	
		}
	}
}
main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);
	cin>>n>>m;
	for(int i=1;i<=n;i++)minn[i]=1e+9;
	for(int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		a[y].push_back(x);
		a[x].push_back(y);
	}
	minn[1]=1;f[1]=1;ans[1]=1;
	q.push((node){1,1});
	bfs();
	for(int i=1;i<=n;i++)
		cout<<ans[i]%mod<<'\n';
}