zoukankan      html  css  js  c++  java
  • CF思维联系--CodeForces

    题目地址:24道CF的DIv2 CD题有兴趣可以做一下。
    ACM思维题训练集合
    Bajtek is learning to skate on ice. He’s a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it’s impossible to get from some snow drifts to some other by any sequence of moves. He now wants to heap up some additional snow drifts, so that he can get from any snow drift to any other one. He asked you to find the minimal number of snow drifts that need to be created.

    We assume that Bajtek can only heap up snow drifts at integer coordinates.

    Input
    The first line of input contains a single integer n (1 ≤ n ≤ 100) — the number of snow drifts. Each of the following n lines contains two integers xi and yi (1 ≤ xi, yi ≤ 1000) — the coordinates of the i-th snow drift.

    Note that the north direction coinсides with the direction of Oy axis, so the east direction coinсides with the direction of the Ox axis. All snow drift’s locations are distinct.

    Output
    Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one.

    Examples
    Input
    2
    2 1
    1 2
    Output
    1
    Input
    2
    2 1
    4 1
    Output
    0

    这道题做过但是不记得当时怎么做的了,每次做都有新的感受。

    并查集,一般的并查集不太行,如图因为
    代码

    #include <bits/stdc++.h>
    using namespace std;
    int fa[105];
    int  find(int n)
    {
        if(fa[n]==n) return n;
        else return fa[n]=find(fa[n]);
    }
    struct Node{
        int x,y;
    }node[105];
    bool check(Node a,Node b)
    {
        if(a.x==b.x) return 1;
        else if(a.y==b.y)return 1;
        else return 0;
    }
    set<int> cnt;
    int main()
    {
        int n;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            fa[i]=i;
            cin>>node[i].x>>node[i].y;
            for(int j=0;j<i;j++)
            {
                if(check(node[i],node[j])){
                  
                    fa[find(j)]=find(i);
                   // cout<<fa[j]<<endl;
                }
            }
        }
        for(int i=0;i<n;i++)
        {
            //cout<<find(fa[i])<<endl;
            cnt.insert(find(i));
        }
        cout<<cnt.size()-1<<endl;
    }
    
  • 相关阅读:
    PHP 计算程序运行的时间
    PHP 简易版生成随机码
    PHP读取FLASH 文件信息
    MongoDB基本使用
    PHP实现QQ达人信息抓取
    bjtuOJ 1188 素数筛选
    bjtuOJ 1139 Longest Common Subsequence
    BJTU1113扫雷问题
    C#线程池的使用详解
    C#域名解析的简单制作
  • 原文地址:https://www.cnblogs.com/lunatic-talent/p/12798432.html
Copyright © 2011-2022 走看看