题目详情题解（0）讨论（0）提交记录（0）

CF1680A.Minimums and Maximums

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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

  • there are at least l1l_1 and at most r1r_1 elements in the array equal to its minimum;
  • there are at least l2l_2 and at most r2r_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 33 elements equal to its minimum ( 11 -st, 33 -rd and 77 -th) and 22 elements equal to its maximum ( 44 -th and 55 -th).

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

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

输入格式

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

Each test case consists of one line containing four integers l1l_1 , r1r_1 , l2l_2 and r2r_2 ( 1≤l1≤r1≤501 \le l_1 \le r_1 \le 50 ; 1≤l2≤r2≤501 \le l_2 \le r_2 \le 50 ).

输出格式

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

输入输出样例

  • 输入#1

    7
3 5 4 6
5 8 5 5
3 3 10 12
1 5 3 3
1 1 2 2
2 2 1 1
6 6 6 6

    输出#1

    4
5
13
3
3
3
6

说明/提示

Optimal arrays in the test cases of the example:

  1. [1,1,1,1][1, 1, 1, 1] , it has 44 minimums and 44 maximums;
  2. [4,4,4,4,4][4, 4, 4, 4, 4] , it has 55 minimums and 55 maximums;
  3. [1,2,1,2,2,1,2,2,2,2,2,2,2][1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2] , it has 33 minimums and 1010 maximums;
  4. [8,8,8][8, 8, 8] , it has 33 minimums and 33 maximums;
  5. [4,6,6][4, 6, 6] , it has 11 minimum and 22 maximums;
  6. [3,4,3][3, 4, 3] , it has 22 minimums and 11 maximum;
  7. [5,5,5,5,5,5][5, 5, 5, 5, 5, 5] , it has 66 minimums and 66 maximums.
首页