POJ-2449 Remmarguts' Date k短路

#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1010;
const int inf = 1<<29;
int n,m;
int dis[maxn],outque[maxn],vis[maxn];
struct node
{
    int id,w;
    node( int a,int b ) { id = a; w = b; }
};
struct Node
{
  int to;
  int g,f;
  bool operator < ( const Node &r ) const
  {
      if( r.f == f )    return r.g < g;
      return r.f < f;
  }
};
vector<node>map[maxn],maps[maxn];

bool SPEA( int s )
{
    queue<int>que;
    memset( outque,0,sizeof(outque) );
    memset( vis,0,sizeof(vis) );
    for( int i = 0; i < n; i ++ )
        dis[i] = inf;
    dis[s] = 0;
    que.push( s );
    vis[s] = true;
    while( !que.empty() )
    {
        int x = que.front(); que.pop();
        vis[x] = false;
        outque[x] ++;
        if( outque[x] > n )
            return false;
        for( int i = 0; i < map[x].size(); i ++ )
        {
            node u = map[x][i];
            if( u.w != inf && dis[u.id] > dis[x] + u.w )
            {
                dis[u.id] = dis[x] + u.w;
                if( !vis[u.id] )
                {
                    vis[u.id] = true;
                    que.push( u.id );
                }
            }
        }
    }
    return true;
}

int Astar( int start,int end,int k )
{
    Node e,u;
    int cnt = 0;        //标记终点出队次数
    priority_queue<Node>que;
    if( start == end )
        k ++;
    if( dis[start] == inf )
        return -1;
    e.to = start;   e.g = 0;
    e.f = e.g + dis[e.to];
    que.push(e);
    while( !que.empty() )
    {
        e = que.top(); que.pop();
        if( e.to == end )
            cnt ++;
        if( cnt == k )
        {
            return e.g;
        }
        for( int i = 0; i < maps[e.to].size(); i ++ )
        {
            node v = maps[e.to][i];
            u.to = v.id;
            u.g = e.g + v.w;
            u.f = u.g + dis[u.to];
            que.push(u);
        }
    }
    return -1;
}

int main()
{
    //freopen("data.txt","r",stdin);
    int a,b,c,s,e,k;
    while( scanf("%d%d",&n,&m) == 2 )
    {
		for( int i = 1; i <= n; i ++ )
			map[i].clear();
        for( int i = 1; i <= m; i ++ )
        {
            scanf("%d%d%d",&a,&b,&c);
            maps[a].push_back( node(b,c) );
            map[b].push_back( node(a,c) );
        }
		scanf("%d%d%d",&s,&e,&k);
        SPEA( e );
        int ans = Astar( s,e,k );
        printf("%d\n",ans);
    }
    return 0;
}