http://pat.zju.edu.cn/contests/pat-practise/1003

1003. Emergency (25)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible.

Input

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (<= 500) - the number of cities (and the cities are numbered from 0 to N-1), M - the number of roads, C1 and C2 - the cities that you are currently in and that you must save, respectively. The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city. Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively. It is guaranteed that there exists at least one path from C1 to C2.

Output

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather.
All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

Sample Input

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

Sample Output

2 4

不要设置S集的标记，为嘛呢？不然只能访问一次啊，怎么计数呢？

ans初始值应该为1，为嘛呢？一般情况都是对的，就是当起点和终点相同时是错的，自己到自己是算一条路，不是算0条路。

中午睡不了觉，下午就坑爹了。尼玛！又没信心了！

 #include
 #include
 #include
 #include
 #include
 #include
 #include
 #include
 using namespace std;
 #define MAX 0x6FFFFFFF
 int nums[501];
 int map[501][501];
 int dis[501];
 int ps[501];
 struct Node{
     int dis;
     int people;
     int th;
     bool operator<(const Node& node)const{
         if(dis!=node.dis)
             return dis
         return people>node.people;
     }
 };
 priority_queue q;
 int main(){

     //freopen("in.txt", "r", stdin);

     int n, m;
     int s, t;
     int a, b, d;
     int test;
     while(cin>>n>>m>>s>>t){
         for(int i=0;i
             scanf("%d", nums+i);
             dis[i] = MAX;
         }
         for(int i=0;i
             for(int j=0;j
                 map[i][j] = MAX;
         for(int i=0;i
             scanf("%d%d%d", &a, &b, &d);
             map[a][b] = map[b][a] = d;
         }

         memset(ps, 0, sizeof(ps));
         dis[s] = 0;
         ps[s] = nums[s];
         Node node;
         node.th = s;
         node.dis = 0;
         node.people = nums[s];
         q.push(node);
         int ans = 1;
         while(!q.empty()){
             Node node  = q.top();
             q.pop();
             for(int i=0;i
                 if(map[node.th][i]!=MAX){
                     bool flag = false;
                     if(dis[node.th]+map[node.th][i]
                         dis[i] = dis[node.th]+map[node.th][i];
                         ps[i] = ps[node.th] + nums[i];
                         flag = true;
                         if(i==t){
                             ans = 1;
                         }

                     }else if(dis[node.th]+map[node.th][i]==dis[i]){

                         if(i==t){
                             ans++;
                         }
                         if(ps[node.th]+nums[i]>ps[i]){
                             flag = true;
                             ps[i] = ps[node.th] + nums[i];
                         }

                     }
                     if(flag){
                         Node tmp;
                         tmp.th = i;
                         tmp.dis = dis[i];
                         tmp.people = ps[i];
                         q.push(tmp);

                     }
                 }
             }
         }

         printf("%d %d\n", ans, ps[t]);

     }

     //fclose(stdin);
     return 0;
 }