Cod sursa(job #545008)

Utilizator avram_florinavram florin constantin avram_florin Data 2 martie 2011 16:31:06
Problema Distante Scor 40
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.62 kb
#include<fstream>
#include<cstdio>

using namespace std;

const int MaxN = 50005;

int T,n,m,S,d[MaxN];

int rezolv()
{
	scanf("%d%d%d" , &n , &m , &S);
	int x,y,c;
	for( int i = 1 ; i <= n ; i++ )
		scanf("%d" , &d[i]);
	if( d[S] )
		return 0;
	for( int i = 1 ; i <= m ; i++ )
		{
			scanf("%d%d%d" , &x , &y , &c);
			if( d[x] + c < d[y] || d[y] + c < d[x] )
				return 0;
		}
	return 1;
}

int main()
{
	freopen("distante.in" , "r" , stdin);
	freopen("distante.out" , "w" , stdout);
	scanf("%d" , &T);
	while( T-- )
			if( rezolv() )
				printf("DA\n");
				else
				printf("NU\n");
	return 0;
}