CodeForces 706A Beru-taxi (数学计算，水题)

时间：2024-01-10 08:11:38

题意：给定一个固定位置，和 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;

}

相关文章