Codeforces791 B. Bear and Friendship Condition
来源:互联网 发布:中国古代名言警句软件 编辑:程序博客网 时间:2024/06/04 18:16
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.
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.
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).
4 31 33 41 4
YES
4 43 12 33 41 2
NO
10 44 35 108 91 2
YES
3 21 22 3
NO
The drawings below show the situation in the first sample (on the left) and in the second sample (on the right). Each edge represents two members that are friends. The answer is "NO" in the second sample because members (2, 3) are friends and members (3, 4) are friends, while members (2, 4) are not.
——————————————————————————————————
题目的意思是给出n个点m条边,问每个点是否都落在一个完全图中
思路:先并查集处理出所有集合,在数学算出每个集合成为完全图所需的边总和和m比较
注意:题目会爆int
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <cmath>#include <algorithm>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int pre[200005];LL cnt[200005];void init(){ for(int i=0; i<200004; i++) pre[i]=i;}int fin(int x){ return pre[x]==x?x:pre[x]=fin(pre[x]);}int main(){ int n,m,x,y; scanf("%d%d",&n,&m); init(); for(int i=0; i<m; i++) { scanf("%d%d",&x,&y); int a=fin(x); int b=fin(y); if(a!=b) { pre[a]=b; } } memset(cnt,0,sizeof cnt); for(int i=1;i<=n;i++) { int x=fin(i); cnt[x]++; } LL ans=0; for(int i=1;i<=n;i++) { ans+=(cnt[i]*(cnt[i]-1)/2); } printf("%s\n",ans==1LL*m?"YES":"NO"); return 0;}
- Codeforces791 B. Bear and Friendship Condition
- codeforces 791B Bear and Friendship Condition
- Bear and Friendship Condition
- codeforces Bear and Friendship Condition
- Bear and Friendship Condition CodeForces
- Codeforces 791 B Bear and Friendship Condition 规律
- Codeforces Round #405 B.Bear and Friendship Condition【Dfs+思维】
- Codeforces Round #405 B.Bear and Friendship Condition
- CodeForces 791B Bear and Friendship Condition【并查集】
- (DFS, 图)Codeforces Round #405 B. Bear and Friendship Condition
- (codeforces)A. Bear and Friendship Condition
- Codeforces Round #405 B. Bear and Friendship Condition a-b,b-c a-c??
- Codeforces #406 (Div. 2) B. Bear and Friendship Condition(并查集
- Codeforces 771A Bear and Friendship Condition[并查集]
- Codeforces Round #405 Bear and Friendship Condition 并查集
- Codeforces791 C. Bear and Different Names
- B. Bear and Strings
- 573B - Bear and Blocks
- 优雅地乱玩Linux-1-系统
- git远程库
- getCurrentSession()与openSession()的区别
- logback的使用和logback.xml详解
- Retrofit--创建一个可扩展的客户端
- Codeforces791 B. Bear and Friendship Condition
- 使用jstl保留两位小数
- TOJ 3384.sun and moon [Chinese]
- 优雅地乱玩Linux-2-zsh
- 四轴加速度计滤波
- sed使用技巧之--删除行
- 51Nod 1055 最长等差数列问题
- 【原创】【组合数学】HDU 4248 A Famous Stone Collector
- 学会查看 RabbitMQ日志