Shortest Path(最短路)

Shortest Path

 

 Accepts: 40

 

 Submissions: 610

 Time Limit: 4000/2000 MS (Java/Others)

 

 Memory Limit: 131072/131072 K (Java/Others)

Problem Description

There is a path graph G=(V,E)G=(V,E) with nn vertices. Vertices are numbered from 11 to nn and there is an edge with unit length between iiand i + 1i+1 (1 \le i < n)(1≤i<n). To make the graph more interesting, someone adds three more edges to the graph. The length of each new edge is 11.

You are given the graph and several queries about the shortest path between some pairs of vertices.

Input

There are multiple test cases. The first line of input contains an integer TT, indicating the number of test cases. For each test case:

The first line contains two integer nn and mm (1 \le n, m \le 10^5)(1≤n,m≤10​5​​) -- the number of vertices and the number of queries. The next line contains 6 integers a_1, b_1, a_2, b_2, a_3, b_3a​1​​,b​1​​,a​2​​,b​2​​,a​3​​,b​3​​ (1 \le a_1,a_2,a_3,b_1,b_2,b_3 \le n)(1≤a​1​​,a​2​​,a​3​​,b​1​​,b​2​​,b​3​​≤n), separated by a space, denoting the new added three edges are (a_1,b_1)(a​1​​,b​1​​), (a_2,b_2)(a​2​​,b​2​​), (a_3,b_3)(a​3​​,b​3​​).

In the next mm lines, each contains two integers s_is​i​​ and t_it​i​​ (1 \le s_i, t_i \le n)(1≤s​i​​,t​i​​≤n), denoting a query.

The sum of values of mm in all test cases doesn't exceed 10^610​6​​.

Output

For each test cases, output an integer S=(\displaystyle\sum_{i=1}^{m} i \cdot z_i) \text{ mod } (10^9 + 7)S=(​i=1​∑​m​​i⋅z​i​​) mod (10​9​​+7), where z_iz​i​​ is the answer for ii-th query.

Sample Input

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

Sample Output

7
题解：最短路，本来完全暴力的最短路，果断超时，最后听了大神的想法，是求加的那三条边的最短路；让每次给的u,v找u到那三个起点的距离与
d[v]的和与v-u找最小值；还是超时，先放着吧，明天再看；
代码：

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<map>
 7 #include<string>
 8 using namespace std;
 9 const int INF=0x3f3f3f3f;
10 #define SI(x) scanf("%d",&x)
11 #define PI(x) printf("%d",x)
12 #define P_ printf(" ")
13 #define mem(x,y) memset(x,y,sizeof(x))
14 const int MAXN=1e5+100;
15 const int MOD=1e9+7;
16 int head[MAXN<<1];
17 int vis[MAXN];
18 int n,m;
19 int d1[MAXN],d2[MAXN],d3[MAXN];
20 int d[MAXN];
21 struct Node{
22     int from,to,next;
23 };
24 Node dt[MAXN<<1];
25 int edgnum;
26 void add(int u,int v){
27     dt[edgnum].from=u;dt[edgnum].to=v;
28     dt[edgnum].next=head[u];
29     head[u]=edgnum++;
30 }
31 void dijkscra(int u){
32     mem(vis,0);
33     mem(d,INF);
34     d[u]=0;
35     while(true){
36         int k=-1;
37         for(int i=1;i<=n;i++){
38             if(!vis[i])if(k==-1||d[i]<d[k])k=i;
39         }
40         if(k==-1)break;
41         vis[k]=1;
42         for(int i=head[k];i!=-1;i=dt[i].next){
43             int u=dt[i].from,v=dt[i].to;
44             //printf("%d %d\n",u,v);
45             d[v]=min(d[v],d[u]+1);
46         }
47     }
48 }
49 
50 /*
51 int temp;
52 void dfs(int u,int v,int t){
53     if(t>n)return;
54     if(u==v){
55         temp=min(temp,t);
56         return;
57     }
58     for(int i=head[u];i!=-1;i=dt[i].next){
59         dfs(dt[i].to,v,t+1);
60     }
61 }
62 */
63 int main(){
64     int T;
65     SI(T);
66     while(T--){
67         SI(n);SI(m);
68         int a1,a2,a3,b1,b2,b3;
69         edgnum=0;mem(head,-1);
70         for(int i=1;i<n;i++)add(i,i+1),add(i+1,i);
71         scanf("%d%d%d%d%d%d",&a1,&b1,&a2,&b2,&a3,&b3);
72         add(a1,b1);add(b1,a1);add(a2,b2);add(b2,a2);add(a3,b3);add(b3,a3);
73         __int64 ans=0;
74         dijkscra(a1);
75         for(int i=1;i<=n;i++)d1[i]=d[i];
76         dijkscra(a2);
77         for(int i=1;i<=n;i++)d2[i]=d[i];
78         dijkscra(a3);
79         for(int i=1;i<=n;i++)d3[i]=d[i];
80         
81         for(int i=1;i<=m;i++){
82             int u,v;
83             scanf("%d%d",&u,&v);
84             /*dijkscra(u);*/
85             int temp=min(min(abs(v-u),abs(u-a1)+d1[v]),min(abs(u-a2)+d2[v],abs(u-a3)+d3[v]));
86             //printf("%d\n",temp);
87             ans=(ans+temp*i)%MOD;
88         }
89         printf("%I64d\n",ans);
90     }
91     return 0;
92 }