Mai intai trebuie sa te autentifici.
Cod sursa(job #681848)
Utilizator | Data | 17 februarie 2012 22:01:34 | |
---|---|---|---|
Problema | Ubuntzei | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.92 kb |
#include<fstream>
#define INF 0x3f3f3f3f
#define NN 2001
using namespace std;
ofstream out("ubuntzei.out");
int a[NN][NN],v[NN],d[NN],ubu[NN],n,m,k;
void citire();
int dijkstra(int start);
int main()
{
citire();
dijkstra(1);
out<<d[n]<<" ";
return 0;
}
void citire()
{
ifstream in("ubuntzei.in");
in>>n>>m;
in>>k;
for(int kk=1;kk<=k;kk++)
in>>ubu[kk];
int i,j,c;
for(;m;m--)
{
in>>i>>j>>c;
a[i][j]=a[j][i]=c;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]==0&&i!=j)
a[i][j]=a[j][i]=INF;
}
int dijkstra(int start)
{
int i,j,t,poz;
for(i=1;i<=n;i++)
{
v[i]=0;
d[i]=a[start][i];
}
v[start]=1;
for(i=1;i<n;i++)
{
int minim=INF;
for(j=1;j<=n;j++)
if(d[j]<minim&&!v[j])
{
minim=d[j];
poz=j;
}
v[poz]=1;
for(t=1;t<=n;t++)
if(d[t]>d[poz]+a[poz][t])
d[t]=d[poz]+a[poz][t];
}
return 1;
}