并查集:Forming Teams(CF#133)
来源:互联网 发布:java审批流 编辑:程序博客网 时间:2024/06/04 18:44
One day n students come to the stadium. They want to play football, and for that they need to split into teams, the teams must have an equal number of people.
We know that this group of people has archenemies. Each student has at most two archenemies. Besides, if studentA is an archenemy to student B, then student B is an archenemy to studentA.
The students want to split so as no two archenemies were in one team. If splitting in the required manner is impossible, some students will have to sit on the bench.
Determine the minimum number of students you will have to send to the bench in order to form the two teams in the described manner and begin the game at last.
The first line contains two integers n andm (2 ≤ n ≤ 100,1 ≤ m ≤ 100) — the number of students and the number of pairs of archenemies correspondingly.
Next m lines describe enmity between students. Each enmity is described as two numbersai andbi (1 ≤ ai, bi ≤ n,ai ≠ bi) — the indexes of the students who are enemies to each other. Each enmity occurs in the list exactly once. It is guaranteed that each student has no more than two archenemies.
You can consider the students indexed in some manner with distinct integers from 1 ton.
Print a single integer — the minimum number of students you will have to send to the bench in order to start the game.
5 41 22 45 31 4
1
6 21 43 4
0
6 61 22 33 14 55 66 4
2出现奇数环的时候踢一个人
#include <iostream>#include <cstdio>using namespace std;int sum[110], pa[110];int n;void init(){ for(int i = 1; i <= n; i ++){ sum[i] = 1; pa[i] = i; }}int find(int i){ if(pa[i] == i) return i; else return find(pa[i]);}int main(){ int m; int i, j, k; int ans; cin >> n >> m; ans = n; init(); for(i = 0; i < m; i ++){ int a, b; cin >> a >> b; a = find(a); b = find(b); if(a != b){ pa[a] = b; sum[b] += sum[a]; } else{ if(sum[a] % 2) ans --; } } if(ans % 2) ans --; cout << n - ans << endl; return 0;}
- 并查集:Forming Teams(CF#133)
- CF216B: Forming Teams(并查集)
- GUETOJ - 1101 Forming Teams(并查集2)
- Codeforces Round #133 (Div. 2) B. Forming Teams(并查集)
- CF Forming Teams
- CodeForces 216B Forming Teams(并查集判断奇数环)
- cf div2_123_e(并查集)
- CF Japan 并查集
- 10911 - Forming Quiz Teams
- 10911 - Forming Quiz Teams
- UVA10911- Forming Quiz Teams
- uva10911 Forming Quiz Teams
- scau_10317 Fans of Footbal Teams(并查集)
- 【打CF,学算法——三星级】CodeForces 216B Forming Teams (图论)
- uva 10911 Forming Quiz Teams
- UVA 10911 Forming Quiz Teams
- uva 10911 Forming Quiz Teams
- UVa 10911 - Forming Quiz Teams
- maven 配置
- window.location.hash属性介绍
- WordPress 编辑器修改
- 小议动态规划
- python列表操作
- 并查集:Forming Teams(CF#133)
- opcagt-administer agent on Managed Node
- 剖析Windows任务管理器开发原理与实现
- struts2的default.properties详解
- Linux中的共享内存
- 冒泡排序(Bubble Sort)
- java 异常处理(二)
- js获取元素div相对body的距离
- H.264 学习笔记(二)