PAT A1076. Forwards on Weibo (30)
来源:互联网 发布:淘宝网什么销量最好 编辑:程序博客网 时间:2024/05/16 11:14
Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers can view and forward his/her post, which can then be forwarded again by their followers. Now given a social network, you are supposed to calculate the maximum potential amount of forwards for any specific user, assuming that only L levels of indirect followers are counted.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=1000), the number of users; and L (<=6), the number of levels of indirect followers that are counted. Hence it is assumed that all the users are numbered from 1 to N. Then N lines follow, each in the format:
M[i] user_list[i]
where M[i] (<=100) is the total number of people that user[i] follows; and user_list[i] is a list of the M[i] users that are followed by user[i]. It is guaranteed that no one can follow oneself. All the numbers are separated by a space.
Then finally a positive K is given, followed by K UserID's for query.
Output Specification:
For each UserID, you are supposed to print in one line the maximum potential amount of forwards this user can triger, assuming that everyone who can view the initial post will forward it once, and that only L levels of indirect followers are counted.
Sample Input:7 33 2 3 402 5 62 3 12 3 41 41 52 2 6Sample Output:
45
#include <cstdio>#include <queue>#include <algorithm>#include <cstring>#include <vector>using namespace std;const int Max = 1111;vector<int> Follower[Max];struct user{int id;int depth;}S[Max];int n,l;bool Visit[Max];int BFS(int v,int l){int reput=0;queue<user> q;while(!q.empty()){q.pop();}user p=S[v];p.depth=0;Visit[p.id]=true;q.push(p);while(!q.empty()){user k = q.front();q.pop();int b=k.id;for(int i=0;i<Follower[b].size();i++){user x = S[Follower[b][i]];x.depth=k.depth+1;int z=x.id;if(Visit[z]==false&&x.depth<=l){q.push(x);Visit[z]=true;reput++;}}}return reput;}int main(){ scanf("%d%d",&n,&l);int temp,ans;for(int i=1;i<=n;i++){S[i].id=i;S[i].depth=0;scanf("%d",&temp);for(int j=0;j<temp;j++){scanf("%d",&ans);Follower[ans].push_back(i);}}scanf("%d",&temp);for(int i=0;i<temp;i++){for(int i=1;i<=n;i++){Visit[i]=false;}scanf("%d",&ans);int num=BFS(ans,l);printf("%d\n",num);}system("pause");return 0;}
- PAT A1076. Forwards on Weibo (30)
- pat-a1076. Forwards on Weibo (30)
- PAT-Forwards on Weibo
- PAT (Advanced) 1076. Forwards on Weibo (30)
- PAT A 1076. Forwards on Weibo (30)
- PAT-1076. Forwards on Weibo (30)
- pat 1076. Forwards on Weibo (30)
- PAT 1076. Forwards on Weibo (30)
- PAT 1076. Forwards on Weibo (30)
- PAT 1076. Forwards on Weibo (30)
- 【PAT】 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30) PAT
- PAT(A) - 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30) PAT 甲级
- PAT 1076-Forwards on Weibo (30)
- PAT-A-1076. Forwards on Weibo (30)
- 【PAT甲级】1076. Forwards on Weibo (30)
- Pat(A) 1076. Forwards on Weibo (30)
- Moving Tables【区间覆盖】
- 家乡的年味
- cnn实现手写识别字体代码详解
- 汉诺塔游戏-递归算法python
- 网络编程之android后台取服务器端xml解析之dom解析
- PAT A1076. Forwards on Weibo (30)
- Java常用的输出调试技巧
- 爱情
- 封装简单iframe插件
- 手机抓包的两种方法:wireshark抓包和fiddler抓包
- 无心插柳柳成荫之面试
- JSP九大内置对象的作用和用法总结
- 集成一个第三方SDK正确工作流程(踩坑有感)
- 使用wireshark以及filddler配合抓去手机端的TCP以及HTTP请求