CodeForces 351 B Problems for Round

I - Problems for Round

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

There are n problems prepared for the next Codeforces round. They are arranged in ascending order by their difficulty, and no two problems have the same difficulty. Moreover, there are m pairs of similar problems. Authors want to split problems between two division according to the following rules:

• Problemset of each division should be non-empty.
• Each problem should be used in exactly one division (yes, it is unusual requirement).
• Each problem used in division 1 should be harder than any problem used in division 2.
• If two problems are similar, they should be used in different divisions.

Your goal is count the number of ways to split problem between two divisions and satisfy all the rules. Two ways to split problems are considered to be different if there is at least one problem that belongs to division 1 in one of them and to division 2 in the other.

Note, that the relation of similarity is not transitive. That is, if problem i is similar to problem j and problem j is similar to problem k, it doesn't follow that i is similar to k.

Input

The first line of the input contains two integers n and m (2 ≤ n ≤ 100 000, 0 ≤ m ≤ 100 000) — the number of problems prepared for the round and the number of pairs of similar problems, respectively.

Each of the following m lines contains a pair of similar problems u_i and v_i (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i). It's guaranteed, that no pair of problems meets twice in the input.

Output

Print one integer — the number of ways to split problems in two divisions.

Sample Input

Input

5 2
1 4
5 2

Output

2

Input

3 3
1 2
2 3
1 3

Output

0

Input

3 2
3 1
3 2

Output

1

好题！！！

题意:把1到n这些数放到两个容器里,要求第一个容器里的任何数都小于第二个容器里的任何数,还有就是相似的不能放一块,相似没有传递性;

思路：把最大的放第一个，最小的放第二个，对于两个相近的，大的放第一个，小的放第二个，并更新最大最小值

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int n,m,a,b,i,x,y,t;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		a=1;
		b=n;
		for(i=0;i<m;i++)
		{
			scanf("%d%d",&x,&y);
			if(x>y)
			{
				t=x;
				x=y;
				y=t;
			}
			a=max(a,x);
			b=min(b,y);
		}
		printf("%d\n",max(b-a,0));
	}
	return 0;
}