zoukankan      html  css  js  c++  java
  • pat1076. Forwards on Weibo (30)

    1076. Forwards on Weibo (30)

    时间限制
    3000 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    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 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
    

    提交代码

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<cmath>
     4 #include<algorithm>
     5 #include<stack>
     6 #include<queue>
     7 #include<set>
     8 #include<map>
     9 #include<vector>
    10 #include<iostream>
    11 using namespace std;
    12 map<int,vector<int> > edge;
    13 bool vis[1005];
    14 int main(){
    15     //freopen("D:\INPUT.txt","r",stdin);
    16     int n,l;
    17     scanf("%d %d",&n,&l);
    18     int i,j,amount,num;
    19     for(i=1;i<=n;i++){
    20         scanf("%d",&amount);
    21         for(j=0;j<amount;j++){
    22             scanf("%d",&num);
    23             edge[num].push_back(i);
    24         }
    25     }
    26     int k;
    27     scanf("%d",&k);
    28     vector<int>::iterator it;
    29     int cur;
    30     for(i=0;i<k;i++){
    31         memset(vis,false,sizeof(vis));
    32         queue<int> q;
    33         scanf("%d",&num);
    34         q.push(num);
    35         vis[num]=true;
    36         amount=0;
    37         int last,e=num,f=0;
    38         while(!q.empty()){
    39             cur=q.front();
    40             q.pop();
    41             for(it=edge[cur].begin();it!=edge[cur].end();it++){
    42                 if(!vis[*it]){
    43                     vis[*it]=true;
    44                     amount++;
    45                     q.push(*it);
    46                     last=*it;
    47                 }
    48             }
    49             if(e==cur){
    50                 e=last;
    51                 f++;
    52                 if(f==l){
    53                     break;
    54                 }
    55             }
    56         }
    57         printf("%d
    ",amount);
    58     }
    59     return 0;
    60 }
  • 相关阅读:
    迭代
    UIViewController生命周期控制
    JPA相关注解
    正則表達式截取字符串两字符间的内容
    HDU 1789 Doing Homework again
    《从零開始学Swift》学习笔记(Day48)——类型检查与转换
    POJ 3280 Cheapest Palindrome(区间DP)
    JavaScript高级特性之原型
    http协议
    编程算法
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4783151.html
Copyright © 2011-2022 走看看