zoukankan      html  css  js  c++  java
  • ZOJ 3708 Density of Power Network (水题)

    Density of Power Network


    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In real world, the power system may contains hundreds of buses and thousands of transmission lines.

    Network topology analysis had long been a hot topic in the research of power system. And network density is one key index representing the robustness of power system. And you are asked to implement a procedure to calculate the network density of power system.

    The network density is defined as the ratio between number of transmission lines and the number of buses. Please note that if two or more transmission lines connecting the same pair of buses, only one would be counted in the topology analysis.

    Input

    The first line contains a single integer T (T ≤ 1000), indicating there are T cases in total.

    Each case begins with two integers N and M (2 ≤ NM ≤ 500) in the first line, representing the number of buses and the number of transmission lines in the power system. Each Bus would be numbered from 1 to N.

    The second line contains the list of start bus number of the transmission lines, separated by spaces.

    The third line contains the list of corresponding end bus number of the transmission lines, separated by spaces. The end bus number of the transmission lines would not be the same as the start bus number.

    Output

    Output the network density of the power system in a single line, as defined in above. The answer should round to 3 digits after decimal point.

    Sample Input

    3
    3 2
    1 2
    2 3
    2 2
    1 2
    2 1
    14 20
    2 5 3 4 5 4 5 7 9 6 11 12 13 8 9 10 14 11 13 13
    1 1 2 2 2 3 4 4 4 5 6 6 6 7 7 9 9 10 12 14
    

    Sample Output

    0.667
    0.500
    1.429
    

    Author: WANG, Yelei
    Contest: The 10th Zhejiang Provincial Collegiate Programming Contest

    找两点的连成的线段的数目与点的比,1->2   2->1视为同一条线段

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<stdlib.h>
     4 #include<algorithm>
     5 using namespace std;
     6 const int MAXN=1000;
     7 int s[MAXN][MAXN],star[MAXN],en[MAXN];
     8 int main()
     9 {
    10     //freopen("in.txt","r",stdin);
    11     int kase,n,m;
    12     scanf("%d",&kase);
    13     while(kase--)
    14     {
    15         memset(s,0,sizeof(s));
    16         scanf("%d %d",&n,&m);
    17         for(int i=0;i<m;i++)
    18             scanf("%d",&star[i]);
    19         for(int i=0;i<m;i++)
    20             scanf("%d",&en[i]);
    21         double cnt=0;
    22         for(int i=0;i<m;i++)
    23         {
    24             if(!s[star[i]][en[i]])
    25                 cnt++;
    26             s[star[i]][en[i]]=s[en[i]][star[i]]=1;
    27         }
    28         printf("%.3lf
    ",(double)cnt/n);
    29     }
    30     return 0;
    31 }
    View Code
  • 相关阅读:
    使用容器出现vector subscript out of range等类似错误
    string类库中的find和rfind函数
    Codeforces Round #181 (Div. 2)
    有关C++ int long最大表示长度问题
    js之京东商城分类导航效果
    JS之轮播图自动切换效果
    js之网页倒计时效果
    Js获取当前日期时间及其它操作
    js判断浏览器之事件绑定
    js之ajax实例
  • 原文地址:https://www.cnblogs.com/clliff/p/3920145.html
Copyright © 2011-2022 走看看