Pagini recente » Cod sursa (job #1596533) | Cod sursa (job #3213950) | Cod sursa (job #1917767) | Cod sursa (job #466922) | Cod sursa (job #3258144)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sate.in");
ofstream cout("sate.out");
const int Nmax = 3e4 + 5;
vector<pair<int, int>>g[Nmax];
int vis[Nmax];
void dfs(int nod, int tata, int dist, int y)
{
vis[nod] = 1;
if(nod == y)
{
cout << dist;
return;
}
for(auto it: g[nod])
if(vis[it.first] == 0 )
dfs(it.first, nod, dist + it.second, y);
}
int main()
{
int n, m, x, y, i, a, b, c;
cin >> n >> m >> x >> y;
for(i = 1; i <= m; i ++)
{
cin >> a >> b >> c;
if(a > b) swap(a, b);
g[a].push_back({b, c});
g[b].push_back({a, -c});
}
dfs(x, 0, 0, y);
return 0;
}