并查集与最小生成树练习题
前导知识
:
1. 亲戚
#include <iostream>
using namespace std;
const int MAX_N = 5005;
int n,m,q;
int fa[MAX_N<<1];
int find(int x){
if(fa[x]!=x) fa[x]=find(fa[x]);
return fa[x];
}
void unionSet(int x,int y){
fa[find(y)]=find(x);
}
int main(){
cin>>n>>m>>q;
/* 初始化 */
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<=m;i++){
int a,b;
cin>>a>>b;
unionSet(a,b);
}
for(int i=1;i<=q;i++){
int c,d;
cin>>c>>d;
if(find(c)==find(d)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
2. 集合
#include <iostream>
using namespace std;
const int MAX_N = 100000+10;
int a,b,p;
int primes[MAX_N],cnt,ans;
bool notPrimes[MAX_N];
int fa[MAX_N];
int find(int x){
if(x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
void unionSet(int x,int y){
int xx=find(x),yy=find(y);
if(xx==yy) return; /* 原本属于一个集合 */
--ans;
fa[xx]=yy;
}
int main(){
std::ios::sync_with_stdio(false);
cin>>a>>b>>p;
for(int i=1;i<=b;i++) fa[i]=i;
for(int i=2;i<=b;i++){
if(!notPrimes[i]) primes[++cnt]=i;
for(int j=1;j<=cnt&&primes[j]*i<=b;++j){
notPrimes[primes[j]*i]=true;
if(i%primes[j]==0) break;
}
}
ans=b-a+1;
for(int i=1;i<=cnt;++i){
if(primes[i]<p) continue;
int np=(a+primes[i]-1)/primes[i]*primes[i];
for(int j=np+primes[i];j<=b;j+=primes[i]) unionSet(np,j);
}
cout<<ans<<endl;
return 0;
}
3. 【模板】最小生成树
prim
算法模板:
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX_M=200005;
const int MAX_N=5005;
const int inf=123456789;
struct node{
int v,w,next;
}e[MAX_M<<1];
int head[MAX_N],dis[MAX_N],cnt,n,m,tot,now=1,ans;
bool vis[MAX_N];
int u,v,w;
/* 建边 */
void add_edge(int u,int v,int w){
e[++cnt].v=v;
e[cnt].w=w;
e[cnt].next=head[u];
head[u]=cnt;
}
int prim(){
for(int i=2;i<=n;i++) dis[i]=inf;
for(int i=head[1];i;i=e[i].next) dis[e[i].v]=min(dis[e[i].v],e[i].w);
while(++tot<n){
int min_n=inf;
vis[now]=true;
for(int i=1;i<=n;i++){
if(!vis[i]&&min_n>dis[i]){
min_n=dis[i];
now=i;
}
}
ans+=min_n;
for(int i=head[now];i;i=e[i].next){
int v=e[i].v;
if(dis[v]>e[i].w&&!vis[v]) dis[v]=e[i].w;
}
}
return ans;
}
int main(){
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>u>>v>>w;
add_edge(u,v,w),add_edge(v,u,w);
}
cout<<prim();
return 0;
}
prim
堆优化:
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX_N=5005;
const int MAX_M=200005;
int k,n,m;
int cnt,sum,head[MAX_N],dis[MAX_N],vis[MAX_N];
int u,v,w;
struct node
{
int v,w,next;
}e[MAX_M<<1];
void add_edge(int u,int v,int w)
{
e[++k].v=v;
e[k].w=w;
e[k].next=head[u];
head[u]=k;
}
typedef pair <int,int> pii;
priority_queue <pii,vector<pii>,greater<pii> > q; /* 小根堆 */
void prim()
{
dis[1]=0;
q.push(make_pair(0,1));
while(!q.empty()&&cnt<n)
{
int d=q.top().first,u=q.top().second;
q.pop();
if(vis[u]) continue;
cnt++;
sum+=d;
vis[u]=1;
for(int i=head[u];i;i=e[i].next)
if(e[i].w<dis[e[i].v])
dis[e[i].v]=e[i].w,q.push(make_pair(dis[e[i].v],e[i].v));
}
}
int main()
{
memset(dis,127,sizeof(dis));
memset(head,0,sizeof(head));
scanf("%d %d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&u,&v,&w);
add_edge(u,v,w);
add_edge(v,u,w);
}
prim();
if (cnt==n)printf("%d",sum);
else printf("orz");
}
Kruskal算法
:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_N=5005;
const int MAX_M=2000005;
int n,m,tot;
int f[MAX_M>>1];
struct node{
int u,v,w;
}e[MAX_M];
int ans;
int find(int x){
if(x!=f[x]) f[x]=find(f[x]);
return f[x];
}
bool cmp(node a,node b){
return a.w<b.w;
}
void kruskal(){
for(int i=1;i<=m;i++){
int u=find(e[i].u);
int v=find(e[i].v);
if(u==v) continue; /* 如果两个在同一个集合了,就等待下一个循环 */
ans+=e[i].w;
f[u]=v; /* 连接两个集合 */
tot++;
if(tot==n-1) break;
}
}
int main(){
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=n;i++){
f[i]=i;
}
for(int i=1;i<=m;i++) cin>>e[i].u>>e[i].v>>e[i].w;
sort(e+1,e+m+1,cmp);
kruskal();
if(tot==n-1){
cout<<ans;
}else
cout<<"orz";
return 0;
}
4. 村村通
#include <iostream>
using namespace std;
const int MAX_N=1e6+5;
int fa[MAX_N],n,m,x,y;
int find(int x){
if(x!=fa[x])
fa[x]=find(fa[x]);
return fa[x];
}
void unionSet(int x,int y){
fa[find(x)]=find(y);
}
int main(){
ios::sync_with_stdio(false);
while(true){
int ans=0;
scanf("%d%d",&n,&m);
if(n==0) return 0;
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<=m;i++){
scanf("%d %d",&x,&y);
unionSet(x,y);
}
for(int i=1;i<=n;i++){
if(find(i)==i){
ans++;
}
}
printf("%d\n",ans-1);
}
return 0;
}
5. 部落划分
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
struct node{
int u,v;
double w;
friend bool operator<(const node &x,const node &y){
return x.w<y.w;
}
}e[1000005];
int n,k,fa[1005],tot;
double nx[1005],ny[1005],ans,sum;
bool flag=0;
int find(int x){
if(x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
bool unionSet(int x,int y){
int xx=find(x);
int yy=find(y);
if(xx!=yy){
sum++;
fa[xx]=yy;
return true;
}
return false;
}
double cal(double x1,double y1,double x2,double y2){
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
void kruskal(){
for(int i=1;i<=tot;i++){
if(sum==n-k) flag=1;
if(unionSet(e[i].u,e[i].v)&&flag){
ans=e[i].w;
return;
}
}
}
int main(){
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++){
scanf("%lf %lf",&nx[i],&ny[i]);
}
for(int i=1;i<=n;i++){
fa[i]=i;
for(int j=1;j<i;j++){
e[++tot].u=i;
e[tot].v=j;
e[tot].w=cal(nx[i],ny[i],nx[j],ny[j]);
}
}
sort(e+1,e+tot+1);
kruskal();
printf("%.2lf\n",ans);
return 0;
}
6. 团伙
#include <iostream>
using namespace std;
const int MAX_N = 1005;
int n,m,a,b,fa[MAX_N<<1],ans;
char ch;
int find(int x){
if(x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
void unionSet(int x,int y){
int xx=find(x);
int yy=find(y);
fa[xx]=yy;
}
int main(){
cin>>n>>m;
for(int i=1;i<=2*n;i++){
fa[i]=i;
}
for(int i=1;i<=m;i++){
cin>>ch>>a>>b;
if(ch=='F') unionSet(a,b);
else{
unionSet(a+n,b);
unionSet(b+n,a);
}
}
for(int i=1;i<=n;i++){
if(fa[i]==i){
ans++;
}
}
cout<<ans;
return 0;
}
7. 关押罪犯
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX_N=100005;
int n,m;
struct node{
int u,v,w;
friend bool operator<(const node &x,const node &y){
return x.w>y.w;
}
}f[MAX_N];
int fa[MAX_N<<1],enemy[MAX_N<<1];
int find(int x){
if(x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
void unionSet(int x,int y){
int xx=find(x);
int yy=find(y);
fa[xx]=yy;
}
bool check(int x,int y){
if(find(x)==find(y)) return true;
return false;
}
int main(){
cin.tie(0),cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=1;i<=m;i++) cin>>f[i].u>>f[i].v>>f[i].w;
sort(f+1,f+m+1);
for(int i=1;i<=m+1;i++){
if(check(f[i].u,f[i].v)){
cout<<f[i].w;break;
}else{
if(!enemy[f[i].u]) enemy[f[i].u]=f[i].v;
else unionSet(enemy[f[i].u],f[i].v);
if(!enemy[f[i].v]) enemy[f[i].v]=f[i].u;
else unionSet(enemy[f[i].v],f[i].u);
}
}
return 0;
}
8. [NOI2001] 食物链
#include <iostream>
using namespace std;
inline int read() {
char c = getchar(); int n = 0;
while (c < '0' || c > '9') { c = getchar(); }
while (c >= '0' && c <= '9') { n = (n << 1) + (n << 3) + (c & 15); c = getchar(); }
return n;
}
const int MAX_N=100005;
int n,m,ans,fa[MAX_N*3];
int find(int x){
if(x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
void unionSet(int x,int y){
int xx=find(x);
int yy=find(y);
if(xx==yy) return;
fa[xx]=yy;
}
int main(){
n=read();m=read();
for(int i=1;i<=n*3;i++) fa[i]=i;
while(m--){
int opt=read(),u=read(),v=read();
if(u>n||v>n){
ans++;
continue;
}
if(opt==1){
if(find(u+n)==find(v)||find(u)==find(v+n)) ans++;
else unionSet(u,v),unionSet(u+n,v+n),unionSet(u+n+n,v+n+n);
}else{
if(find(u)==find(v)||find(u)==find(v+n)) ans++;
else unionSet(u+n,v),unionSet(u+n+n,v+n),unionSet(u,v+n+n);
}
}
printf("%d\n",ans);
return 0;
}