Cod sursa(job #583291)

Utilizator flaviusc11Fl. C. flaviusc11 Data 19 aprilie 2011 15:12:57
Problema Distante Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.88 kb
#include<cstdio>
const int pinf=1000001;
using namespace std;
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    int n,m,i,j,k,T,t,np,x,y,c,valid;
    int a[721][721];
    scanf("%d",&T);
    for(t=1;t<=T;++t)
    { valid=1;
    scanf("%d%d%d",&n,&m,&np);
    for(i=1;i<=n;i++)
       for(j=1;j<=n;j++)
       {
           if(i==j) a[i][j]=0; else a[i][j]=pinf;
       }
    for(i=1;i<=n;i++)
       scanf("%d",&a[0][i]);
    for(i=1;i<=m;i++)
          {scanf("%d%d%d",&x,&y,&c);
          a[x][y]=a[y][x]=c;}
    for(k=1;k<=n;k++)
          for(j=1;j<=n;j++)
            if(a[np][j]>a[np][k]+a[k][j])
               a[np][j]=a[np][k]+a[k][j];
    for(i=1;i<=n;++i)
       if(a[np][i]!=a[0][i])
              valid=0;
     if(valid)
        printf("DA\n");
     else
        printf("NU\n");
    }
       return 0;
}