[sicily online]1070. Hansel and Grethel

最新推荐文章于 2014-01-02 10:26:50 发布

原创最新推荐文章于 2014-01-02 10:26:50 发布 · 1.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

刷题

通过测量两个地标的方向并结合地图坐标，本算法能够精确计算出人物的当前位置。涉及到坐标转换及直线交点计算。

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

On a warm summer afternoon, Hansel and Grethel are walking together in the fields. It is getting late and, to be honest, they are lost. Grethel is a little scared, still vividly remembering the last time they got lost in the forest. That time, an evil witch had locked them inside a house built of gingerbread and sugar! But Hansel can reassure her: this time they are well prepared. Hansel has taken a map and a compass with him!

Hansel picks two clearly outstanding features in the landscape, and uses the compass to measure the direction towards both objects. Grethel locates the objects on the map, and writes down the corresponding map coordinates. Based on this information, they will be able to accurately determine their own position on the map.

The coordinates of two marker objects, and the direction (angle from the North) towards these objects are known. Write a program which uses this data to calculate the coordinates of Hansel and Grethel's current location.

Input

The first line of the input contains one positive number: the number of situations in which a position must be determined. Following are two lines per situation, describing the two marker objects. Each marker object is described by a line containing three integer numbers:

> the x-coordinate of the object on the map (0 <= x <= 100);

the x-axis runs West-to-East on the map, with increasing values towards the East.

> the y-coordinate of the object on the map (0 <= y <= 100);

the y-axis runs South-to-North on the map, with increasing values towards the North.

> the direction d of the object in degrees (0 <= d < 360);

with 0 = North, 90 = East, 180 = South, and so on.

To keep the position calculations accurate, Hansel makes sure that the directions of the two objects are not exactly equal, and do not differ by exactly 180.

Output

One line per situation, containing the result of the position calculation: two numbers, separated by a space, each having exactly 4 digits after the decimal point. These numbers represent the x and y coordinates of the position of Hansel and Grethel (0 <= x, y <= 100). Round the numbers as usual: up if the next digit would be >= 5, down otherwise.

Sample Input

Sample Output

20.0000 50.0000 
7.0610 42.4110

题目分析：

其实就是求两个之间的交点，有两个需要注意的地方

1，直线斜率不存在的时候

2，人的角度到坐标系的斜率的转化

#include<iostream>
#include <iomanip>
#include<stdio.h>
#include<cmath>
#include<iomanip>
#include<list>
#include <map>
#include <vector>
#include <string>
#include <algorithm>
#include <sstream>
#include <stack>
#include<queue>
#include<string.h>
#include<set>
using namespace std;

const double PI=3.14159265;
const int MAX=999999;

int main()
{
	//cout<<tan(PI);
	int n;
	cin>>n;
	for(int xx=0;xx<n;xx++)
	{
		int x1,y1,r1;
		int x2,y2,r2;
		cin>>x1>>y1>>r1>>x2>>y2>>r2;
		if(r1>=180)
			r1=r1-180;
		if(r2>=180)
			r2=r2-180;
		r1=90-r1;
		r2=90-r2;
		double k1,b1,k2,b2;
		double x,y;
		if(fabs((double)r1)!=90.0)
		{
			k1=tan(r1/180.0*PI);
			b1=y1-x1*k1;
		}
		if(fabs((double)r2)!=90.0)
		{
			k2=tan(r2/180.0*PI);
			b2=y2-x2*k2;
		}
		if(fabs((double)r1)==90.0)
		{
			x=x1;
			y=k2*x+b2;
		}
		else if(fabs((double)r2)==90.0)
		{
			x=x2;
			y=k1*x+b1;
		}
		else 
		{
			x=(b2-b1)/(k1-k2);
			y=k1*x+b1;
		}
		cout<<setiosflags(ios::fixed)<<setprecision(4)<<fabs(x)<<" "<<fabs(y)<<endl;
	}
}