Pagini recente » Cod sursa (job #2310426) | Cod sursa (job #1536) | Cod sursa (job #132527) | Cod sursa (job #1907642) | Cod sursa (job #2556544)
#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 30000;
struct muchii
{
int nod , d;
};
muchii temp;
vector <muchii> G[NMAX + 5];
int d[NMAX + 5] , viz[NMAX + 5];
int sign(int a , int b)
{
if(a < b)
return 1;
return -1;
}
void dfs(int u)
{
int v , j;
viz[u] = 1;
for(j = 0 ; j < G[u].size() ; j ++)
{
v = G[u][j].nod;
if(viz[v] == 0)
{
d[v] = d[u] + G[u][j].d * sign(u , v);
dfs(v);
}
}
}
int main()
{
freopen("sate.in" , "r" , stdin);
freopen("sate.out" , "w" , stdout);
int n , m , start , finish , x , y , z , i;
scanf("%d%d%d%d" , &n , &m , &start , &finish);
for(i = 1 ; i <= m ; i ++)
{
scanf("%d%d%d" , &x , &y , &z);
temp.nod = y;
temp.d = z;
G[x].push_back(temp);
temp.nod = x;
G[y].push_back(temp);
}
dfs(start);
printf("%d\n" , d[finish]);
return 0;
}