zoukankan      html  css  js  c++  java
  • 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<stdio.h>
     2 #include<vector>
     3 #include<queue>
     4 using namespace std;
     5 
     6 struct Node
     7 {
     8     int ID;
     9     int level;
    10 };
    11 vector<Node> Grap[1001];
    12 bool visit[1001];
    13 
    14 
    15 void inth(int n)
    16 {
    17     for(int i = 1; i<= n;i++)
    18         visit[i]=false;
    19 }
    20 
    21 int main()
    22 {
    23     int i,n,num,j,tem,L,Count;
    24     Node Ntem;
    25     scanf("%d%d",&n,&L);
    26     for(i = 1; i<= n ;i++ )
    27     {
    28         scanf("%d",&num);
    29         for(j = 0; j < num ;j++)
    30         {
    31             scanf("%d",&tem);
    32             Ntem.ID = i ;
    33             Grap[tem].push_back(Ntem);
    34         }
    35     }
    36 
    37     int k;
    38     scanf("%d",&k);
    39     for(i = 0; i < k;i++)
    40     {
    41         inth(n);
    42         Count = 0;
    43         scanf("%d",&tem);
    44         Ntem.ID = tem;
    45         Ntem.level = 0;
    46         queue<Node> Gqueue;
    47         Gqueue.push(Ntem);
    48         visit[Ntem.ID] = true;
    49         while(! Gqueue.empty())
    50         {
    51             Ntem = Gqueue.front();
    52             if(Ntem.level > L) break;
    53             ++Count ;
    54             
    55             Gqueue.pop();
    56             for(j = 0 ;j < Grap[Ntem.ID].size();j++)
    57             {
    58                 if(! visit[ Grap[Ntem.ID][j].ID ])
    59                 {
    60                     Grap[Ntem.ID][j].level = Ntem.level + 1;
    61                     visit[ Grap[Ntem.ID][j].ID ] = true;
    62                     Gqueue.push(Grap[Ntem.ID][j]);
    63                 }
    64             }
    65         }
    66 
    67 
    68         printf("%d
    ",Count-1);
    69     }
    70 
    71     return 0;
    72 }
  • 相关阅读:
    修改weblogic jvm启动参数
    weblogic部署步骤
    weblogic安装步骤
    sqldeveloper 导出数据库
    VO与PO 的理解
    【Hyper-V】与【VirtualBox】【VMware】冲突的解决方法
    xstream 实现simplebean2xml ,xml2simplebean
    eclipse中SVN报错解决
    点击eclipse包报错
    myeclipce项目导入eclipse中报错
  • 原文地址:https://www.cnblogs.com/xiaoyesoso/p/4290795.html
Copyright © 2011-2022 走看看