Submission #3629012

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <functional>
#include <numeric>
#include <list>
#include <set>
#include <map>
#include <cstring>
#include <cmath>
#include <math.h>

using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;

#define v_exists(elem, v) find(v.begin(),v.end(),elem)!=v.end()
#define s_exists(elem, s) s.find(elem)!=s.end()
#define tasu(x, y) (x+y)%MOD
#define kake(x, y) x*y%MOD

long gcd(long a, long b) {
    return b == 0 ? a : gcd(b, a % b);
}

long lcm( long m, long n ){
	if ( ( 0 == m ) || ( 0 == n ) )
		return 0;

	return ((m / gcd(m, n)) * n);
}


int main(){
	int txa, tya, txb, tyb, T, V, n;
// 1 1 8 2 2 4
// 1
// 4 5
	cin >> txa >> tya >> txb >> tyb >> T >> V >> n;
	int x[1005];
	int y[1005];
	int d[1005];

	fill(x, x+1005, -1);
	fill(y, y+1005, -1);

	string possible = "NO";

	// get distance to each girl's house
	for (int i = 0; i < n; ++i){
		cin >> x[i] >> y[i];
		d[i] = sqrt(pow(x[i]-txa, 2)+pow(y[i]-tya, 2))+sqrt(pow(x[i]-txb, 2)+pow(y[i]-tyb, 2));

		if(d[i] <= T*V){
			possible = "YES";
			break;
		}

	}

	cout << possible << endl;
	return 0;
}

Submission Info

Judge Result