Submission #180097
Source Code Expand
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <unistd.h>
#include <utility>
#include <vector>
using namespace std;
#define i64 int64_t
#define rep(i, n) for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v) ((i64)((v).size()))
#define bit(n) (((i64)1)<<((i64)(n)))
#define all(v) (v).begin(), (v).end()
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class ...Ts> std::ostream& operator<<(std::ostream &os, const std::tuple<Ts...> &t){ os << "("; deploy<0, std::tuple<Ts...>, Ts...>(os, t); os << ")"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> &q){ auto qq = q; os << "{"; for(; !qq.empty(); qq.pop()){ os << qq.front() << (qq.size() != 1 ? ", " : ""); } os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> &q){ auto qq = q; os << "{"; for(; !qq.empty(); qq.pop()){ os << qq.top() << (qq.size() != 1 ? ", " : ""); } os << "}"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "" : ", "); os << "}"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "" : ", "); os << "}"; return os; }
#define DEBUG0() { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << std::endl; }
#define DEBUG1(var0) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << std::endl; }
#define DEBUG2(var0, var1) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << std::endl; }
#define DEBUG3(var0, var1, var2) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << std::endl; }
#define DEBUG4(var0, var1, var2, var3) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << std::endl; }
#define DEBUG5(var0, var1, var2, var3, var4) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << ", " << (#var4) << "=" << (var4) << std::endl; }
#define DEBUG6(var0, var1, var2, var3, var4, var5) { char buf[100]; sprintf(buf, "line:%3d | ", __LINE__); std::cout << buf << (#var0) << "=" << (var0) << ", " << (#var1) << "=" << (var1) << ", " << (#var2) << "=" << (var2) << ", " << (#var3) << "=" << (var3) << ", " << (#var4) << "=" << (var4) << ", " << (#var5) << "=" << (var5) << std::endl; }
#define ASSERT(f) { if(!(f)){ DEBUG1("error"); while(true); }}
int main()
{
i64 sx, sy, tx, ty, t, v, n, x, y, found = false;
cin >> sx >> sy >> tx >> ty >> t >> v >> n;
rep(i, n){
cin >> x >> y;
found |= hypot(x - sx, y - sy) + hypot(x - tx, y - ty) - 1e-6 < t * v;
}
cout << (found ? "YES" : "NO") << endl;
}
Submission Info
Submission Time |
|
Task |
C - 浮気調査 |
User |
Komaki |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
4483 Byte |
Status |
AC |
Exec Time |
25 ms |
Memory |
928 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
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 |
804 KB |
sample_02.txt |
AC |
20 ms |
924 KB |
sample_03.txt |
AC |
21 ms |
924 KB |
sample_04.txt |
AC |
21 ms |
804 KB |
test_01.txt |
AC |
23 ms |
796 KB |
test_02.txt |
AC |
22 ms |
676 KB |
test_03.txt |
AC |
21 ms |
796 KB |
test_04.txt |
AC |
21 ms |
800 KB |
test_05.txt |
AC |
22 ms |
736 KB |
test_06.txt |
AC |
21 ms |
800 KB |
test_07.txt |
AC |
22 ms |
800 KB |
test_08.txt |
AC |
21 ms |
928 KB |
test_09.txt |
AC |
21 ms |
924 KB |
test_10.txt |
AC |
22 ms |
800 KB |
test_11.txt |
AC |
22 ms |
716 KB |
test_12.txt |
AC |
20 ms |
796 KB |
test_13.txt |
AC |
23 ms |
800 KB |
test_14.txt |
AC |
20 ms |
924 KB |
test_15.txt |
AC |
21 ms |
796 KB |
test_16.txt |
AC |
21 ms |
800 KB |
test_17.txt |
AC |
21 ms |
720 KB |
test_18.txt |
AC |
24 ms |
756 KB |
test_19.txt |
AC |
23 ms |
800 KB |
test_20.txt |
AC |
24 ms |
800 KB |
test_21.txt |
AC |
22 ms |
696 KB |
test_22.txt |
AC |
22 ms |
708 KB |
test_23.txt |
AC |
22 ms |
800 KB |
test_24.txt |
AC |
23 ms |
924 KB |
test_25.txt |
AC |
24 ms |
804 KB |
test_26.txt |
AC |
22 ms |
924 KB |
test_27.txt |
AC |
23 ms |
792 KB |
test_28.txt |
AC |
22 ms |
800 KB |
test_29.txt |
AC |
25 ms |
764 KB |
test_30.txt |
AC |
22 ms |
800 KB |
test_31.txt |
AC |
20 ms |
924 KB |