Pagini recente » Cod sursa (job #1570463) | Cod sursa (job #1244481) | Cod sursa (job #2039220) | Cod sursa (job #1262064) | Cod sursa (job #1813466)
#include <stdio.h>
#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
if(pbuf==BUF_SIZE){
fread(buf, BUF_SIZE, 1, fi);
pbuf=0;
}
return buf[pbuf++];
}
inline long long nextnum(){
long long a=0;
char c=nextch();
while((c<'0' || c>'9') && c!='-')
c=nextch();
int semn=1;
if(c=='-'){
semn=-1;
c=nextch();
}
while('0'<=c && c<='9'){
a=a*10+c-'0';
c=nextch();
}
return a*semn;
}
#define MAXN 50000
int dmin[1+MAXN];
int main(){
fi=fopen("distante.in","r");
fo=fopen("distante.out","w");
int t=nextnum();
for(int z=0;z<t;z++){
int binibiniditat=1;
int n=nextnum(), m=nextnum(), s=nextnum();
for(int i=1;i<=n;i++)
dmin[i]=nextnum();
if(dmin[s]!=0)
binibiniditat=0;
for(int i=1;i<=m;i++){
int a=nextnum(), b=nextnum(), c=nextnum();
if(dmin[a]+c<dmin[b] || dmin[b]+c<dmin[a])
binibiniditat=0;
}
if(binibiniditat==1)
fprintf(fo,"DA\n");
else
fprintf(fo,"NU\n");
}
fclose(fi);
fclose(fo);
return 0;
}