为什么这样就过不了样例了

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m;
struct edge{
	int nxt,to;
}g[100005];
int cnt,head[10004];
void add(int u,int v){
	g[++cnt].nxt=head[u];
	g[cnt].to=v;
	head[u]=cnt;
}
int dfn[10004],low[10004],idx;
int ins[10004],s[10004],top;
int cscc,scc[10004];
vector<int> ans[10004];
void dfs(int x){
	dfn[x]=low[x]=++idx;
	ins[x]=1;s[++top]=x;
	for(int i=head[x];i;i=g[i].nxt){
		int y=g[i].to;
		if(!dfn[y]){
			dfs(y);
			low[x]=min(low[x],low[y]);
		}else if(ins[y]){
			low[x]=min(low[x],dfn[y]);
		}
	}
	if(low[x]==dfn[x]){
		++cscc;
		int t;
		do{
			t=s[top];top--;
			scc[t]=cscc;
			ans[cscc].push_back(t);
		}while(x!=t);
		sort(ans[cscc].begin(),ans[cscc].end());
	}
}
int w[10004];
map<int,bool> mp;
signed main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v;
		cin>>u>>v;
		if(u==v)continue;
		mp[u*100000+v]=1;
		add(u,v);//  1
	}
	for(auto i : mp){
		add((i.first)/100000,(i.first)%100000);//  2
	}
	for(int i=1;i<=n;i++){
		if(!dfn[i]){
			dfs(i);
		}
	}
	cout<<cscc<<"\n";
	for(int i=1;i<=n;i++){
		if(w[scc[i]]){
			continue;
		}
		w[scc[i]]=1;
		for(auto j : ans[scc[i]]){
			cout<<j<<" ";
		}
		cout<<"\n";
	}
}