@[lianzhuo](/user/654958) 说句闲话,我加强版过了原题没过(
by wukaichen888 @ 2022-12-22 16:50:12
@[wukaichen888](/user/723238) 您不是过了吗?
by Light_az @ 2022-12-22 16:51:43
@[lianzhuo](/user/654958) 之前
by wukaichen888 @ 2022-12-22 17:19:38
草 那为什么把图遍历一次这题就过了? @[wukaichen888](/user/723238)
```cpp
#include<bits/stdc++.h>
#define ll long long
#define Test ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define found __builtin_popcount
using namespace std;
const int N=1e7+10,NN=1e4+10;
ll n,m,k,x,y,u,v,w,cnt=0,ans=0,t=0,l,r,len,T;
ll mini=INT_MAX,maxi=0,Mod;
string s1,s2;
vector<ll> tree[NN];
int a[N];
void dfs(int id){
a[id]=1;
for(int i=0;i<tree[id].size();i++){
if(!a[tree[id][i]]){
dfs(tree[id][i]);
}
}
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
while(cin>>v&&v){
tree[i].push_back(v);
}
}
for(int i=1;i<=n;i++){
if(!a[i]){
dfs(i);
ans++;
}
}
cout<<ans<<endl<<ans;
return 0;
}
```
by Light_az @ 2022-12-22 17:20:51
@[lianzhuo](/user/654958) 草(
by wukaichen888 @ 2022-12-22 17:39:21
@[lianzhuo](/user/654958) 这东西本质和tarjan一样吧,但是功能不如tarjan,因为除了有多少强联通分量啥都求不出来
by __Dinic__ @ 2022-12-22 17:42:20
不对啊,怎么看着这么不对劲
by __Dinic__ @ 2022-12-22 17:43:07
?
by Light_az @ 2022-12-22 17:43:52
这。。。你等一下我去tarjan板子交一下
by __Dinic__ @ 2022-12-22 17:44:22
算了,tarjan模版那题有点麻烦,我就不试了
by __Dinic__ @ 2022-12-22 17:48:06