Submission #1292967


Source Code Expand

#include <iostream>
#include<sstream>
#include<vector>
#include<iterator>
#include<cmath>
#include<algorithm>
using namespace std;

double distance2(int srcx, int srcy, int dstx, int dsty, const vector<int>& home)
{
	srcx -= home[0];
	srcy -= home[1];

	dstx -= home[0];
	dsty -= home[1];

	return sqrt(pow(srcx, 2) + pow(srcy, 2)) + sqrt(pow(dstx, 2) + pow(dsty, 2));
}

int main(void)
{
	int txa, tya, txb, tyb, T, V; 
	cin >> txa >> tya >> txb >> tyb >> T >> V;

	int n;
	cin >> n;
	vector<vector<int>> home(n, vector<int>(2, 0));
	for(int i=0; i<n; i++)
		cin >> home[i][0] >> home[i][1];
	
	vector<double> dis(n, 0.0);
	for(int i=0; i<n; i++)
		dis[i] = distance2(txa, tya, txb, tyb, home[i]);

	double movement = 1.0 * V*T;
	if(movement >= *min_element(dis.begin(), dis.end()))
		cout << "YES" << endl;
	else
		cout << "NO" << endl;

	return 0;
}

Submission Info

Submission Time
Task C - 浮気調査
User callman
Language C++14 (GCC 5.4.1)
Score 100
Code Size 895 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 35
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 2 ms 256 KB
test_08.txt AC 2 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 2 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 2 ms 256 KB
test_22.txt AC 1 ms 256 KB
test_23.txt AC 1 ms 256 KB
test_24.txt AC 1 ms 256 KB
test_25.txt AC 2 ms 256 KB
test_26.txt AC 2 ms 256 KB
test_27.txt AC 2 ms 256 KB
test_28.txt AC 1 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 1 ms 256 KB