Submission #1626451

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;

int d(int a1,int a2, int b1, int b2){
    int ans=0;
    if(a1>=b1){
        ans+=(a1-b1)*(a1-b1);
    }else{
        ans+=(b1-a1)*(b1-a1);
    }
    if(a2>=b2){
         ans+=(a2-b2)*(a2-b2);
    }else{
        ans+=(b2-a2)*(b2-a2);
    }
    return ans;
}

int main(){
	int txa,tya,txb,tyb,t,v;
    cin>>txa>>tya>>txb>>tyb>>t>>v;
    int n;
    cin>>n;
    vector<vector<int>> data(n, vector<int>(2, 0));
    int i;
    for(i=0;i<n;i++){
        cin>>data[i][0]>>data[i][1];
    }
    double dis=0;
    double total=t*v;
    for(i=0;i<n;i++){
        dis=d(txa,tya,data[i][0],data[i][1]);
        dis=sqrt(dis);
        dis+=sqrt(d(data[i][0],data[i][1],txb,tyb));
        if(dis<=total){
            i=n+1;
            break;
        }
    }
    if(i==n+1){
        cout<<"YES"<<endl;
    }else{
        cout<<"NO"<<endl;
    }
    return 0;
}

Submission Info

Judge Result