Submission #1688586

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
//typedef LL int;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
    int txa, tya, txb, tyb, T, V;
    cin >> txa >> tya >> txb >> tyb >> T >> V;
    int n;
    cin >> n;
    int X[1005], Y[1005];
    REP(i, n){
        cin >> X[i] >> Y[i];
    }
    
    bool flag = false;
    REP(i, n){
        if(flag) break;
        double far = sqrt(pow(X[i] - txa, 2) + pow(Y[i] - tya, 2)) + sqrt(pow(txb - X[i], 2) + pow(tyb - Y[i], 2));
        if((int)far <= T * V) flag = true;
    }

    if(flag) cout << "YES" << endl;
    else cout << "NO" << endl;

}

Submission Info

Judge Result