map平均准确率_拓扑排序怎么排

输入样例：
10 10
3 8
2 3
2 5
5 9
5 9
2 3
3 9
4 8
2 10
4 9
输出样例：
1
6
3
3
2
1
1
1
1
1

#include<bits/stdc++.h>
using namespace std;
const int N = 3e4 + 10;
const int M = 3e4 + 10;
struct Edge{ 
   
    int v,next;
}edge[M];
int head[N],cnt;
void add(int u,int v){ 
   
    edge[cnt].v = v;
    edge[cnt].next = head[u];
    head[u] = cnt ++;
}
bitset<N>f[N];
int in[N],q[N],hh = 0,tt = 0;
int main(){ 
   
    int n,m;
    cin>>n>>m;
    int x,y;
    memset(head,-1,sizeof head);
    for(int i = 0;i < m;i ++){ 
   
        cin>>x>>y;
        add(x,y),in[y] ++;
    }
    for(int i = 1;i <= n;i ++)if(!in[i])q[tt ++] = i;
    while(hh < tt){ 
   
        int t = q[hh ++];
        for(int i = head[t];~i;i = edge[i].next){ 
   
            int v = edge[i].v;
            if((-- in[v]) == 0)q[tt ++] = v;
        }
    }
    for(int i = tt - 1;i >= 0;i --){ 
   
        int j = q[i];
        f[j][j] = 1;
        for(int k = head[j];~k;k = edge[k].next){ 
   
            int v = edge[k].v;
            f[j] |= f[v];
        }
    }
    for(int i = 1;i <= n;i ++){ 
   
        cout<<f[i].count()<<endl;
    }
    return 0;
}