1840: Lawn mower

1840: Lawn mower

      Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 217     Solved: 115    

---

Description

    The International Collegiate Soccer1 Competition (ICSC) is famous for its well-kept rectangular stadiums. The grass playing fields in ICSC stadiums are always 100 meters long, and 75 meters wide. The grass is mowed every week with special lawn mowers, always using the same strategy: first, they make a series of passes along the length of the field, and then they do the same along the width of the field. All passes are straight lines, parallel to the sides of the field.

    The ICSC has hired a new lawn-mower, Guido. Guido is very chaotic, and instead of covering the field incrementally, he likes to choose random starting positions for each of his passes. But he is afraid of not doing a good job and being red by the ICSC, so he has asked you to help him. Write a program to make sure that the grass in the field is perfectly cut: all parts of the field have to be mowed at least once when the mower goes from end to end, and again when the mower goes from side to side.

Input

　　Each test case contains 3 lines. The first line contains two integers, nx (0 < nx < 1 000) and ny(0 < nx < 1 000), and a real number w (0<w≤50

), which represents the width of the cut of thatparticular lawn mower. The next line describes the end-to-end passes (along the length of the field), andcontains nx real numbers xi ( 0≤xi≤75) describing the starting positions of the mower's center in Guido'send-to-end passes. The last line describes the side-to-side passes, with ny real numbers yi ( 0≤yi≤100

).

　　The end of the test cases is signalled with a line that contains the numbers 0 0 0.0. You should generateno output for this line, as it is not a test case.

　　Real numbers for w, xi and yi can have up to 7 digits after the decimal point, and any cut will alsoinclude its boundaries. For example, if a 2.0-meter wide cut is performed along the 10.0-meter mark, thena strip of grass from 9.0 to 11.0 (including both) will be considered "cut".

Output

　　Print YES if Guido has done a good job, or NO if some part of the field has not been mowed at leastonce when the mower was travelling along the length of the field, and again when it was travelling along thewidth.

Sample Input

8 11 10.0
0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0
0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0 80.0 90.0 100.0
8 10 10.0
0.0 10.0 20.0 30.0 40.0 50.0 60.0 70.0
0.0 10.0 30.0 40.0 50.0 60.0 70.0 80.0 90.0 100.0
4 5 20.0
70.0 10.0 30.0 50.0
30.0 10.0 90.0 50.0 70.0
4 5 20.0
60.0 10.0 30.0 50.0
30.0 10.0 90.0 50.0 70.0
0 0 0.0

Sample Output

YES
NO
YES
NO

题目看上去挺吓人的，对，看上去，只是看上去。

题意：在一块75*100的草坪上有一些除草机，横竖都有，告诉了你除草机的台数还有除草机的工作宽度。每台除草机都只能直线前进，问能否将草坪上的草除干净。每组测试用例有三行，第一行是横纵除草机的数量和除草机工作宽度。接下来两行是每台除草机的位置。第二行是横的，第三行是纵的。每台除草机的工作范围是以所给坐标为中心往两边展开。例如除草机位置为20.0，工作宽度为20.0。那么它工作的范围是从10.0到30.0 。

题目所给的除草机位置是没有排序的，所以需要自己进行排序。然后判断边界能否工作到以及相邻两台除草机之间有没有空隙。如果有没讲清楚的地方请看代码。代码有注释，有不懂再问吧

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
double a[1005], b[1005];
int main()
{
	int m, n;
	double w;
	while (cin >> m >> n >> w, m + n + w)
	{
		int flag = 0;
		for (int i = 0; i < m; i++)
		{
			scanf ("%lf", &a[i]);
		}
		for ( int i = 0; i < n; i++)
		{
			scanf ("%lf", &b[i]);
		}
		sort (a, a + m);
		sort (b, b + n);
		if(a[0] > w / 2.0 || 75 - a[m - 1] > w / 2.0)//边界判断
		//a[0]>w/2.0说明a[0]-(w/2.0)>0，说明左边界清不到
		//a[0]是第一台除草机的位置，它的工作范围是a[0]-(w/2.0)到a[0]+(w/2.0)
		{
			cout << "NO\n";
			continue;
		}
		if(b[0] > w / 2.0 || 100 - b[n - 1] > w / 2.0)
		{
			cout << "NO\n";
			continue;
		}
		for (int i = 0; i < m - 1; i++)
		{
			if (a[i + 1] - a[i] > w)//空隙判断
			{
				flag = 1;
				break;
			}
		}
		for (int i = 0; i < n - 1; i++)
		{
			if (b[i + 1] - b[i] > w)
			{
				flag = 1;
				break;
			}
		}
		if (flag)
		{
			cout << "NO\n";
		}
		else
		{
			cout << "YES\n";
		}
	}
	return 0;
}