Codeforces #406 (Div. 2) B. Bear and Friendship Condition(并查集
来源:互联网 发布:人工智能 书籍 编辑:程序博客网 时间:2024/05/19 23:17
B. Bear and Friendship Condition
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 3
1 3
3 4
1 4
YES
4 4
3 1
2 3
3 4
1 2
NO
10 4
4 3
5 10
8 9
1 2
YES
3 2
1 2
2 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.
并查集求联通分量,节点与边数的关系(还是蛮麻烦的2333
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define LL long long#define N 150000+100int par[N];LL num[N], arr[N];void init(int n){ for(int i = 1;i <= n; i++) { par[i] = i; num[i] = 1; arr[i] = 0; }}int find(int x){ if(x == par[x]) return x; else return par[x]=find(par[x]);}int main(){ int n, m; scanf("%d%d",&n,&m); init(n); int x, y; for (int i = 0; i < m; i++){ scanf("%d%d", &x, &y); if (find(x) == find(y)){ arr[par[x]]++; } else{ num[par[y]] += num[par[x]]; arr[par[y]] += arr[par[x]] + 1; par[par[x]] = par[y]; } } LL sum ; bool flag = true; for(int i = 1;i <= n; i++) { if(find(i) == i) { sum = num[i] * (num[i] - 1) / 2;; if(arr[i] != sum) { flag = false; break; } } } if(flag) puts("YES"); else puts("NO");return 0;}
- Codeforces #406 (Div. 2) B. Bear and Friendship Condition(并查集
- CodeForces 791B Bear and Friendship Condition【并查集】
- Codeforces 771A Bear and Friendship Condition[并查集]
- Codeforces Round #405 Bear and Friendship Condition 并查集
- codeforces 791B 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
- (DFS, 图)Codeforces Round #405 B. Bear and Friendship Condition
- (codeforces)A. Bear and Friendship Condition
- Codeforces791 B. Bear and Friendship Condition
- Bear and Friendship Condition
- Codeforces Round #405 B. Bear and Friendship Condition a-b,b-c a-c??
- Codeforces Round #226 (Div. 2) B. Bear and Strings
- Codeforces Round #226 (Div. 2)B. Bear and Strings
- Codeforces Round #226 (Div. 2)B. Bear and Strings
- 机器学习笔记(十)EM算法及实践(以混合高斯模型(GMM)为例来次完整的EM)
- Still unable to dial persistent://blog.csdn.net:80 after 3 attempts
- linux执行sh脚本报错的解决办法
- Maven学习笔记(二)
- 100亿数据平滑数据迁移,不影响服务
- Codeforces #406 (Div. 2) B. Bear and Friendship Condition(并查集
- push、pop及函数调用约定
- 编程之美 给定一个整数N,那么N的阶乘N!末尾有多少个0?
- eclipse + pydev 导入的工程 代码不能追踪的问题
- C#读取MDB数据
- IEnumerable与IEnumerator在C#中的使用
- java中怎么快速找到接口或者父类的实现和子类
- 游戏开发进度追踪
- 新技能 get —— Python 断点续传下载文件