Submission #1604411

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int txa, tya, txb, tyb, t, v;
    cin >> txa >> tya >> txb >> tyb >> t >> v;
    int n;
    cin >> n;
    int x[n], y[n];
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }

    for (int i = 0; i < n; i++) {
        int dist = abs(txa - x[i]) * abs(txa - x[i]) + abs(tya - y[i]) * abs(tya - y[i]);
        dist += abs(txb - x[i]) * abs(txb - x[i]) + abs(tyb - y[i]) * abs(tyb - y[i]);
        if (dist <= v * v * t * t) {
            cout << "YES" << endl;
            return 0;
        }
    }

    cout << "NO" << endl;
    return 0;
}

Submission Info

Judge Result