zoukankan      html  css  js  c++  java
  • Bear and Friendship Condition-HZUN寒假集训

    Bear and Friendship Condition


    time limit per test 1 second
    memory limit per test 256 megabytes
    input standard input
    output standard output


    Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).

    There are n members, numbered 1 through n. m pairs of members are friends. Of course, a member can't be a friend with themselves.

    Let A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then also X-Z.

    For example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.

    Can you help Limak and check if the network is reasonable? Print "YES" or "NO" accordingly, without the quotes.

    Input
    The first line of the input contain two integers n and m (3 ≤ n ≤ 150 000, ) — the number of members and the number of pairs of members that are friends.

    The i-th of the next m lines contains two distinct integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi). Members ai and bi are friends with each other. No pair of members will appear more than once in the input.

    Output
    If the given network is reasonable, print "YES" in a single line (without the quotes). Otherwise, print "NO" in a single line (without the quotes).

    Examples

    input
    4 3
    1 3
    3 4
    1 4

    output
    YES

    input
    4 4
    3 1
    2 3
    3 4
    1 2

    output
    NO

    input
    10 4
    4 3
    5 10
    8 9
    1 2

    output
    YES

    input
    3 2
    1 2
    2 3

    output
    NO

     1 #include<iostream>
     2 #include<cstdlib>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<algorithm>
     7 #include<vector>
     8 using namespace std;
     9 #define LL long long  
    10 int pre[151000];  
    11 int Find(int x){  
    12     return x==pre[x]?x:pre[x]=Find(pre[x]);
    13 }  
    14 void mix(int x,int y){  
    15     int xx=Find(x),yy=Find(y);  
    16     if(xx!=yy){  
    17         pre[xx]=yy;  
    18     }  
    19 }  
    20 LL t[151000];  
    21 int main(){  
    22     int n,m;  
    23     scanf("%d%d",&n,&m);  
    24     for(int i=1;i<=n;i++){  
    25         pre[i]=i;  
    26     }  
    27     for(int i=0;i<m;i++){  
    28         int x,y;  
    29         scanf("%d%d",&x,&y);  
    30         mix(x,y);  
    31     }  
    32     for(int i=1;i<=n;i++){  
    33         t[Find(i)]++;  
    34     }  
    35     LL sum=0;  
    36     for(int i=1;i<=n;i++){  
    37         if(t[i]!=0&&t[i]!=1){  
    38             sum+=(t[i]*(t[i]-1)/2);  
    39         }  
    40     }  
    41     if(sum!=m){  
    42         printf("NO
    ");  
    43     }  
    44     else{  
    45         printf("YES
    ");  
    46     }  
    47     return 0;  
    48 }  
  • 相关阅读:
    Codeforces Round #499 (Div. 2) C.FLY 数学推导_逆推
    Codeforces div2 #499 B. Planning The Expedition 大水题
    Lost Cows POJ
    洛谷P2915 [USACO08NOV]奶牛混合起来Mixed Up Cows 状压动归
    2018.9.30 ~ 2018.11.1 做题记录
    推荐一款强大的轻量级模块化WEB前端快速开发框架--UIkit
    jQuery Validate多实例讲解
    关于Css的垂直居中的一些方法
    关于浮动与清除浮动,你应该知道的
    使用 Vuex + Vue.js 构建单页应用
  • 原文地址:https://www.cnblogs.com/Tangent-1231/p/8477205.html
Copyright © 2011-2022 走看看