Ice Skating CodeForces - 217A

 

 题意：给定n个点，然后给每个点能去到的另外两个点，问最小加几条边能使全部点连起来

题解：直接dfs（1），然后每次重新dfsans就加一

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<cstring>
#include<vector>
#include<set>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define PII pair<int,int>
#define ll long long
#define ull unsigned long long
#define PLL pair<long long,long long>
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scl(a) scanf("%lld",&a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define ac cout<<ans<<endl
using namespace std;
ll ans=-1;
int a[100010],b[100010];
bool st[100010];int n;
void dfs(int u)
{
    st[u]=true;
    for(int i=1;i<=n;i++)
    {
        if(!st[i]){
            if(a[i]==a[u]||b[i]==b[u]){
                st[i]=true;
                dfs(i);
            }
        }
    }
}

void solve()
{

    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scdd(a[i],b[i]);
    }
    for(int i=1;i<=n;i++)
    {
        if(!st[i])
        {
            ans++;
            dfs(i);
        }
    }
    ac;

}
signed main()
{
    int t=1;
    //scd(t);
    while(t--) solve();
    return 0;
}