zoukankan      html  css  js  c++  java
  • (最小点覆盖) hdu 1054

    Strategic Game

    Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5514    Accepted Submission(s): 2550


    Problem Description
    Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldiers on the nodes so that they can observe all the edges. Can you help him?

    Your program should find the minimum number of soldiers that Bob has to put for a given tree.

    The input file contains several data sets in text format. Each data set represents a tree with the following description:

    the number of nodes
    the description of each node in the following format
    node_identifier:(number_of_roads) node_identifier1 node_identifier2 ... node_identifier
    or
    node_identifier:(0)

    The node identifiers are integer numbers between 0 and n-1, for n nodes (0 < n <= 1500). Every edge appears only once in the input data.

    For example for the tree: 

     

    the solution is one soldier ( at the node 1).

    The output should be printed on the standard output. For each given input data set, print one integer number in a single line that gives the result (the minimum number of soldiers). An example is given in the following table:
     
    Sample Input
    4 0:(1) 1 1:(2) 2 3 2:(0) 3:(0) 5 3:(3) 1 4 2 1:(1) 0 2:(0) 0:(0) 4:(0)
     
    Sample Output
    1 2
     
    Source
     

    这题在树上。。吓唬人。。树就是图。。

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<cstdlib>
    #include<string>
    #include<algorithm>
    #include<queue>
    #include<stack>
    #include<set>
    #include<vector>
    using namespace std;
    vector<int> e[1501];
    int n,mp[1501][1501],mark[1501],link[1501];
    bool dfs(int x)
    {
        for(int i=0;i<e[x].size();i++)
        {
            int v=e[x][i];
            if(mark[v]==-1)
            {
                mark[v]=1;
                if(link[v]==-1||dfs(link[v]))
                {
                    link[v]=x;
                    return true;
                }
            }
        }
        return false;
    }
    int main()
    {
        int x,y,z;
        while(scanf("%d",&n)!=EOF)
        {
            for(int i=0;i<n;i++)
                e[i].clear();
            for(int i=1;i<=n;i++)
            {
                scanf("%d:(%d)",&x,&y);
                for(int j=1;j<=y;j++)
                {
                    scanf("%d",&z);
                    e[x].push_back(z);
                    e[z].push_back(x);
                }
            }
            memset(link,-1,sizeof(link));
            int ans=0;
            for(int i=0;i<n;i++)
            {
                memset(mark,-1,sizeof(mark));
                if(dfs(i))
                    ans++;
            }
            printf("%d
    ",ans/2);
        }
        return 0;
    }
    

      

  • 相关阅读:
    C# 获取枚举 Enum 变量值的 Description 属性
    javascript获取网页URL地址及参数等
    也谈用反射实现Enum→String映射:一种重视性能的方法20090412 21:35一、问题的提出
    LinQ 多表查询
    Windows Service得到当前用户的名字和域
    ASP.NET 部署
    加密解密-C#
    Domino Internet邮件
    C#动态创建表
    读取Excel2000文件
  • 原文地址:https://www.cnblogs.com/water-full/p/4460515.html
Copyright © 2011-2022 走看看