Submission #1609035

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 1000000000;
const double PI = acos(-1);

int main() {
	double txa, tya, txb, tyb, T, V;
	cin >> txa >> tya >> txb >> tyb >> T >> V;
	int n;
	cin >> n;
	double x, y;
	for (int i = 0; i < n; i++) {
		cin >> x >> y;
		if ((sqrt((x - txa)*(x - txa) + (y - tya)*(y - tya)) + sqrt((txb - x)*(txb - x) + (tyb - y)*(tyb - y))) / V <= T) {
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
}

Submission Info

Judge Result