zoukankan      html  css  js  c++  java
  • Rikka with Graph(联通图取边,暴力)

    Rikka with Graph

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 190    Accepted Submission(s): 78

    Problem Description
    As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:
    Yuta has a non-direct graph with n vertices and n+1 edges. Rikka can choose some of the edges (at least one) and delete them from the graph.
    Yuta wants to know the number of the ways to choose the edges in order to make the remaining graph connected.
    It is too difficult for Rikka. Can you help her?
     
    Input
    The first line contains a number T(T30)——The number of the testcases.
    For each testcase, the first line contains a number n(n100).
    Then n+1 lines follow. Each line contains two numbers u,v , which means there is an edge between u and v.
     
    Output
    For each testcase, print a single number.
     
    Sample Input
    1 3 1 2 2 3 3 1 1 3
     
    Sample Output
    9
     

    题解:题目问的是去掉边使图仍然联通。很简单的一道图论题,我竟然用prime错了半天。。。最后还是改了krustra,让找有多少中取法,直接暴力取边

    代码:

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<cmath>
    #include<vector>
    using namespace std;
    const int INF=0x3f3f3f3f;
    #define mem(x,y) memset(x,y,sizeof(x))
    #define SI(x) scanf("%d",&x)
    #define PI(x) printf("%d",x)
    #define SD(x,y) scanf("%lf%lf",&x,&y)
    #define P_ printf(" ")
    typedef long long LL;
    const int MAXN=110;
    int pre[MAXN];
    int s[MAXN],e[MAXN];
    int N,ans;
    int find(int r){
        return pre[r]= pre[r]==r?r:find(pre[r]);
    }
    int check(int a,int b){
        for(int i=1;i<=N;i++)pre[i]=i;
        for(int i=0;i<=N;i++){
            if(i==a||i==b)continue;
            int f1=find(s[i]),f2=find(e[i]);
            //printf("%d %d
    ",f1,f2);
            if(f1!=f2)pre[f1]=f2;
        }
        int cnt=0;
        for(int i=1;i<=N;i++){
            if(pre[i]==i)cnt++;
        //    if(cnt>1)printf("%d
    ",cnt);
            if(cnt>1)return 0;
        }
        return 1;
    }
    int main(){
        int T;
        SI(T);
        while(T--){
            SI(N);
            for(int i=0;i<=N;i++)
                SI(s[i]),SI(e[i]);
                int ans=0;
            for(int i=0;i<=N;i++)
                for(int j=i;j<=N;j++){//相等代表的是取一条边。 
                    ans+=check(i,j);
                }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    Linux配置手记及软件FAQ-更新到Fedora core 3
    怎样给多维数组动态分配内存
    mysql管理密码修改及管理权限设定(zz)
    链表处理函数(自己总结)
    二级C笔试试题
    中央广播电视大学19992000学年度第二学期“开放教育(本科)期末考试计算机科学与技术专业数据结构试题
    关闭计算机就这几招
    交大ftp校内搜索引擎终于好了!好!!
    有趣的Baidu。终于发现点比Google好的地方了
    几组重要概念
  • 原文地址:https://www.cnblogs.com/handsomecui/p/5204388.html
Copyright © 2011-2022 走看看