POJ1005-I Think I Need a Houseboat

I Think I Need a Houseboat

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 108947		Accepted: 47310

Description

Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 50 square miles each year, due to erosion caused by the Mississippi River. Since Fred is hoping to live in this house the rest of his life, he needs to know if his land is going to be lost to erosion. 

After doing more research, Fred has learned that the land that is being lost forms a semicircle. This semicircle is part of a circle centered at (0,0), with the line that bisects the circle being the X axis. Locations below the X axis are in the water. The semicircle has an area of 0 at the beginning of year 1. (Semicircle illustrated in the Figure.) 

Input

The first line of input will be a positive integer indicating how many data sets will be included (N). Each of the next N lines will contain the X and Y Cartesian coordinates of the land Fred is considering. These will be floating point numbers measured in miles. The Y coordinate will be non-negative. (0,0) will not be given.

Output

For each data set, a single line of output should appear. This line should take the form of: “Property N: This property will begin eroding in year Z.” Where N is the data set (counting from 1), and Z is the first year (start from 1) this property will be within the semicircle AT THE END OF YEAR Z. Z must be an integer. After the last data set, this should print out “END OF OUTPUT.”

链接

一、题意

        河水按半圆形侵蚀陆地，每年50平方英里。现在给定一个坐标，问多久后该点会被侵蚀。

二、思路

        更具坐标求出腐蚀到该点时总的腐蚀面积，然后看有多少个50。注意算面积时是半圆。

三、代码

#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;
typedef long long ll;
const int MAXN = 100100;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int INF = 2000000000;//0x7fffffff
const double EPS = 1e-9;
const double PI = 3.14159265358979;
const int dir_4r[] = { -1, 1, 0, 0 };
const int dir_4c[] = { 0, 0, -1, 1 };
const int dir_8r[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
const int dir_8c[] = { -1, 0, 1, -1, 1, -1, 0, 1 };

int main() {
	int n, ans;
	double x, y, s;

	scanf("%d", &n);
	for (int kase = 1; kase <= n; ++kase) {
		scanf("%lf%lf", &x, &y);
		s = PI * (x * x + y * y) / 2.0;

		ans = 0;
		while (s > 0) {
			s -= 50.0;
			ans++;
		}

		printf("Property %d: This property will begin eroding in year %d.\n", kase, ans);
	}
	printf("END OF OUTPUT.\n");

	//system("pause");
	return 0;
}