记录编号	118226	评测结果	AAAAAAAAAA
题目名称	[USACO Mar08] 牛跑步	最终得分	100
用户昵称	HouJikan	是否通过	通过
代码语言	C++	运行时间	0.018 s
提交时间	2014-09-04 22:16:39	内存使用	0.34 MiB

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <vector>
#include <ctime>
#include <iterator>
#include <functional>
#define pritnf printf
#define scafn scanf
#define For(i,j,k) for(int i=(j);i<=(k);(i)++)
using namespace std;
typedef long long LL;
typedef unsigned int Uint; 
const int INF=0x7ffffff;
//==============struct declaration==============
struct adj
{
  int from,to,dist;
  adj(int from=0,int to=0,int dist=0):from(from),to(to),dist(dist){}
};
struct anode
{
  int to,cost,g;
  anode(int to=0,int cost=0,int g=0):to(to),cost(cost),g(g){}
  bool operator< (const anode &rhs) const
  {
    return cost+g>rhs.cost+rhs.g;
  }
};
struct node
{
  int to,dist;
  node(int to=0,int dist=0):to(to),dist(dist){}
  bool operator <(const node &rhs) const
  {
    return dist>rhs.dist;
  }
};
//==============var declaration=================
const int MAXN=1010;
int n,m,k;
vector <adj> Edge1[MAXN],Edge2[MAXN];
int dist[MAXN];
bool vis[MAXN];
//==============function declaration============
void djistra();
void Astar();
//==============main code=======================
int main()
{  
  string FileName="cowjog";//程序名 
  string FloderName="COGS";//文件夹名 
  freopen((FileName+".in").c_str(),"r",stdin);
  freopen((FileName+".out").c_str(),"w",stdout);
#ifdef DEBUG  
  system(("cp C:\\Users\\Administrator\\Desktop\\"+FloderName+"\\standard.cpp C:\\Users\\Administrator\\Desktop\\"+FloderName+"\\submit.txt").c_str());
  clock_t Start_Time=clock();
#endif    
  scanf("%d%d%d",&n,&m,&k);
  //从1-n号点
  int s,e,t;
  For(i,1,m)
  {
    scanf("%d%d%d",&s,&e,&t);
    if (s>e) s^=e^=s^=e;
    Edge1[s].push_back(adj(s,e,t));
    Edge2[e].push_back(adj(e,s,t));
  }
  djistra();
  Astar();
#ifdef DEBUG  
  clock_t End_Time=clock();
  cout<<endl<<endl<<"Time Used: "<<double(End_Time-Start_Time)/CLOCKS_PER_SEC<<endl;
#endif    
  return 0;
}
//================fuction code====================
void djistra()//从n跑到1 
{
   For(i,1,n)
     dist[i]=INF;
   dist[n]=0;
   memset(vis,0,sizeof(vis));
   int cnt=0;
   priority_queue <node>Q;
   Q.push(node(n,0));
   while(!Q.empty())
   {
     node now=Q.top();Q.pop();
     if (vis[now.to]) continue;
       vis[now.to]=true;
     int siz=Edge2[now.to].size()-1;
     For(i,0,siz)
     {
       adj &e=Edge2[now.to][i];
       if (!vis[e.to])
         if (dist[e.to]>dist[now.to]+e.dist)
         {
           dist[e.to]=dist[now.to]+e.dist;
           Q.push(node(e.to,dist[e.to]));
         }
     }
     cnt++;
     if(cnt==n)
       break;
   }
}
void Astar()
{
   int out[MAXN];
   memset(out,0,sizeof(out));
   priority_queue <anode> Q;
   Q.push(anode(1,0,dist[1]));
   while (!Q.empty())
   {
     anode now=Q.top();Q.pop();
     out[now.to]++;
     if (now.to==n&&now.cost<INF)
     {
       printf("%d\n",now.cost);
       if (out[n]==k)
         return;
     }
     int siz=Edge1[now.to].size()-1;
     For(i,0,siz)
     {
       adj &e=Edge1[now.to][i];
       if (out[e.to]<=k)
         Q.push(anode(e.to,now.cost+e.dist,dist[e.to]));
     }
   }
   while (out[n]<k)
   {
     printf("%d\n",-1);
     k--;
   }
}