Submission #2173494
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define rep(n, i) Rep(0, n-1, i)
const int MAX = 200000;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<31-1;
const int MOD = 1000000007;
double tx1, ty1, tx2, ty2, T, V, n;
typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
typedef std::priority_queue<int> IntPrioQueue; //Z->A
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z
double dis(double a, double b, double c, double d){
return (sqrt(pow((a-c), 2) + pow((b-d), 2)));
}
void solve(void){
cin >> tx1 >> ty1 >> tx2 >> ty2 >> T >> V >> n;
bool flag = false;
rep(n, i) {
double x, y;
scanf("%lf %lf\n", &x, &y);
if (dis(x, y, tx1, tx2) + dis(x, y, tx2, ty2) <= T*V) flag = true;
}
cout << (flag?"YES":"NO") << '\n';
}
int main(void){
solve();
return 0;
}
Submission Info
Submission Time
2018-03-08 23:35:30+0900
Task
C - 浮気調査
User
sifi_border
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1263 Byte
Status
WA
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘void solve()’:
./Main.cpp:44:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lf %lf\n", &x, &y);
^
Judge Result
Set Name
All
Score / Max Score
0 / 100
Status
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
WA
1 ms
256 KB
test_02.txt
AC
1 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
WA
1 ms
256 KB
test_08.txt
AC
1 ms
256 KB
test_09.txt
WA
1 ms
256 KB
test_10.txt
AC
1 ms
256 KB
test_11.txt
AC
1 ms
256 KB
test_12.txt
AC
1 ms
256 KB
test_13.txt
AC
1 ms
256 KB
test_14.txt
AC
1 ms
256 KB
test_15.txt
AC
1 ms
256 KB
test_16.txt
AC
1 ms
256 KB
test_17.txt
WA
1 ms
256 KB
test_18.txt
AC
1 ms
256 KB
test_19.txt
WA
1 ms
256 KB
test_20.txt
AC
1 ms
256 KB
test_21.txt
AC
1 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
1 ms
256 KB
test_26.txt
AC
1 ms
256 KB
test_27.txt
WA
1 ms
256 KB
test_28.txt
AC
1 ms
256 KB
test_29.txt
WA
1 ms
256 KB
test_30.txt
AC
1 ms
256 KB
test_31.txt
AC
1 ms
256 KB