Celex Update codeforces 1358 C

最新推荐文章于 2021-03-03 17:25:40 发布

weixin_45608039 多巴胺

最新推荐文章于 2021-03-03 17:25:40 发布

阅读量190

点赞数

分类专栏： codeforce

本文链接：https://blog.csdn.net/weixin_45608039/article/details/106391020

版权

codeforce 专栏收录该内容

48 篇文章 1 订阅

订阅专栏

. Celex Update
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
During the quarantine, Sicromoft has more free time to create the new functions in “Celex-2021”. The developers made a new function GAZ-GIZ, which infinitely fills an infinite table to the right and down from the upper left corner as follows:
在这里插入图片描述
The cell with coordinates (x,y) is at the intersection of x-th row and y-th column. Upper left cell (1,1) contains an integer 1.
The developers of the SUM function don’t sleep either. Because of the boredom, they teamed up with the developers of the RAND function, so they added the ability to calculate the sum on an arbitrary path from one cell to another, moving down or right. Formally, from the cell (x,y) in one step you can move to the cell (x+1,y) or (x,y+1).

After another Dinwows update, Levian started to study “Celex-2021” (because he wants to be an accountant!). After filling in the table with the GAZ-GIZ function, he asked you to calculate the quantity of possible different amounts on the path from a given cell (x1,y1) to another given cell (x2,y2), if you can only move one cell down or right.

Formally, consider all the paths from the cell (x1,y1) to cell (x2,y2) such that each next cell in the path is located either to the down or to the right of the previous one. Calculate the number of different sums of elements for all such paths.

Input
The first line contains one integer t (1≤t≤57179) — the number of test cases.

Each of the following t lines contains four natural numbers x1, y1, x2, y2 (1≤x1≤x2≤109, 1≤y1≤y2≤109) — coordinates of the start and the end cells.

Output
For each test case, in a separate line, print the number of possible different sums on the way from the start cell to the end cell.

Example
inputCopy
4
1 1 2 2
1 2 2 4
179 1 179 100000
5 7 5 7
outputCopy
2
3
1
1
Note
In the first test case there are two possible sums: 1+2+5=8 and 1+3+5=9.
在这里插入图片描述
解法一
刚开始感觉是求组合数，C31 ,C42之类的，但是，如果仔细考虑一下，这道题可以转化为最大值-最小值，因为每个情况的值排列在一起是11 ，12 ，13,14 这种情况，那么种类个数
就为14-11+1=4；而求最大值和最小值不好求，但是可以直接求最大值与最小值的差，
在这里插入图片描述
从1到13，最大值-最小值=（1+3+6+9+13）-（1+2+4+8+13）；去除1和13；**那么就是对角线上的值相减，而对脚线上的值相减，3-2=1，这个值就是方块2和方块3的共同的边角的点，有一个点，为1,
6-4=2；方块6方块5的共同的边角的点，方块5与方块4共同的边角的点，有两个点为2，那么就转化为了求方块与方块之间的共同的边角点的个数，**整个大方块的边界除外，那么点的个数就为（3-1）（3-1）=4；也就是（x2-x1）(y2-y1)。最终结果就是（x2-x1）*(y2-y1)+1。
解法二大胆一点，瞎猜一下，嗯，蒙对了。