Pagini recente » Cod sursa (job #564914) | Cod sursa (job #1604945) | Cod sursa (job #2792783) | Cod sursa (job #1006743) | Cod sursa (job #677589)
Cod sursa(job #677589)
#include<cstdio>
#define DN 2005
#define CIC 99999999
int n, m, d[DN], ck[DN], k, mink=CIC, maxk=0; bool viz[DN];
FILE *f=fopen("ubuntzei.in", "r");
FILE *g=fopen("ubuntzei.out", "w");
struct graf
{
int nod1, nod2, c;
graf *urm;
}*a[DN];
void NO_TO_ACTA()
{
fscanf(f, "%d%d", &n, &m);
fscanf(f, "%d", &k);
for(int i=1; i<=k; ++i)
{
fscanf(f, "%d", &ck[i]);
viz[ck[i]]=1;
}
for(int i=2; i<=n; ++i)
d[i]=CIC;
for(int i=1; i<=m; ++i)
{
int x, y, c;
fscanf(f, "%d%d%d", &x, &y, &c);
graf *q = new graf;
q->nod1=x;
q->nod2=y;
if(viz[y]==1)
q->nod2=-1;
q->c=c;
q->urm=a[1];
a[1]=q;
if(x==1)
d[y]=c;
}
}
int main()
{
NO_TO_ACTA();
bool ok=1; int cont;
while(ok)
{
graf *q;
q=a[1]; ok=0; cont=0;
while(q!=NULL)
{
if(d[q->nod2]==-1)
{
d[q->nod2]=d[q->nod1]+q->c;
ok=1;
}
else
{
if(d[q->nod2]>d[q->nod1]+q->c)
{
d[q->nod2]=d[q->nod1]+q->c;
ok=1;
}
}
q=q->urm;
}
}
if(d[n]!=CIC)
fprintf(g, "%d ", d[n]);
else
fprintf(g, "0 ");
}