zoukankan      html  css  js  c++  java
  • PAT 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 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
    
     注意点:在压栈的时候,修改节点的状态
    #include<iostream>
    #include<vector>
    #include<queue>
    #include<algorithm>
    using namespace std;
    
    struct node{
      int val, height;
    };
    vector<node> v[1001];
    int vis[1001];
    int n, l;
    
    int bfs(int s){
      node start;
      start.val = s;
      start.height=0;
      int num=0;
      queue<node> q;
      q.push(start);
      vis[s] = 1;
      while(q.size()){
        node temp = q.front();
        q.pop();
        int u=temp.val;
        for(int i=0; i<v[u].size(); i++){
          node next=v[u][i];
          next.height = temp.height+1;
          if(!vis[next.val] && next.height<=l){
            vis[next.val] = 1;
            num++;
            q.push(next);
          }
        }
      }
      return num;
    }
    int main(){
      int i, j, m, t;
      cin>>n>>l;
      for(i=1; i<=n; i++){
        int cnt, temp;
        scanf("%d", &cnt);
        node user;
        user.val=i;
        for(j=0; j<cnt; j++){
          scanf("%d", &temp);
          v[temp].push_back(user);
        }
      }
      scanf("%d", &m);
      for(i=0; i<m; i++){
        scanf("%d", &t);
        fill(vis, vis+1001, 0);
        int num= bfs(t);
        printf("%d
    ", num);
      }
      return 0;
    }
    有疑惑或者更好的解决方法的朋友,可以联系我,大家一起探讨。qq:1546431565
  • 相关阅读:
    阿里云云效技术专家分享:云原生开发、调测及可靠发布解决方案
    对话李飞飞,揭秘国际体育赛事风“云”背后的黑科技
    时序数据库永远的难关 — 时间线膨胀(高基数 Cardinality)问题的解决方案
    当Java遇上机密计算,又一段奇幻之旅开始了!
    内核热补丁,真的安全么?
    在 Dubbo3.0 上服务治理的实践
    CCF-201509-3-生成模板系统
    WPF CommandParameter的使用
    UWP App Data存储和获取
    在WPF中的ItemsControl中使用事件和命令(Using events and Commands within ItemsControl in WPF)
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9236745.html
Copyright © 2011-2022 走看看