cf1209D(div1+div2)

拦住我的好题(DSU)

题意:

• 给定n种零食, 现有m头奶牛, 每个奶牛都有唯一两种喜欢吃的零食
• 现在你使得这些奶牛按照某种序列来一个一个吃零食, 每头奶牛会在剩下的零食堆里面找自己喜欢的两种零食, 有几种就吃几种, 如果一种自己喜欢的都没有, 着头奶牛就会自杀, 现在, 求在最优排列下最少有多少头牛自杀

数据范围: $n\le 200000$

>> face <<

前置技能:并查集

Tutorial: 感觉是个匹配问题, 但是有不知道怎么处理多匹配的情况. 考虑建图, 把每头牛喜欢吃的两种口味连起来, 然后再以每头牛喜欢吃的两种口味为起点取dfs, 没找到一条边相当于是找到了一头牛, 第一头牛的情况是要特殊对待一下

/*
 *author:ZJX
 *version dfs
 *
 */
#include <bits/stdc++.h>

using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt(){
	int ret;
	scanf("%d", &ret);
	return ret;
}
const int maxn = 1e5 + 10;
struct node{
	int nxt, to;
}way[maxn*2];
int head[maxn], cnt;
void addedge(int from, int to){
	way[++cnt].to = to;
	way[cnt].nxt = head[from];
	head[from] = cnt;
}
bool vis[maxn];
int res;
void dfs(int cur){
	if(vis[cur])return ;
	res++;
	vis[cur] = 1;
	for(int i= head[cur];i;i=way[i].nxt){
		int to = way[i].to;
		dfs(to);
	}
}
signed main(){

	int n = nxt(), k = nxt();
	vector<pii> q;
	_rep(i, 1, k){
		int a = nxt(), b = nxt();
		addedge(a,b),addedge(b, a);
		q.push_back(make_pair(a, b));
	}
	for(auto i: q){
		if(!vis[i.first] && !vis[i.second])res--;
		dfs(i.first), dfs(i.second);
	}
	cout << k - res << endl;
}

真的没想到并查集也可以写

/**
 *author:ZJX
 *version:DSU
 **/
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<25>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 2e5 + 10;
int parent[maxn], n, k;
int nxt(){
	int ret;
	scanf("%d", &ret);
	return ret;
}
void pre_work(){
	_for(i, 1, maxn)parent[i] = i;
}
int find(int a){
	return a == parent[a] ? a : parent[a] = find(parent[a]);
}
void merge(int a, int b){
	parent[find(a)] = find(b);
}
signed main(){
	int n = nxt(), k = nxt();
	int res = 0;
	pre_work();
	_rep(i, 1, k){
		int a = nxt(), b = nxt();
		if(find(a) != find(b)){
			merge(a, b);
			res++;
		}
	}
	cout << k - res << endl;
}