Invade the Mars dijsktra()&&优先队列

Problem Description

It's now the year 21XX,when the earth will explode soon.The evil U.S. decided to invade the Mars to save their lives.
But the childlike Marsmen never keeps any army,because war never take place on the Mars.So it's very convenient for the U.S. to act the action.
Luckily,the Marsmen find out the evil plan before the invadation,so they formed a defense system.The system provides enchantment for some citys,and the enchantment generator for city A maybe set in city B,and to make things worse,both city B and C and more will provide echantment for city A.
The satelite of U.S. has got the map of the Mars.And they knows that when they enter a city,they can destory all echantment generator in this city at once,and they can enter a city only if they has destoryed all enchantment generator for this city,but troops can stay at the outside of the city and can enter it at the moment its echantment is destoryed.Of course the U.S. army will face no resistance because the Mars keep no army,so troops can invade in many way at the same time.
Now the U.S. will invade the Mars,give you the map,your task is to calculate the minimium time to enter the capital of the Mars.

 

Input

The first line contains an integer T,which is the number of test cases.
For each testcase:
The first line contains two integers N and M,1<=N<=3000,1<=M<=70000,the cities is numbered from 1 to N and the U.S. landed on city 1 while the capital of the Mars is city N.
The next M lines describes M paths on the Mars.Each line contains three integers ai,bi and wi,indicates there is a unidirectional path form ai to bi lasts wi minutes(1<=wi<=10^8).
The next N lines describes N citys,the 1+M+i line starts with a integer li,followed with li integers, which is the number of cities has a echantment generator protects city i.
It's guaranteed that the city N will be always reachable.

 

Output

For each case,print a line with a number indicating the minimium time needed to enter the capital of the Mars.

 

Sample Input

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

 

Sample Output

5

Hint

The Map is like this:
We can follow these ways to achieve the fastest speed:
1->2->3,1->2->5,1->4->6.

 **************************************************************************************************************************

dijskstra（）&&优先队列

***************************************************************************************************************************

/*
  用优先队列，每一次把度数为0的点和最短路径的点计入队列
  最终还是用dijkstra()
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define eps 1e-9
#define pi acos(-1.0)
using namespace std;
typedef long long ll;
const int maxn=3000+10;
const int maxm=70000+10;
struct Edge
{
    int v,w,next;
};
struct HeapNode
{
    int d,u;
    bool operator < (const HeapNode &a) const
    {
        return d>a.d;
    }
};
Edge edges[maxm<<1];
int head[maxn],pro[maxn],nEdge,n,m;
bool vis[maxn];
ll d[maxn],dt[maxn];
vector<int>lim[maxn];
void AddEdge(int u,int v,int w)
{
    nEdge++;
    edges[nEdge].v=v;
    edges[nEdge].w=w;
    edges[nEdge].next=head[u];
    head[u]=nEdge;
}
void Init()
{
    for(int i=0;i<=n;++i) lim[i].clear();
    memset(head,0xff,sizeof(head));
    memset(dt,0,sizeof(dt));
    memset(pro,0,sizeof(pro));
    memset(vis,0,sizeof(vis));
    nEdge=-1;
}
void dijkstra()
{
    for(int i=1;i<=n;++i) d[i]=Inf;
    d[1]=0;
    priority_queue<HeapNode>q;
    HeapNode hp;
    hp.d=0;hp.u=1;
    q.push(hp);
    int u,v,sz;
    while(!q.empty())
    {
        hp=q.top();q.pop();
        u=hp.u;
        if(vis[u]) continue;
        vis[u]=true;
        sz=lim[u].size();
        for(int i=0;i<sz;++i)
        {
            v=lim[u][i];
            pro[v]--;
            dt[v]=max(dt[v],d[u]);
            if(pro[v]==0&&d[v]!=Inf)
            {
                d[v]=max(dt[v],d[v]);
                hp.u=v;hp.d=d[v];
                q.push(hp);
            }
        }
        for(int k=head[u];k!=-1;k=edges[k].next)
        {
            v=edges[k].v;
            if(d[v]>d[u]+edges[k].w)
            {
                d[v]=max(d[u]+edges[k].w,dt[v]);
                hp.u=v;hp.d=d[v];
                if(pro[v]==0) q.push(hp);
            }
        }
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        Init();
        int u,v,w;
        for(int i=0;i<m;++i)
        {
            scanf("%d%d%d",&u,&v,&w);
            AddEdge(u,v,w);
        }
        for(int i=1;i<=n;++i)
        {
            scanf("%d",&u);
            pro[i]=u;
            while(u--)
            {
                scanf("%d",&v);
                lim[v].push_back(i);
            }
        }
        dijkstra();
        printf("%I64d
",d[n]);
    }
    return 0;
}