Submission #2196563

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#define REP(i, n) for(int i=0;i<n;++i)
#define INF 100000000
#define ll long long

using namespace std;

typedef pair<int, int> P;

int x_a, y_a, x_b, y_b, t, v;
int n;
int x, y;

bool f(int x, int y){
  double a = sqrt(pow(x_a - x, 2.0) + pow(y_a - y, 2.0));
  double b = sqrt(pow(x_b - x, 2.0) + pow(y_b - y, 2.0));

  if(a + b <= t * v){
    return true;
  }else{
    return false;
  }
}

int main(){
  cin >> x_a >> y_a >> x_b >> y_b >> t >> v;
  cin >> n;

  REP(i, n){
    cin >> x >> y;
    if(f(x, y)){
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  
  return 0;
}

Submission Info

Judge Result