TASK

Problem

#77

In “Intervals Intersect”, solve the stated coordinate or interval relation using integer comparisons.

EXAMPLE

Example

Input

1 1 3 3

Output

NO

LIMITS

Constraints

Coordinate magnitudes are at most 10^9; interval endpoints are given in nondecreasing order.

📖

LEARN Theory for this problem

+

Coordinate tasks often reduce to comparisons, absolute differences, `min`, and `max`.

Connection to “Intervals Intersect”: here, intermediate values are best kept in named variables so the formula stays readable and data types remain clear.

💡

NEED HELP? Hints

+

['Translate the geometry into inequalities before coding.', 'After solving “Intervals Intersect”, verify the algorithm on your own small example and on an allowed boundary case. Print only the required result with no extra text.']

✓

ANSWER Solution

+

#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
int main() {
    long long a,b,c,d;
    cin >> a >> b >> c >> d;
    cout << (max(a,c)<=min(b,d) ? "YES" : "NO") << '\n';
    return 0;
}