Submission #534635

---

Source Code Expand

// Enjoy your stay.

#include <bits/stdc++.h>

#define long long long
#define LOOPVAR_TYPE long

#define all(x) (x).begin(), (x).end()
#define sz(x) ((LOOPVAR_TYPE)(x).size())
#define foreach(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); it++)
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(LOOPVAR_TYPE i = (LOOPVAR_TYPE)(a); i < (LOOPVAR_TYPE)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)

#define fir first
#define sec second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back

const double EPS = 1e-9;
const double PI = acos(-1.0);
const long INF = 1070000000LL;
const long MOD = 1000000007LL;

using namespace std;

typedef istringstream iss;
typedef stringstream sst;
typedef pair<LOOPVAR_TYPE, LOOPVAR_TYPE> pi;
typedef vector<LOOPVAR_TYPE> vi;

double H, W;

typedef complex<double> P;

void main2(){
	if(H > W) swap(H, W);
	double l = sqrt(H*H + (W/2)*(W/2));
	if(l <= W){
		cout << l << endl;
		return;
	}
	double lo = 0, hi = W;
	rep(_, 100){
		double mi = (lo + hi) / 2;
		P l = P(mi, -H);
		l *= P(0, 1);
		l *= sqrt(3) / 2;
		P m = P(mi / 2, -H / 2);
		P p = m + l;
		(p.real() <= W && p.imag() <= 0 ? lo : hi) = mi;
	}
	cout << sqrt(H*H + lo*lo) << endl;
}

int main(){
	cin.tie(NULL);
	ios_base::sync_with_stdio(false);

	int T;
	cin >> T;
	cout << setprecision(16);
	while(T--){
		cin >> H >> W;
		main2();
	}
}

Submission Info

Judge Result