Pagini recente » Cod sursa (job #1845565) | Cod sursa (job #2871383) | Cod sursa (job #1053203) | Cod sursa (job #1964158) | Cod sursa (job #2210963)
#include <bits/stdc++.h>
using namespace std;
ifstream in("sate.in");
ofstream out("sate.out");
vector < pair < int , int > > G[30001];
int viz[30001],n,x,m,y;
void dfs(int i)
{
int j;
for(j = 0 ;j< G[i].size(); j++)
{
int w=G[i][j].first;
int cost=G[i][j].second;
if(!viz[w])
{
viz[w]=viz[i]+cost;
dfs(w);
}
}
}
int main()
{
int a,b;
in>>n>>m>>a>>b;
if(b<a)
swap(a,b);
for(int i = 1; i <= m; i++)
{
int x,y,c;
in>>x>>y>>c;
G[x].push_back(make_pair(y,c));
G[y].push_back(make_pair(x,-c));
}
dfs(a);
out<<viz[b];
return 0;
}