Submission #3792

#	Time	Username	Problem	Language	Result	Execution time	Memory
3792		joonas	Jogging (kriii1_J)	C++98	0 / 1	4 ms	1448 KiB

J

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

int Nx[20010], Ny[20010];
int M[20010];

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(pow(dw,2)+pow(dh,2));
				double _r = asin(dh/ds);
				if( _r > rad ) rad = _r;
			}
		}
		printf("%.7f\n", rad);
	}
	
	return 0;
}

• Subtask 1: 0 / 1