Submission #2098960

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<functional>
#include<iomanip>
#include<cmath>
#include<queue>
#include<limits>
using namespace std;

int main()
{
	int txa, tya, txb, tyb, t, v, n, x, y;
	cin >> txa >> tya >> txb >> tyb;
	cin >> t >> v;
	cin >> n;
	bool f = false;
	double eps = 0.001;
	for (int i = 0; i < n; i++) {
		cin >> x >> y;
		double a, b;
		a = sqrt((x - txa)*(x - txa) + (y - tya)*(y - tya));
		b = sqrt((txb - x) * (txb - x) + (tyb - y) * (tyb - y));
		if (t * v + eps >= a + b) {
			f = true;
			break;
		}
	}
	if (f) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result