Submission #180157

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const double EPS = 1.0e-10;

double dist(int x1, int y1, int x2, int y2)
{
    return sqrt(pow(x1 - x2, 2.0) + pow(y1 - y2, 2.0));
}

int main()
{
    int xa, ya, xb, yb, t, v, n;
    cin >> xa >> ya >> xb >> yb >> t >> v >> n;

    for(int i=0; i<n; ++i){
        int x, y;
        cin >> x >> y;

        if((dist(xa, ya, x, y) + dist(x, y, xb, yb)) / v <= t + EPS){
            cout << "YES" << endl;
            return 0;
        }
    }
    
    cout << "NO" << endl;
    return 0;
}

Submission Info

Judge Result