zoukankan      html  css  js  c++  java
  • PAT 1076 Forwards on Weibo

    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 (≤), the number of users; and L (≤), 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] (≤) is the total number of people that user[i] follows; and user_list[i] is a list of the M[i] users that 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 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 trigger, 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<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    #define MAXN 10005
    int n,L;
    vector<vector<int>> vec;
    int vis[MAXN] = {0};
    
    
    void bfs(int x){
        vis[x] = 1;
        queue<int> que;
        que.push(x);
        int cnt = 0;
        while(cnt!=L&&!que.empty()){
            cnt++;
            int len = que.size();    //计算层数这么写!!
            for(int i=0;i < len;i++){
                int tx = que.front();que.pop();
                for(int j=0;j < vec[tx].size();j++){    //此处i,j又写重复了
                    if(!vis[vec[tx][j]]){
                        que.push(vec[tx][j]);
                        vis[vec[tx][j]] = 1;
                    }
                }
            }
        }
    }
    
    
    
    
    
    
    
    int main(){
        cin >> n >> L;
        vec.resize(n+1);
        for(int i=1;i <= n;i++){
            int t;cin >> t;
            for(int j=0;j < t;j++){   //i,j两处写重复了!
                int num; cin >> num;
                vec[num].push_back(i);    //followed是关注的人,一开始写反了
            }
        }
    
        int K; cin >> K;
        while(K--){
            fill(vis,vis+n+1,0);
            int Q; cin >> Q;
            bfs(Q);
            int count = 0;
            for(int i=1;i <= n;i++){
                if(vis[i]) count++;
    //            cout << vis[i] << " ";
            }
            cout << count-1 << endl;
        }
    
    
        return 0;
    }

    一杯茶,一包烟,一条图论写一天

     
  • 相关阅读:
    jmeter调试-webservise服务直接HTTP请求--方式一
    jmeter-webservise服务HTTP信息头管理器方式--方式二
    使用SoupUI工具获得webservise服务的请求格式内容
    SOUPUI安装破解-小白看
    Jmeter-插件扩展及性能监控插件的安装
    jmeter-命令行执行及测试报告导出
    类加载过程
    老生常谈:String s1 = new String("abc") 创建了几个字符串对象及8 种基本类型的包装类和常量池
    mysql的日期时间类型格式
    leetCode 您正在爬楼梯。它需要n步才能到达顶部。每次您可以爬1或2步。您可以通过几种不同的方式登顶?
  • 原文地址:https://www.cnblogs.com/cunyusup/p/10805143.html
Copyright © 2011-2022 走看看