POJ-3159-Candies

#include<cstdio>
#include<cstring>
#include<iostream>
#include<stack>
using namespace std;
const int maxn=150100;
const int maxm=30100;
int e,n,m,head[maxm],nxt[maxn],pnt[maxn],cost[maxn],dist[maxm];
bool vis[maxm];
stack<int> s;
void AddEdge(int u,int v,int c)
{
pnt[e]=v;nxt[e]=head[u];cost[e]=c;head[u]=e++;
}
int Spfa(int st)
{
memset(dist,0x7f,sizeof(dist));
memset(vis,0,sizeof(vis));
dist[st]=0;
s.push(st);
while(!s.empty())
{
int u=s.top();
vis[u]=0;
s.pop();
for(int i=head[u];i!=-1;i=nxt[i])
{
int v=pnt[i];
if(dist[v]>dist[u]+cost[i])
{
dist[v]=dist[u]+cost[i];
if(!vis[v])
{
vis[v]=1;
s.push(v);
}
}
}
}
return dist
;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(head,-1,sizeof(head));
e=0;
for(int i=0;i<m;i++)
{
int u,v,c;
scanf("%d%d%d",&u,&v,&c);
AddEdge(u,v,c);
}
printf("%d\n",Spfa(1));
}
return 0;
}