CodeForces 706A Beru-taxi (数学计算,水题)
Codeforces 水题
2023-09-11 14:17:18 时间
题意:给定一个固定位置,和 n 个点及移动速度,问你这些点最快到固定点的时间。
析:一个一个的算距离,然后算时间。
代码如下:
#pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <string> #include <cstdlib> #include <cmath> #include <iostream> #include <cstring> #include <set> #include <queue> #include <algorithm> #include <vector> #include <map> #include <cctype> #include <stack> using namespace std; typedef long long LL; typedef pair<int, int> P; const int INF = 0x3f3f3f3f; const double inf = 0x3f3f3f3f3f3f; const double PI = acos(-1.0); const double eps = 1e-8; const int maxn = 10 + 5; const int mod = 1e9 + 7; const char *mark = "+-*"; const int dr[] = {-1, 0, 1, 0}; const int dc[] = {0, 1, 0, -1}; int n, m; inline bool is_in(int r, int c){ return r >= 0 && r < n && c >= 0 && c < m; } int main(){ double x, y; scanf("%lf %lf", &x, &y); cin >> n; double ans = inf; while(n--){ int xx, yy, v; scanf("%d %d %d", &xx, &yy, &v); double sum = sqrt((xx-x)*(xx-x)+(y-yy)*(y-yy))/v; ans = min(ans, sum); } printf("%.16f\n", ans); return 0; }
相关文章
- Codeforces Round #656 (Div. 3)
- Codeforces Global Round 3
- Codeforces Round #831 (Div. 1 + Div. 2) C. Bricks and Bags
- Educational Codeforces Round 133 (Rated for Div. 2) A 2-3 Moves
- Codeforces Round #834 (Div. 3) D. Make It Round
- CodeForces 566D Restructuring Company (并查集+链表)
- CodeForces 732A Buy a Shovel (水题)
- CodeForces 743A Vladik and flights (水题)
- CodeForces 731A Night at the Museum (水题)
- CodeForces 707B Bakery (水题,暴力,贪心)
- CodeForces 707A Brain's Photos (水题)
- CodeForces 589I Lottery (暴力,水题)
- CodeForces 589A Email Aliases (匹配,水题)
- CodeForces 548A Mike and Fax (回文,水题)
- CodeForces 534B Covered Path (水题)
- CodeForces 427A Police Recruits (水题)
- CodeForces 474B Worms (水题,二分)
- CodeForces 681C Heap Operations (模拟题,优先队列)
- CodeForces 518A Vitaly and Strings (水题,字符串)
- CodeForces 688B Lovely Palindromes (水题回文)
- 「CodeForces 581D」Three Logos
- 【CodeForces 567F】Mausoleum
- Codeforces Round #800 (Div. 2)
- Codeforces #282 div 1 C Helping People 题解
- Codeforces 196 D. The Next Good String
- Codeforces Round #248 (Div. 2) B称号 【数据结构:树状数组】
- 【codeforces】Codeforces Round #277 (Div. 2) 解读