PAT甲级1076
来源:互联网 发布:java引号转义 编辑:程序博客网 时间:2024/05/17 23:16
1076. Forwards on Weibo (30)
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<vector>#include<queue>#include<algorithm>using namespace std;const int maxn = 1010;bool inq[maxn] = { false };vector<int> G[maxn];int N, L,M,uid,K,query;int BFS(int start){fill(inq, inq + maxn, false);int potential = 0;queue<int> Q;Q.push(start);inq[start] = true;int level = 0;int lastnode=start, newLastNode;while (!Q.empty()){int f = Q.front();Q.pop();if (G[f].size()){for (int i = 0; i <G[f].size(); i++){int t = G[f][i];if (!inq[t]){Q.push(t);inq[t] = true;newLastNode = t;}}}if (level >= 1 && level <= L)//这个地方,我觉得题意有点问题,他说只计L层间接粉丝数{//但真正表达的意思是只计L层直接或间接粉丝数potential++;}if (f == lastnode){lastnode = newLastNode;level++;}}return potential;}int main(){scanf("%d %d", &N, &L);for (int i = 1; i <=N; i++){scanf("%d", &M);for (int j = 0; j < M; j++){scanf("%d", &uid);G[uid].push_back(i);}}scanf("%d", &K);for (int i = 0; i < K; i++){scanf("%d", &query);printf("%d\n", BFS(query));}return 0;}
- PAT(甲级)1076
- 浙大PAT甲级 1076
- PAT甲级1076
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- 嵌入式linux自动挂载u盘的方法MDEV自动挂载U盘方法
- 谈谈Java内存管理
- Docker存储驱动之overlay新镜像存储的实现和inode耗尽问题
- 分表
- 万能地图下载器四种授权方式分析
- PAT甲级1076
- Latex-下划线
- View的事件体系(一)kao
- 2016世界互联网大会小结
- 2017新的突破
- Graphql入门_1
- 分布式集群Session共享 简单多tomcat8+redis的session共享实现
- Mac(unix)终端下FTP客户端的实现 c++
- 离散余弦变换