HDU 2377 Bus Pass SPFA

Problem Descriptionyou travel a lot by bus and the costs of all the seperate tickets is starting to add up.

Therefore you want to see if it might is advantageous for your to buy a bus pass.

The bus system works in your country (and also in the Netherlands) are as follows:

When you buy a bus pass, you have to indicate a center zone and a star value. You were allowed to travel freely in any zone which have a distance to your center zone which was less than your star value. For example, if you had a star value of one, you can only travel in your center zone. If you have a star value of both, you can also travel in all adjacent zones, et cetera.

You had a list of all buses trips you frequently make, and would like to determine the minimum star value you need to make All these trips using your Buss pass. It's not always a easy task. For example look at the following figure:



Here's want to is able to travel from A to B and from B to D. The best center zone is 7400, for which you need a star value of 4. Note that does not even visit this zone on your trips!

Inputon the first line an Integert (1 <=t<=): The number of test cases. Then to each test case:

One line with INTEGERSNZ (2 <=nz<= 9 999) ANDNR (1 <=nr<=): The number of zones and the number of bus tri PS, respectively.

NZ lines starting with integers idi (1 <= IDI <= 9 999) and Mzi (1 <= mzi <=), a number identifying the I-th Zone and the number of zones adjacent to it, followed by Mzi integers:the numbers of the adjacent zones.

NR lines starting with one integer MRI (1 <= MRI <=), indicating the number of zones the ith bus trip visits, fol lowed by MRI integers:the numbers of the zones through which the bus passes in the order in which they is visited.

All zones is connected, either directly or via other zones.


Outputfor each test case:

One line with both integers, the minimum star value and the ID of a center zone which achieves this minimum star value. If There is multiple possibilities, choose the zone with the lowest number.


Sample Input

117 27400 6 7401 7402 7403 7404 7405 74067401 6 7412 7402 7400 7406 7410 74117402 5 7412 7403 7400 7401 74117403 6 7413 74 14 7404 7400 7402 74127404 5 7403 7414 7415 7405 74007405 6 7404 7415 7407 7408 7406 74007406 7 7400 7405 7407 7408 7409 7 410 74017407 4 7408 7406 7405 74157408 4 7409 7406 7405 74077409 3 7410 7406 74087410 4 7411 7401 7406 74097411 5 7416 741 2 7402 7401 74107412 6 7416 7411 7401 7402 7403 74137413 3 7412 7403 74147414 3 7413 7403 74047415 3 7404 7405 74077416 2 7411 74125 7409 7408 7407 7405 74156 7415 7404 7414 7413 7412 7416

Sample Output

4 7400A total of M regions and N bus lines to find the nearest area of all public transport stations BFS or SPFA all public transport stations use an array to record the distance from all bus stations to I farthest i:1~10000Finally, finding the smallest one in all the farthest distances is the answer code:
#include <iostream> #include <cstdio> #include <cstring> #include <vector> #include <queue    > #define MAX 9999999using namespace std;vector<int>q[10005];     adjacency table int max_dis[10005];    Record the furthest distance int dis[10005];int vis[10005];int m,n;void spfa (int start) {queue<int>qq;    int i,j,head;        for (I=1; i<=10000; i++) {vis[i]=0;    Dis[i]=max;    } if (Max_dis[start]==-1)//distance itself is 1 max_dis[start]=1;    Dis[start]=1;    Qq.push (start);        while (!qq.empty ()) {Head=qq.front ();        Qq.pop ();        vis[head]=0;        int V;            for (i=0; I<q[head].size (); i++) {v=q[head][i];                if (dis[v]>dis[head]+1) {dis[v]=dis[head]+1;                if (Max_dis[v]<dis[v])//Find the furthest distance max_dis[v]=dis[v];                    if (!vis[v]) {vis[v]=1;                Qq.push (v); }            }        }    } return;    int main () {int t,i,j;    scanf ("%d", &t);            while (t--) {for (i=0;i<=10000;i++) {q[i].clear ();        Max_dis[i]=-1;        } scanf ("%d%d", &m,&n);        int u,v,w=1,mm,nn;            while (m--) {scanf ("%d%d", &u,&nn);                while (nn--) {scanf ("%d", &v);            Q[u].push_back (v);            }} while (n--) {scanf ("%d", &nn);                while (nn--) {scanf ("%d", &mm);            SPFA (mm);        }} int minn=max,x=1;                for (I=1; i<=10000; i++) {if (max_dis[i]<minn&&max_dis[i]!=-1) {                Minn=max_dis[i];            X=i;    }} cout<<minn<< ' <<x<<endl; } return 0;}

HDU 2377 Bus Pass SPFA