Codeforces Round #353 (Div. 2) -- B. Restoring Painting (规律)

 

B. Restoring Painting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He remembers some facts about it.

• The painting is a square 3 × 3, each cell contains a single integer from 1 to n, and different cells may contain either different or equal integers.
• The sum of integers in each of four squares 2 × 2 is equal to the sum of integers in the top left square 2 × 2.
• Four elements a, b, c and d are known and are located as shown on the picture below.

Help Vasya find out the number of distinct squares the satisfy all the conditions above. Note, that this number may be equal to 0, meaning Vasya remembers something wrong.

Two squares are considered to be different, if there exists a cell that contains two different integers in different squares.

Input

The first line of the input contains five integers n, a, b, c and d (1 ≤ n ≤ 100 000, 1 ≤ a, b, c, d ≤ n) — maximum possible value of an integer in the cell and four integers that Vasya remembers.

Output

Print one integer — the number of distinct valid squares.

Examples

input

2 1 1 1 2

output

2

input

3 3 1 2 3

output

6

Note

Below are all the possible paintings for the first sample.

In the second sample, only paintings displayed below satisfy all the rules.

 

题意：给出一个 3 * 3  的 9 宫格且已知其中四个格子所代表的数a, b, c, d 如图所示，

           每 2 个格子值可相等也可不等（没限制），值的范围在 1 -- n 之间，问有多少

           种方式把“问号”格子填满数，要求每四个相邻格子组成的正方形的和等于左上

           角的四个格子的和。

思路：9 个格子共有 4  个小正方形（每个正方形由 4  个小格子组成）

           由中心格子出发，有 1 -- n 个数共 n  种，再算出四个正方形已知数的和的最大值

           与最小值，用 （n 减去这个差值）（>=0）就得到最小值那个正方形的填法数，只

           要这个最小值的正方形满足条件，介于最大值与最小值的 2 个正方形的值肯定可以

           填充，这是中心值取 1 -- n 某个数时的填法数，再乘以 n 即得到总填法数。

代码如下：

#include <iostream>
#include <cstdio>
#include  <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define ll long long

int main()
{
#ifdef OFFLINE
	freopen("t.txt", "r", stdin);
#endif
	int n, a, b, c, d;
	while(~scanf("%d%d%d%d%d", &n, &a, &b, &c, &d))
	{
		int Max = -inf, Min = inf;
		//求出 4 个正方形和的最大与最小值
		Max = max(a+b, max(a+c, max(b+d, c+d)));
		Min = min(a+b, min(a+c, min(b+d, c+d)));
		ll ans = 0;
		ans = Max-Min;
		if(ans<=n)    //差值必须小于或等于 n 
			ans = (n-ans)*n; //共 n 大类
		else  //否则为 0 种
			ans=0;
		printf("%lld\n", ans);
	}
	return 0;
}