#60627 (C++11) No.306 さいたま2008

• 問題: No.306 さいたま2008
• ユーザー: omu
• 提出日時: 2015-11-27 23:11:52
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,687 bytes
• コンパイル時間: 714 ms
• コンパイル使用メモリ: 93,584 KB
• 実行使用メモリ: 4,352 KB
• 最終ジャッジ日時: 2023-10-12 00:36:41
• 合計ジャッジ時間: 1,690 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,352 KB
testcase_01	AC	2 ms; 4,348 KB
testcase_02	AC	1 ms; 4,352 KB
testcase_03	AC	2 ms; 4,352 KB
testcase_04	AC	2 ms; 4,348 KB
testcase_05	AC	1 ms; 4,348 KB
testcase_06	AC	1 ms; 4,352 KB
testcase_07	AC	2 ms; 4,352 KB
testcase_08	AC	2 ms; 4,352 KB
testcase_09	AC	1 ms; 4,348 KB
testcase_10	AC	2 ms; 4,348 KB
testcase_11	AC	2 ms; 4,352 KB
testcase_12	AC	2 ms; 4,352 KB
testcase_13	AC	1 ms; 4,352 KB
testcase_14	AC	1 ms; 4,352 KB
testcase_15	AC	2 ms; 4,348 KB
testcase_16	AC	2 ms; 4,348 KB
testcase_17	AC	1 ms; 4,348 KB
testcase_18	AC	2 ms; 4,348 KB
testcase_19	AC	1 ms; 4,348 KB
testcase_20	AC	1 ms; 4,348 KB
testcase_21	AC	2 ms; 4,352 KB
testcase_22	AC	2 ms; 4,352 KB

ソースコード

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout << *_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstream sout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all(*_First), sep); }return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x;	x = x * x;	n >>= 1; }return res; }
inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define tostr(a)	toString(a)

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e13 + 9;

#define int ll

signed main(){
	ld xa, ya;
	ld xb, yb;
	cin >> xa >> ya >> xb >> yb;
	
	ld l = -INF, r = INF;
	while (1){
		ld y1 = l + (r - l) / 3.0;
		ld y2 = r - (r - l) / 3.0;

		ld l1 = sqrt(sqr(y1 - ya) + sqr(xa)) + sqrt(sqr(y1 - yb) + sqr(xb));
		ld l2 = sqrt(sqr(y2 - ya) + sqr(xa)) + sqrt(sqr(y2 - yb) + sqr(xb));
		
		if (l1 > l2){
			l = y1;
		}
		else{
			r = y2;
		}
		if (r - l < 1e-10)break;
	}
	cout << fixed << setprecision(30) << l << endl;

	return 0;
}