分享联通块代码
2024-07-17 14:59:17
发布于：浙江
7阅读
0回复
0点赞
#include<bits/stdc++.h>
using namespace std;
int n,m;
vector<int>e;
int main(){
cin >> n >> m;
for(int i = 1;i <= m;i++){
int u,v;
cin >> u >> v ;
e[u].push_back(v);
e[v].push_back(u);
}
int x,y;
cin >> x >> y;
queue<int> q;
bool visited[200005];
visited[x] = true;
int cnt = 0;
while(!q.empty()){
int now = q.front();
q.pop();
cnt++;
for(int i = 0;i < e[now].size();i++){
int nxt = e[now][i];
if(!visiyed[nxt]){
q.push(nxt);
visited[nxt] = true;
}
}
}
if(visited[y])cout << cnt;
else cout << 0;
return 0;
}
有帮助，赞一个