forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
50 lines (42 loc) · 1.48 KB
/
A.cpp
File metadata and controls
50 lines (42 loc) · 1.48 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
const double PI = acos(-1.0);
const double EPS = 1e-6;
bool rect_in_rect(double X, double Y, double x, double y) {
if (Y > X) swap(Y, X);
if (y > x) swap(y, x);
double diagonal = sqrt(double(X)*X + double(Y)*Y);
if (x < X && y < Y) return true;
else if (y >= Y || x >= diagonal) return false;
else {
double w, theta, tMin = PI/4, tMax = PI/2;
while (tMax - tMin > EPS) {
theta = (tMax + tMin)/2.0;
w = (Y-x*cos(theta))/sin(theta);
if (w < 0 || x * sin(theta) + w * cos(theta) < X) tMin = theta;
else tMax = theta;
}
return (w > y);
}
}
int main() {
ios :: sync_with_stdio(false);
double a1, b1, a2, b2;
while (cin >> a1 >> b1 >> a2 >> b2) {
if (rect_in_rect(a1 + EPS, b1 + EPS, a2, b2)
|| rect_in_rect(a2 + EPS, b2 + EPS, a1, b1)) {
cout << "Yes";
}
else cout << "No";
cout << endl;
}
}