PAT 1076. Forwards on Weibo (30)
来源:互联网 发布:平湖市行知小学足球 编辑:程序博客网 时间:2024/06/07 03:50
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
坑点在于粉丝层数小于给的目标最数。注意限制下进队列的人,进过的不能再进,不然最后一个case内存超限。
#include <iostream>#include<stdio.h>#include<queue>#include<string.h>#include<string>#include<vector>using namespace std;vector<int> node[1005];int mark[1005];void got(int x,int l) { int cnt=0; memset(mark,0,sizeof(mark)); int p1,p2,p3; p3=0; p2=1; p1=0; mark[x]=1; queue<int> Q; Q.push(x); while(p3!=l) { int tmp; tmp=Q.front(); if(Q.empty()) break; Q.pop(); for(int i=0;i<node[tmp].size();i++) { int zz=node[tmp][i]; //if(zz<=0) break; if(mark[zz]==0) cnt++; if(mark[zz]==0) //就是这句,不加内存炸裂 Q.push(zz); mark[zz]=1; } p1++; if(p1==p2) { p3++; p1=0; p2=Q.size(); } } cout<<cnt<<endl; }int main(){ int n,m,l; cin>>n>>l; for(int i=1;i<=n;i++) { int tmp; scanf("%d",&tmp); for(int j=0;j<tmp;j++) { int aa; scanf("%d",&aa); node[aa].push_back(i); } } cin>>m; for(int i=0;i<m;i++) { int kk; scanf("%d",&kk); got(kk,l); } return 0;}
- 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-A-1076. Forwards on Weibo (30)
- 【PAT甲级】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
- PAT 1076. Forwards on Weibo
- UGUI 学习笔记7 Toggle
- java web学习总结38:数据库的事务机制
- 移动端-rem使用
- TCPIP建立和数据传输过程
- 微信公众号:js-sdk初始化流程图记录
- PAT 1076. Forwards on Weibo (30)
- Spring+SpringMVC+SpingDataJPA(基于Hibernate)框架搭建
- *** Assertion failure in -[MBProgressHUD initWithView:],
- ARM(rk3036)平台编译Ne10开源库
- Linux更改字符集
- ajax 工作原理
- [Leetcode] 389. Find the Difference 解题报告
- python中的print遇到\r回车符的时候
- leetcode 671. Second Minimum Node In a Binary Tree