21天零基础入门ACM
21天零基础入门ACM之 第13天
并查集
例题1:https://ac.nowcoder.com/acm/problem/20793
代码:
#include <bits/stdc++.h>
using namespace std;
#define js ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
typedef long long ll; typedef unsigned long long ull; typedef long double ld;
inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll qpow(ll a, ll b) { ll ans = 1; while (b) { if (b & 1) ans *= a; b >>= 1; a *= a; } return ans; }
ll qpow(ll a, ll b, ll mod) { ll ans = 1; while (b) { if (b & 1)(ans *= a) %= mod; b >>= 1; (a *= a) %= mod; }return ans % mod; }
const int mod=1e9+7;
const int N=1e4+7;
int p[N];
int find(int n){
if(p[n]==n) return n;
else p[n]=find(p[n]); return p[n];
}
void init(int n){
for(int i=1;i<=n;i++)
p[i]=i;
}
bool solve(){
int n,m,a,b;
cin>>n>>m;
init(n);
while(m--){
cin>>a>>b;
int x=find(a);
int y=find(b);
p[x]=y;
}
map<int,int> s;
for(int i=1;i<=n;i++){
int t=find(p[i]);
s[t]++;
if(s[t]==3){
return false;
}
}
//for(int i=1;i<=n;i++) cout<<p[i]<<endl;
return true;
}
int main(){
if(solve()) cout<<"Nice"<<endl;
else cout<<"Error"<<endl;
}
例题2:
https://ac.nowcoder.com/acm/problem/15808
代码:
#include <bits/stdc++.h>
using namespace std;
const int MAX=1e5+7;
typedef struct
{
int x,y;
}str;
str a[MAX];
int p[MAX];
int find(int x)
{
if(p[x]==x)
return p[x];
else
p[x]=find(p[x]);
return p[x];
}
void join(int i,int j)
{
int x=find(i);
int y=find(j);
if(x==y) return;
else
p[x]=y;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
p[i]=i;
}
for(int i=1;i<=n;i++)
cin>>a[i].x>>a[i].y;
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
{
if(a[i].x==a[j].x||a[i].y==a[j].y)
join(i,j);
}
int ans=0;
for(int i=1;i<=n;i++)
if(p[i]==i)
ans++;
cout<<ans-1<<endl;
return 0;
}
例题3:https://ac.nowcoder.com/acm/problem/14685
代码:
#include <bits/stdc++.h>
using namespace std;
const int MAX=1e5+7;
int a[MAX];
void init(int n)
{
for(int i=1;i<=n;i++)
a[i]=i;
}
int find(int n)
{
if(a[n]==n)
return n;
else a[n]=find(a[n]);
return a[n];
}
void merge(int n,int m)
{
int x=find(n);
int y=find(m);
if(x==y) return;
else
{
a[x]=y;
}
}
int main()
{
int n,m;
while(cin>>n>>m)
{
memset(a,0,sizeof(a));
init(n);
while(m--)
{
int a,b;
cin>>a>>b;
merge(a,b);
}
int ans=0;
for(int i=1;i<=n;i++)
{
if(a[i]==i)
ans++;
}
cout<<ans-1<<endl;
}
return 0;
}
例题4:
思路:
这道题仅仅用并查集还不够,还要背包dp 求最优解
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e4+7;
int fa[maxn];
int wight[maxn],value[maxn];
int dp[maxn][505];
void init(int n)
{
for(int i=1;i<=n;i++)
fa[i]=i;
}
int find(int x)
{
if(x==fa[x]) return fa[x];
else
fa[x]=find(fa[x]);
return fa[x];
}
void join(int x,int y)
{
int a=find(x);
int b=find(y);
if(a!=b)
fa[b]=a;
}
int main()
{
int T;
cin>>T;
while(T--)
{
memset(dp,0,sizeof(dp));
int n,m,k;
cin>>n>>m>>k;
for(int i=2;i<=n;i++)
cin>>wight[i]>>value[i];
init(n);
while(m--)
{
int x,y;
cin>>x>>y;
join(x,y);
}
//cout<<fa[1]<<endl;
int w[maxn],v[maxn];
int s=1;
for(int i=2;i<=n;i++)
{
if(find(i)==find(1))
{
w[s]=wight[i];
v[s]=value[i];
s++;
}
}
for(int i=1;i<s;i++)
for(int j=0;j<=k;j++)
{
if(w[i]>j)
dp[i][j]=dp[i-1][j];
else
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i]);
}
cout<<dp[s-1][k]<<endl;
}
return 0;
}