zoukankan      html  css  js  c++  java
  • hdu5438 Ponds dfs 2015changchun网络赛

    Ponds

    Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
    Total Submission(s): 533    Accepted Submission(s): 175


    Problem Description
    Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value v.

    Now Betty wants to remove some ponds because she does not have enough money. But each time when she removes a pond, she can only remove the ponds which are connected with less than two ponds, or the pond will explode.

    Note that Betty should keep removing ponds until no more ponds can be removed. After that, please help her calculate the sum of the value for each connected component consisting of a odd number of ponds
     
    Input
    The first line of input will contain a number T(1T30) which is the number of test cases.

    For each test case, the first line contains two number separated by a blank. One is the number p(1p104) which represents the number of ponds she owns, and the other is the number m(1m105) which represents the number of pipes.

    The next line contains p numbers v1,...,vp, where vi(1vi108) indicating the value of pond i.

    Each of the last m lines contain two numbers a and b, which indicates that pond a and pond b are connected by a pipe.
     
    Output
    For each test case, output the sum of the value of all connected components consisting of odd number of ponds after removing all the ponds connected with less than two pipes.
     
    Sample Input
    1
    7 7
    1 2 3 4 5 6 7
    1 4
    1 5
    4 5
    2 3
    2 6
    3 6
    2 7
     
    Sample Output
    21
     
    Source
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <map>
    #include <queue>
    using namespace std;
    int p, m;
    const int M = 100005;
    const int N = 10005;
    typedef long long ll;
    struct edge
    {
        int v, to;
        edge() { };
        edge(int v, int to): v(v), to(to) {};
    } e[M];
    
    int head[N], flag[N], val[N], in[N], vis[N], tot;
    queue<int> q;
    
    void init()
    {
        memset(head, -1, sizeof head);
        memset(flag, 0, sizeof flag);
        memset(vis, 0, sizeof vis);
        memset(in, 0, sizeof in);
        tot = 0;
        while(!q.empty()) q.pop();
    }
    
    void addedge(int u, int v)
    {
        e[tot] = edge(v, head[u]);
        head[u] = tot++;
    }
    
    void dfs(int u)
    {
        for(int i = head[u]; i != -1; i = e[i].to)
        {
            int v = e[i].v;
            if(in[v] == 0) continue;
            if(flag[v]) continue;
            in[v]--;
            in[u]--;
            if(in[v] == 1)
            {
                q.push(v);
                flag[v] = 1;
            }
        }
    }
    
    void pre()
    {
        for(int i = 1; i <= p; ++i)
        {
            if(in[i] == 1)
            {
                flag[i] = 1;
                q.push(i);
            }
        }
    
        while(!q.empty())
        {
            int f = q.front();
            q.pop();
            dfs(f);
        }
    }
    
    int cnt;
    ll sum;
    void calc(int u)
    {
        cnt++;
        vis[u] = 1;
        sum += val[u];
        for(int i = head[u]; i != -1; i = e[i].to)
        {
            int v = e[i].v;
            if(vis[v]) continue;
            if(flag[v]) continue;
    
            calc(v);
    
        }
    }
    
    int main()
    {
        int _;
        scanf("%d", &_);
        while(_ --)
        {
            scanf("%d%d", &p, &m);
            int u, v;
            for(int i = 1; i <= p; ++i) scanf("%d", &val[i]);
            init();
            for(int i = 0; i < m; ++i)
            {
                scanf("%d%d", &u, &v);
                in[u]++;
                in[v]++;
                addedge(u, v);
                addedge(v, u);
            }
            pre();
            ll ans = 0;
            for(int i = 1; i <= p; ++i) if(!flag[i] && !vis[i]) {
                    cnt = 0;
                    sum = 0;
                    calc(i);
                    if((cnt & 1) && cnt !=1)  ans += sum;
                }
            printf("%lld
    ", ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    mysql explain语句各项含义
    group_concat用法以及字符串太长显示不全
    合并两个word文档,保持样式不变
    读取word模板,填充数据后导出
    java获取配置文件信息
    mysql5.6免安装使用
    时间格式转换
    Mysql中(@i:=@i+1)的作用
    SVN服务器搭建和使用(一)
    按需讲解之Supervisor
  • 原文地址:https://www.cnblogs.com/orchidzjl/p/4805793.html
Copyright © 2011-2022 走看看