Cod sursa(job #419514)

Utilizator s_holmesSherlock Holmes s_holmes Data 17 martie 2010 17:19:45
Problema Distante Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.02 kb
#include <cstdio>
#include <vector>
#define NMAX 55001
#define INF 1000000000
using namespace std;
int T;
int val[NMAX];
int N,M,INC;
vector<int> V[NMAX];
vector<int> C[NMAX];

void citire()
{
	int x,y,c;
	scanf("%d %d %d",&N,&M,&INC);
	for(int i = 1 ; i <= N ; i++)
		scanf("%d",&val[i]);
	for(int i = 1 ; i <= M ; i++)
	{
		scanf("%d %d %d",&c,&x,&y);
		V[x].push_back(y);
		C[x].push_back(c);
		V[y].push_back(x);
		C[y].push_back(c);
	}
		
}

bool rezolv()
{
	if(val[INC] != 0)
		return 0;
	for(int i = 1 ; i <= N ; i++)
	{
		if(i == INC)
			continue;
		bool a = 0;
		for(int j = 0 ; j < V[i].size() ; j++)
			if(val[V[i][j]] + C[i][j] == val[i])
				a = 1;
			else if(val[V[i][j]] + C[i][j] < val[i])
					return 0;
		if(!a)
			return 0;
	}
	
	return 1;
}

int main()
{
	freopen("distante.in","r",stdin);
	freopen("distante.out","w",stdout);
	scanf("%d",&T);
	for(int i=1;i<=T;i++)
	{
		citire();
		if(rezolv())
			printf("DA\n");
		else
			printf("NU\n");
	}
		
	return 0;
}