Fight Against Traffic

题意翻译

题意描述: 给你一张无向图,一共有n个点(2 <= n <= 1000),由m条边连接起来(1 <= m <= 10000),现在要在任意一对没有连边的点之间连上一条边,并且保证s到t之间的最短路径长度不变(最短路径长度表示s到t最少经过的边的数量)(1 <= s,t <= n , s≠t),请你求出一共有多少条这样的边。 输入格式: 第一行输入n,m,s,t。 第二行到第m+1行每行共有两个数,表示这两个点之间有一条边。 输出格式: 一共一行,表示合法的加边方案数。 感谢@zhaotiensn 提供的翻译

题目描述

Little town Nsk consists of $ n $ junctions connected by $ m $ bidirectional roads. Each road connects two distinct junctions and no two roads connect the same pair of junctions. It is possible to get from any junction to any other junction by these roads. The distance between two junctions is equal to the minimum possible number of roads on a path between them. In order to improve the transportation system, the city council asks mayor to build one new road. The problem is that the mayor has just bought a wonderful new car and he really enjoys a ride from his home, located near junction $ s $ to work located near junction $ t $ . Thus, he wants to build a new road in such a way that the distance between these two junctions won't decrease. You are assigned a task to compute the number of pairs of junctions that are not connected by the road, such that if the new road between these two junctions is built the distance between $ s $ and $ t $ won't decrease.

输入输出格式

输入格式


The firt line of the input contains integers $ n $ , $ m $ , $ s $ and $ t $ ( $ 2<=n<=1000 $ , $ 1<=m<=1000 $ , $ 1<=s,t<=n $ , $ s≠t $ ) — the number of junctions and the number of roads in Nsk, as well as the indices of junctions where mayors home and work are located respectively. The $ i $ -th of the following $ m $ lines contains two integers $ u_{i} $ and $ v_{i} $ ( $ 1<=u_{i},v_{i}<=n $ , $ u_{i}≠v_{i} $ ), meaning that this road connects junctions $ u_{i} $ and $ v_{i} $ directly. It is guaranteed that there is a path between any two junctions and no two roads connect the same pair of junctions.

输出格式


Print one integer — the number of pairs of junctions not connected by a direct road, such that building a road between these two junctions won't decrease the distance between junctions $ s $ and $ t $ .

输入输出样例

输入样例 #1

5 4 1 5
1 2
2 3
3 4
4 5

输出样例 #1

0

输入样例 #2

5 4 3 5
1 2
2 3
3 4
4 5

输出样例 #2

5

输入样例 #3

5 6 1 5
1 2
1 3
1 4
4 5
3 5
2 5

输出样例 #3

3