Pagini recente » Cod sursa (job #2855536) | Cod sursa (job #2054014) | Cod sursa (job #2538536) | Cod sursa (job #3282153) | Cod sursa (job #2972821)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("sate.in");
ofstream cout ("sate.out");
int dist[100024];
struct sat{
int nod, cost;
};
vector <sat> v[100024];
int n,m,s,f,x,y,c;
void dfs(int node){
int marime = v[node].size();
for(int i=0; i<marime; i++)
if(dist[v[node][i].nod]==0){
if(v[node][i].nod < node)
dist[v[node][i].nod] = dist[node] - v[node][i].cost;
else
dist[v[node][i].nod] = dist[node] + v[node][i].cost;
dfs(v[node][i].nod);
}
}
int main()
{
cin>>n>>m>>s>>f;
for(int i=1; i<=m; i++)
{
cin>>x>>y>>c;
v[x].push_back({y, c});
v[y].push_back({x, c});
}
dist[s]=1;
dfs(s);
cout<<dist[f]-1;
return 0;
}