NYOJ 710 外星人的供给站

外星人的供给站

AC

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
struct radar
{
       double left,right;
}a[1005];
bool comp(radar a1,radar a2)
{
     return a1.left<a2.left;
}
int main()
{
    int n,r,x,y,count,t,i;
    double p,len;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&r);
        for(i=0;i<n;i++)
		{
			scanf("%d%d",&x,&y);
			len=sqrt((double)r*r-(double)y*y);
			a[i].left=x-len;
			a[i].right=x+len;
		}
		sort(a,a+n,comp);
		p=a[0].right;
		count=1;
		for(i=1;i<n;i++)
		{
			if(a[i].left>p)
			{
				count++;
				p=a[i].right;
			}
			else 
			{
				if(a[i].right<p)
				p=a[i].right;
			}
		}
		printf("%d\n",count);
	}
	return 0;
}

//runtimeerror

import java.util.LinkedList;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int N = input.nextInt();
		while(N-->0){
			int n=input.nextInt();
			int r=input.nextInt();
			LinkedList<XXX> list=new LinkedList<XXX>();
			XXX xx;
			for(int i=0;i<n;i++){
				int x=input.nextInt();
				int y=input.nextInt();
				double c=Math.sqrt(r*r*2)/2;
				xx=new XXX(x-c,x+c);
				list.add(xx);
			}
			//int s=list.size();
			for(int i=0;i<list.size();i++){
				
				for(int j=i+1;j<list.size();j++){
					XXX aa=list.get(i);
					XXX bb=list.get(j);
					if(aa.a<=bb.b&&aa.b>=bb.b){
						aa.b=bb.b;
						list.remove(i);
						list.add(i, aa);
						list.remove(j);
						//--s;
						continue;
					}
					if(aa.a<=bb.a&&aa.b>=bb.a){
						aa.a=bb.a;
						list.remove(i);
						list.add(i, aa);
						list.remove(j);
						//--s;
						continue;
					}
					if(aa.a<=bb.a&&aa.b>=bb.b){
						aa.b=bb.b;
						aa.a=bb.a;
						list.remove(i);
						list.add(i, aa);
						list.remove(j);
						//--s;
						continue;
					}
					if(aa.a>=bb.a&&aa.b<=bb.b){
						list.remove(j);
						//--s;
					}
				}
			}
			System.out.println(list.size());
		}
	}
}
class XXX{
	double a;
	double b;
	XXX(double a,double b){
		this.a=a;
		this.b=b;
	}
	XXX(){
	}
}

//运行时间错误


import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		int N = input.nextInt();
		while(N-->0){
				int n=input.nextInt();
				int r=input.nextInt();
				XXX xx[]=new XXX[n];
				for(int i=0;i<n;i++){
					int x=input.nextInt();
					int y=input.nextInt();
					double c=Math.sqrt(r*r-y*y);
					xx[i]=new XXX(x-c,x+c);
				}
				for(int i=0;i<n;i++){
					for(int j=i+1;j<n;j++){
						if(xx[i].a>xx[j].a){
							XXX c=xx[i];
							xx[i]=xx[j];
							xx[j]=c;
						}
					}
				}
				double p=xx[0].b;
				int e=1;
				for(int i=1;i<n;i++){
					if(xx[i].a>p){
						e++;
						p=xx[i].b;
					}
					else if(xx[i].b<p)
						p=xx[i].b;
				}
				System.out.println(e);
		}
	}
}
class XXX{
	double a;
	double b;
	XXX(double a,double b){
		this.a=a;
		this.b=b;
	}
	XXX(){
	}
}