forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathH.cpp
More file actions
59 lines (48 loc) · 1.67 KB
/
H.cpp
File metadata and controls
59 lines (48 loc) · 1.67 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
50
51
52
53
54
55
56
57
58
59
#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
#define SZ(X) ((int) ((X).size()))
using namespace std;
double a, b, c, d;
double getMin(double a, double d, double x) {
double w = (a - x) * (d - x);
double y = (a - x) * (d + x);
double z = (a + x) * (d - x);
double t = (a + x) * (d + x);
return min(min(w, y), min(z, t));
}
double getMax(double a, double d, double x) {
double w = (a - x) * (d - x);
double y = (a - x) * (d + x);
double z = (a + x) * (d - x);
double t = (a + x) * (d + x);
return max(max(w, y), max(z, t));
}
bool check(double x) {
double min1 = getMin(a, d, x);
double max1 = getMax(a, d, x);
double min2 = getMin(b, c, x);
double max2 = getMax(b, c, x);
if (max1 < min2 || max2 < min1) return false;
return true;
}
int main() {
ios :: sync_with_stdio(false);
cout << (fixed) << setprecision(12);
while (cin >> a >> b >> c >> d) {
double l = 0, r = 1e9, res = 1e9;
REP(turn,500) {
double x = (l + r) / 2.0;
if (check(x)) res = r = x;
else l = x;
}
cout << res << endl;
}
}