0pts TLE 求条玄关

#include<bits/stdc++.h>
#define ll long long
#define int register int
#define AKIOI ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
#define endl '\n'
#define AKNOI return 0
using namespace std;
const ll MAXN=1e5+5,MAXM=2e5+5;
ll n,m,indeg[MAXN],ans[MAXN],depth;
bool f[MAXN];
map<ll,vector<ll> >line;
struct member{
	ll num,depth;
};
queue<member>q;
signed main(){
	AKIOI;
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		ll u,v;
		cin>>u>>v;
		line[u].push_back(v);
		indeg[v]++;
	}
	for(int i=1;i<=n;i++){
		if(indeg[i]==0) q.push(member{i,1});
		ans[i]=1;
	}
	while(!q.empty()){
		member now=q.front();
		for(auto it:line[now.num]){
			indeg[it]--;
			if(indeg[it]==0){
				q.push(member{it,now.depth+1});
				ans[it]=now.depth+1;
			}
		}
	}
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<endl;
	}
	AKNOI;
}