Cod sursa(job #419495)

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

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

bool rezolv()
{
	if(C[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(C[V[i][j].first] + V[i][j].second == C[i])
				a = 1;
			else if(C[V[i][j].first] + V[i][j].second < C[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;
}