zoukankan      html  css  js  c++  java
  • UVALIVE 6450 Social Advertising

    You have decided to start up a new social networking company. Other existing popular social networks
    already have billions of users, so the only way to compete with them is to include novel features no
    other networks have.
    Your company has decided to market to advertisers a cheaper way to charge for advertisements (ads).
    The advertiser chooses which users' wall" the ads would appear on, and only those ads are charged.
    When an ad is posted on a user's wall, all of his/her friends (and of course the user himself/herself)
    will see the ad. In this way, an advertiser only has to pay for a small number of ads to reach many
    more users.
    You would like to post ads to a particular group of users with the minimum cost. You already have
    the friends list" of each of these users, and you want to determine the smallest number of ads you have
    to post in order to reach every user in this group. In this social network, if A is a friend of B, then B
    is also a friend of A for any two users A and B.
    Input
    The input consists of multiple test cases. The rst line of input is a single integer, not more than
    10, indicating the number of test cases to follow. Each case starts with a line containing an integer n
    (1  n  20) indicating the number of users in the group. For the next n lines, the ith line contains the
    friend list of user i (users are labelled 1; : : : ; n). Each line starts with an integer d (0  d < n) followed
    by d labels of the friends. No user is a friend of himself/herself.
    Output
    For each case, display on a line the minimum number of ads needed to be placed in order for them to
    reach the entire group of users.
    Sample Input
    2
    5
    4 2 3 4 5
    4 1 3 4 5
    4 1 2 4 5
    4 1 2 3 5
    4 1 2 3 4
    5
    2 4 5
    2 3 5
    1 2
    2 1 5
    3 1 2 4
    Sample Output
    1
    2

    又是状态压缩的好题目,赛时没有想出来,结果看来别人的代码,顿时明白一切,还是太水,应该注意到n的范围,这样就不会这么水咯

    #include<map>
    #include<set>
    #include<stack>
    #include<queue>
    #include<cmath>
    #include<vector>
    #include<cstdio>
    #include<string>
    #include<cstring>
    #include<cstdlib>
    #include<iostream>
    #include<algorithm>
    #define  inf 0x0f0f0f0f
    
    using namespace std;
    vector<int>G[21];
    bool vis[21];
    
    int main()
    {
        int n,state,temp,t,cut,x,num;
        scanf("%d",&t);
        while(t--)
        {
            int ans=99999999;
            scanf("%d",&n);
            for (int i=0;i<=n;i++) G[i].clear();
            state=1<<n;
            for (int i=0;i<n;i++)
            {
                scanf("%d",&num);
                while(num--)
                {
                    scanf("%d",&x);
                    x--;
                    G[i].push_back(x);
                }
            }
            for (int s=0;s<state;s++)
            {
                memset(vis,0,sizeof(vis));
                temp=0;
                for (int i=0;i<n;i++)
                {
                    if (s & (1<<i))
                    {
                        temp++;
                        vis[i]=true;
                        for (int j=0;j<G[i].size();j++) vis[G[i][j]]=true;
                    }
                }
                int cut=0;
                for (int i=0;i<n;i++)
                if (vis[i]) cut++;
                if (cut==n) ans=min(ans,temp);
            }
            printf("%d
    ",ans);
        }
        return 0;
    }

    作者 chensunrise

    至少做到我努力了
  • 相关阅读:
    校园商铺-2项目设计和框架搭建-8升级mysql驱动相关的配置以支持mysql8
    校园商铺-2项目设计和框架搭建-7验证Dao
    校园商铺-2项目设计和框架搭建-6逐层完成SSM的各项配置
    校园商铺-2项目设计和框架搭建-5配置maven
    校园商铺-2项目设计和框架搭建-2实体类设计与表创建
    1移动测试流程和技术体系
    校园商铺-2项目设计和框架搭建-1系统功能模块划分
    校园商铺-1开发准备-3 Eclipse与maven的联合配置
    校园商铺-1开发准备-2开发准备
    校园商铺-1开发准备-1课程序章
  • 原文地址:https://www.cnblogs.com/chensunrise/p/3761658.html
Copyright © 2011-2022 走看看