Submission #3455

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
3455	2013-08-31T05:53:20 Z	pichulia	Jogging (kriii1_J)	C++	0 / 1	152 ms	4436 KB

J

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>

using namespace::std;

#define M 100000005
double PI;

struct P{
	double x, y;

	double radis;
}a[100005];
int n, m;
double b[100005];
bool compare(P p, P q)
{
	return p.radis > q.radis;
}
void input()
{
	PI = acos(0.0)*2;
	int i, j;
	scanf("%d %d",&n,&m);
	for(i=0; i<n; i++)
	{
		scanf("%lf %lf",&a[i].x,&a[i].y);
		a[i].radis = atan2(a[i].y, a[i].x + M);
	}
	for(i=0; i<m; i++)
		scanf("%lf",&b[i]);
	sort(a,a+n,compare);
}

void process()
{
	int i, j=0;
	double k;
	for(i=0; i<m; i++)
	{
		k=0;
		for(; j<n; j++)
		{
			k = atan2(a[j].y,a[j].x - b[i]);
			if(k<PI/2)
				break;
		}
		printf("%.7lf\n",k);
	}
}

void output()
{
}

int main()
{
	input();
	process();
	output();
	return 0;
}

Subtask #1

0.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	152 ms	4436 KB	Output isn't correct
2	Halted	0 ms	0 KB	-