Submission #3767

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
3767	2013-08-31T08:14:34 Z	joonas	Jogging (kriii1_J)	C++	0 / 1	0 ms	16384 KB

J

#include <stdio.h>
#include <cmath>

int Nx[100000010];
int Ny[100000010];
int M[100000010];

int main(){
	int i,j, n, m;
	scanf("%d %d ", &n, &m);
	for(i=0; i < n; ++i) scanf("%d %d ", &Nx[i], &Ny[i]);
	for(i=0; i < m; ++i) scanf("%d", &M[i]);
	
	for(i=0; i < m; ++i){
		double rad=0.0;
		for(j=0; j < n; ++j){
			if( Nx[j] > M[i] ){
				double dw = Nx[j]-M[i], dh = Ny[j];
				double ds = sqrt((dw*dw)+(dh*dh));
				double _r = asin(dh/ds);
				if( _r > rad ) rad = _r;
			}
		}
		printf("%.7f\n", rad);
	}
	
	return 0;
}

Subtask #1

0.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Memory limit exceeded	0 ms	16384 KB	Memory limit exceeded
2	Halted	0 ms	0 KB	-