2236 模板并查集

最新推荐文章于 2022-10-12 00:39:00 发布

PeterBishop0

最新推荐文章于 2022-10-12 00:39:00 发布

阅读量258

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/qq_40061421/article/details/87308754

版权

POJ 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

题目很简单，但是弄这个输入有点麻烦，手生了

/* ***********************************************
Author        :PeterBishop
Created Time  :Thu 14 Feb 2019 16:44:13 CST
File Name     :t.cpp
Origin        :P O J  2236
************************************************ */

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
int N,d;
struct Node
{
	int x,y;
	bool work;
	int next;
}Coms[1002];
int find(int x){
	return x==Coms[x].next?x:find(Coms[x].next);
}
void Union(Node a,Node b){
	int r1=find(a.next);
	int r2=find(b.next);
	if(r1!=r2){
		if((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)<=d*d)
			Coms[r2].next=r1;
	}
}
int main()
{
	freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	cin>>N>>d;
	for(int i=1;i<=N;i++){
		cin>>Coms[i].x>>Coms[i].y;
		Coms[i].work=false;
		Coms[i].next=i;
	}
	char s;
	while(scanf("\n%c", &s) != EOF){
		if(s=='O')
		{
			int x;
			scanf("%d",&x);
			Coms[x].work=true;
			for(int i=1;i<=N;i++){
				if(i!=x&&Coms[i].work){
					Union(Coms[x],Coms[i]);
				}
			}
		}
		else{
			int from,to;
			scanf("%d%d",&from,&to);
			if(find(from) == find(to))
				printf("SUCCESS\n");
			else
				printf("FAIL\n");

		}

	}




    return 0;
}