Sample Input:
7 3
3 2 3 4
0
2 5 6
2 3 1
2 3 4
1 4
1 5
2 2 6
Sample Output:
4
5
题解:
该题是图的BFS,
1.题目中有层数限制,则将访问标志数组vis[]
,用访问层数标志结点是否被访问,注意每次进行BFS前将其初始化
#include <iostream>
#include <queue>
using namespace std;
const int MAXV = 1010;
int n,G[MAXV][MAXV]={0};//n人数, G邻接矩阵
int l;//l层数
int vis[MAXV];//vis表示该结点是在第几层转发的
int ans = 0;
void BFS(int u){
queue<int> q;
q.push(u);
vis[u] = 0;
ans = 0;
while(!q.empty()){
int a = q.front();
q.pop();
for(int i=1;i <= n;i++){
if(G[a][i] == 1 && vis[a] < l && vis[i] == -1){
q.push(i);
vis[i] = vis[a] + 1;
ans += 1;
}
}
}
cout << ans << endl;
}
int main(){
cin >> n >> l;
int follow_num,temp_follow;
for(int i=1;i <= n;i++){
cin >> follow_num;
for(int j = 0; j< follow_num;j++){
cin >> temp_follow;
G[temp_follow][i] = 1;
}
}
int need_solve,temp_solve;
cin >> need_solve;
for(int i=0;i < need_solve;i++){
cin >> temp_solve;
for(int i=1;i <= n;i++){//初始化vis[]
vis[i]=-1;
}
BFS(temp_solve);
}
system("pause");
return 0;
}