1076. Forwards on Weibo (30)
来源:互联网 发布:vscode 导出配置 编辑:程序博客网 时间:2024/05/22 15:42
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
//1076#include<iostream>#include<vector>using namespace std;vector<vector<int>>usr;//user's follower lists//n:the number of users;//L:the number of levels of indirect followers that are countedint n,L;int bfs(int id){//bfs searchint count=0;//maximum amount of forwardsvector<int>curlevel,nextlevel;vector<int>visited;//visited flagvisited.assign(n+1,0);visited[id]=1;curlevel.push_back(id);for(int i=0;i<L;++i){//search only L levelnextlevel.clear();for(int j=0;j<curlevel.size();++j){for(int k=0;k<usr[curlevel[j]].size();++k)if(!visited[usr[curlevel[j]][k]]){nextlevel.push_back(usr[curlevel[j]][k]);visited[usr[curlevel[j]][k]]=1;++count;}}curlevel=nextlevel;}return count;}int main(){scanf("%d%d",&n,&L);usr.resize(n+1);for(int i=1;i<=n;++i){int m,temp;scanf("%d",&m);for(int j=0;j<m;++j){//i is the follower of tempscanf("%d",&temp);usr[temp].push_back(i);}}int k;scanf("%d",&k);for(int i=0;i<k;++i){int id;scanf("%d",&id);printf("%d\n",bfs(id));}return 0;}
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- 1076. Forwards on Weibo (30)
- POJ 题目3723 Conscription(最小生成树变形)
- typedef void (^funcblock)(void);
- iOS 模糊搜索
- [Codeforces #295(Div 2)]简要题解
- gradle多渠道打包及友盟统计-eclipse版本
- 1076. Forwards on Weibo (30)
- 最小生成树末班
- 黑马程序员——Math.random小结
- hdu 1028 Ignatius and the Princess III 母函数水题,,大家注意了,,我要开始刷母函数了~~
- PAT(B)1006. 换个格式输出整数 (15)
- 非UI线程处理Bitmap
- C#生成随机数的三种方法
- PAT A1084或者B1029 旧键盘
- HTTP协议理解与应用总结