[Solution] Minimums and Maximums Codeforces Solution | Codeforces Problem Solution 2022

[Solution] Minimums and Maximums Codeforces Solution | Codeforces Problem Solution 2022

A. Minimums and Maximums

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

An array is beautiful if both of the following two conditions meet:

• there are at least 𝑙1$l_1$ and at most 𝑟1$r_1$ elements in the array equal to its minimum;
• there are at least 𝑙2$l_2$ and at most 𝑟2$r_2$ elements in the array equal to its maximum.

For example, the array [2,3,2,4,4,3,2]$[2,3,2,4,4,3,2]$ has 3$3$ elements equal to its minimum (1$1$-st, 3$3$-rd and 7$7$-th) and 2$2$ elements equal to its maximum (4$4$-th and 5$5$-th).

Solution Click Below:-  CLICK HERE

Another example: the array [42,42,42]$[42,42,42]$ has 3$3$ elements equal to its minimum and 3$3$ elements equal to its maximum.

Minimums and Maximums Codeforces Solution 

Robots Codeforces Solution 

Binary String Codeforces Solution

Dog Walking Codeforces Solution

Moving Chips Codeforces Solution

Lenient Vertex Cover Codeforces Solution 

Your task is to calculate the minimum possible number of elements in a beautiful array.

Input

The first line contains one integer 𝑡$t$ (1≤𝑡≤5000$1\le t\le 5000$) — the number of test cases.

Each test case consists of one line containing four integers 𝑙1$l_1$, 𝑟1$r_1$, 𝑙2$l_2$ and 𝑟2$r_2$ (1≤𝑙1≤𝑟1≤50$1\le l_1\le r_1\le 50$; 1≤𝑙2≤𝑟2≤50$1\le l_2\le r_2\le 50$).

Output

For each test case, print one integer — the minimum possible number of elements in a beautiful array.