Codeforces Round #242 (Div. 2) B
2014-04-26 00:00
99 查看
摘要: Codeforces Round #242 (Div. 2) B
question
B. Megacity
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
The administration of the Tomsk Region firmly believes that it's time to become a megacity (that is, get population of one million). Instead of improving the demographic situation, they decided to achieve its goal by expanding the boundaries of the city.
The city of Tomsk can be represented as point on the plane with coordinates (0; 0). The city is surrounded with n other locations, the i-th one has coordinates (xi, yi) with the population of ki people. You can widen the city boundaries to a circle of radius r. In such case all locations inside the circle and on its border are included into the city.
Your goal is to write a program that will determine the minimum radius r, to which is necessary to expand the boundaries of Tomsk, so that it becomes a megacity.
Input
The first line of the input contains two integers n and s (1 ≤ n ≤ 103; 1 ≤ s < 106) — the number of locatons around Tomsk city and the population of the city. Then n lines follow. The i-th line contains three integers — the xi and yi coordinate values of the i-th location and the number ki of people in it (1 ≤ ki < 106). Each coordinate is an integer and doesn't exceed 104 in its absolute value.
It is guaranteed that no two locations are at the same point and no location is at point (0; 0).
Output
In the output, print "-1" (without the quotes), if Tomsk won't be able to become a megacity. Otherwise, in the first line print a single real number — the minimum radius of the circle that the city needs to expand to in order to become a megacity.
The answer is considered correct if the absolute or relative error don't exceed 10 - 6.
Sample test(s)
input
output
input
output
input
output
ans
question
B. Megacity
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
The administration of the Tomsk Region firmly believes that it's time to become a megacity (that is, get population of one million). Instead of improving the demographic situation, they decided to achieve its goal by expanding the boundaries of the city.
The city of Tomsk can be represented as point on the plane with coordinates (0; 0). The city is surrounded with n other locations, the i-th one has coordinates (xi, yi) with the population of ki people. You can widen the city boundaries to a circle of radius r. In such case all locations inside the circle and on its border are included into the city.
Your goal is to write a program that will determine the minimum radius r, to which is necessary to expand the boundaries of Tomsk, so that it becomes a megacity.
Input
The first line of the input contains two integers n and s (1 ≤ n ≤ 103; 1 ≤ s < 106) — the number of locatons around Tomsk city and the population of the city. Then n lines follow. The i-th line contains three integers — the xi and yi coordinate values of the i-th location and the number ki of people in it (1 ≤ ki < 106). Each coordinate is an integer and doesn't exceed 104 in its absolute value.
It is guaranteed that no two locations are at the same point and no location is at point (0; 0).
Output
In the output, print "-1" (without the quotes), if Tomsk won't be able to become a megacity. Otherwise, in the first line print a single real number — the minimum radius of the circle that the city needs to expand to in order to become a megacity.
The answer is considered correct if the absolute or relative error don't exceed 10 - 6.
Sample test(s)
input
4 999998 1 1 1 2 2 1 3 3 1 2 -2 1
output
2.8284271
input
4 999998 1 1 2 2 2 1 3 3 1 2 -2 1
output
1.4142136
input
2 1 1 1 999997 2 2 1
output
-1
ans
#include <iostream> #include <map> #include <cmath> #include <cstdio> using namespace std; #define INF 1000000 long long int n , s; long long int x, y, k; long long int d; long double ans; map<long long int, long long int> ptable; int main() { cin >> n >> s; for(int i = 0; i < n; i++){ cin >> x >> y >> k; d = x*x + y*y; ptable[d] += k; } for(map<long long int, long long int>::iterator iter = ptable.begin(); iter != ptable.end(); iter++){ s += iter->second; if(s >= INF){ ans = iter->first; ans = sqrt(ans); cout.precision(8); cout << ans << endl; return 0; } } //cout << s << endl; cout << "-1" << endl; return 0; }
相关文章推荐
- div+css的几种常用的布局
- 有利于SEO的DIV+CSS的命名规则
- div+css 左右两列自适应高度 ,以及父级div也跟着自适应子级的高度(兼容各大浏览器)
- Codeforces Round #260 (Div. 2) B. Fedya and Maths
- CSS弹出二级多列菜单和DIV布局实例 - 仿IBM官网首页
- Topcoder SRM 677 div2
- Codeforces Round #367 (Div. 2)E
- Codeforces Round #401(Div. 2)B. Game of Credit Cards【贪心】
- Codeforces Beta Round #83 (Div. 1 Only) E.Darts 凸多边形面积交
- BadNeighbors (TCCC '04 Round 4 Div1 250)
- DIV和table页面布局的区别和联系
- DIV+CSS规范命名大全集合
- CF#259 (Div. 2) A.
- Codeforces Round #302 (Div. 2) B. Sea and Islands 构造
- 或得的一个div是变量时
- CSS+DIV 设计一个简单的个人网页界面
- 【贪心】Codeforces Round #402 (Div. 2) C. Dishonest Sellers
- div中 li宽度不固定 ie6和ie7不兼容不自动换行
- DIV 多行文字或图片垂直居中 FF/ IE 6,7,8
- 滚动新闻效果(使一个div滚动)