Submission #70747126

---

Source Code Expand

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		vector<long long>a(4);
		rep(i, 4)cin >> a[i];
		bool chk = false;
		rep(i, 4) {
			long long x = a[0] + a[1];
			long long y = a[2] + a[3];
			long long z = abs(a[2] - a[3]);
			// z<x < y
			//double mina = sqrt(a[0] * a[0] + a[1] * a[1]);//
			//double maxa = a[0] + a[1];

			//double minb = abs(a[2] - a[3]);//ok
			//double maxb = a[2] + a[3];//ng

			if (z < x && x < y)chk = true;
			rotate(a.rbegin(), a.rbegin() + 1, a.rend());

		}

		cout << (chk ? "Yes" : "No") << endl;
	}
	return 0;
}

Submission Info

Judge Result