Submission #180411


Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>

using namespace std; using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VS = vector<string>;
using SS = stringstream;
using PII = pair<int,int>;
using VPII = vector< pair<int,int> >;
template < typename T = int > using VT = vector<T>;
template < typename T = int > using VVT = VT< VT<T> >;
template < typename T = int > using LIM = numeric_limits<T>;

template < typename T > inline T fromString( const string &s ){ T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };

#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) (c).begin(), (c).end()
#define AALL( a, t ) (t*)a, (t*)a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()

#define PB( n ) push_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )

#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

#include <complex>
typedef complex<double> Point;
const double EPS = 1e-8;

// 入力ストリームから実数二つをとって Point へ
istream& operator >> ( istream &s, Point &a )
{
	double r, i;
	s >> r >> i;
	a = Point( r, i );
	return s;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	Point ta, tb;
	cin >> ta >> tb;

	int t, v;
	cin >> t >> v;

	int n;
	cin >> n;

	vector<Point> ps( n );
	FOR( p, ps )
	{
		cin >> p;
	}

	FOR( p, ps )
	{
		if ( abs( p - ta ) + abs( tb - p ) <= t * v + EPS )
		{
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;

	return 0;
}

Submission Info

Submission Time
Task C - 浮気調査
User torus711
Language C++11 (GCC 4.8.1)
Score 100
Code Size 2174 Byte
Status AC
Exec Time 28 ms
Memory 932 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 31
Set Name Test Cases
All 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 21 ms 800 KB
sample_02.txt AC 20 ms 796 KB
sample_03.txt AC 21 ms 924 KB
sample_04.txt AC 21 ms 924 KB
test_01.txt AC 20 ms 924 KB
test_02.txt AC 21 ms 932 KB
test_03.txt AC 22 ms 928 KB
test_04.txt AC 22 ms 928 KB
test_05.txt AC 22 ms 800 KB
test_06.txt AC 22 ms 796 KB
test_07.txt AC 22 ms 800 KB
test_08.txt AC 22 ms 796 KB
test_09.txt AC 23 ms 804 KB
test_10.txt AC 23 ms 928 KB
test_11.txt AC 22 ms 804 KB
test_12.txt AC 20 ms 804 KB
test_13.txt AC 22 ms 928 KB
test_14.txt AC 20 ms 928 KB
test_15.txt AC 22 ms 804 KB
test_16.txt AC 21 ms 796 KB
test_17.txt AC 21 ms 928 KB
test_18.txt AC 21 ms 924 KB
test_19.txt AC 22 ms 928 KB
test_20.txt AC 28 ms 844 KB
test_21.txt AC 23 ms 804 KB
test_22.txt AC 20 ms 792 KB
test_23.txt AC 21 ms 932 KB
test_24.txt AC 22 ms 928 KB
test_25.txt AC 21 ms 928 KB
test_26.txt AC 20 ms 924 KB
test_27.txt AC 20 ms 928 KB
test_28.txt AC 23 ms 928 KB
test_29.txt AC 20 ms 796 KB
test_30.txt AC 22 ms 840 KB
test_31.txt AC 19 ms 800 KB